Parallelism detection and transformation techniques useful for VLSI algorithms

Journal of Parallel and Distributed Computing

Volumn 2, Issue 3, 1985, Pages 277-301

  Fortes, J A B ^a   Moldovan, D I ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING; INTEGRATED CIRCUITS, VLSI - MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES - CONFORMAL MAPPING;

EQUIVALENT TRANSFORMED ALGORITHMS; PARALLELISM DETECTION AND TRANSFORMATION; VLSI ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0022110153     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-7315(85)90029-2     Document Type: Article

References (30)

1. Why systolic architectures?
2. Algorithms for VLSI processor arrays
3. Wavefront array processor Language architecture and applications
4. Towards a formal treatment of VLSI arrays
5. Partitioned matrix algorithms for VLSI arithmetic systems
6. VLSI computing structure for solving large scale linear systems of equations
7. A two-level pipelined systolic array for convolutions
8. Systolic array processor developments
9. The design of special purpose VLSI chips
10. VLSI architecture for high speed recognition of general context free languages and finite state languages
11. Systolic processing and an implementation for signal and image processing
12. On the analysis and synthesis of VLSI algorithms
13. On the design of algorithms for VLSI systolic arrays
14. A mathematical approach to modelling the flow of data and control in computational networks
15. The design of optimal systolic algorithms
16. Optimization and interconnection complexity for parallel processors, single stage networks and decision trees
17. Time and parallel processor bounds for FORTRAN-like loops
18. High-speed multiprocessors and compilation techniques
19. The parallel execution of DO-loops
20. Improved time and parallel processor bounds for FORTRAN-like loops
21. Algorithm transformations for parallel processing and VLSI architecture design
22. Introduction to the configurable highly parallel computer
23. Optimal linear schedules for the parallel execution of algorithms
24. Partitioning algorithms for fixed size VLSI architectures