A Systolic Array Parallelizing Compiler

Widespread use of parallel processing will become a reality only if the process of porting applications to parallel computers can be largely automated. Usually it is straightforward for a user to determine how an application can be mapped onto a parallel machine; however, the actual development of p...

Full description

Bibliographic Details
Main Author: Ping-Sheng Tseng
Format: eBook
Language:English
Published: New York, NY Springer US 1990, 1990
Edition:1st ed. 1990
Series:The Springer International Series in Engineering and Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03453nmm a2200313 u 4500
001 EB000621571
003 EBX01000000000000000474653
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9781461315599 
100 1 |a Ping-Sheng Tseng 
245 0 0 |a A Systolic Array Parallelizing Compiler  |h Elektronische Ressource  |c by Ping-Sheng Tseng 
250 |a 1st ed. 1990 
260 |a New York, NY  |b Springer US  |c 1990, 1990 
300 |a XVIII, 130 p  |b online resource 
505 0 |a 1 Introduction -- 2 Systolic array programming -- 2.1 The Warp machine -- 2.2 The W2 programming language -- 2.3 The AL programming language -- 2.4 Related work -- 3 Data relations -- 3.1 Linear data relations -- 3.2 Joint data compatibility classes -- 3.3 Scope of data compatibility classes -- 3.4 Summary -- 4 Loop Distribution -- 4.1 Intercell communication -- 4.2 The basic loop distribution scheme -- 4.3 Distributed loop parallelism -- 4.4 Optimization -- 4.5 Related work -- 5 Implementation -- 5.1 External interface -- 5.2 Compiling DO* loops -- 5.3 The ALIGN* statement -- 5.4 Parallel accumulation -- 5.5 Program debugging -- 6 Evaluation -- 6.1 Matrix computations -- 6.2 2D Fast Fourier Transform -- 6.3 Partial differential equation solvers -- 6.4 Summary -- 7 Conclusions -- A Linear data relations in Livermore Loops -- B Benchmark programs -- B.1 LU decomposition -- B.1.1 Single cell -- B.1.2 Multiple cells -- B.2 QR decomposition -- B.2.1 Single cell -- B.2.2 Multiple cells -- B.3 Singular value decomposition -- B.3.1 Single cell -- B.3.2 Multiple cell -- B.4 2D Fast Fourier Transform -- B.4.1 Single cell -- B.4.2 Multiple cell -- B.5 Partial differential equation solvers -- B.5.1 SOR -- B.5.2 Line SOR -- B.5.3 Two-color SOR. 
653 |a Signal, Speech and Image Processing 
653 |a Processor Architectures 
653 |a Microprocessors 
653 |a Signal processing 
653 |a Computer architecture 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a The Springer International Series in Engineering and Computer Science 
028 5 0 |a 10.1007/978-1-4613-1559-9 
856 4 0 |u https://doi.org/10.1007/978-1-4613-1559-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.22 
520 |a Widespread use of parallel processing will become a reality only if the process of porting applications to parallel computers can be largely automated. Usually it is straightforward for a user to determine how an application can be mapped onto a parallel machine; however, the actual development of parallel code, if done by hand, is typically difficult and time consuming. Parallelizing compilers, which can gen­ erate parallel code automatically, are therefore a key technology for parallel processing. In this book, Ping-Sheng Tseng describes a parallelizing compiler for systolic arrays, called AL. Although parallelizing compilers are quite common for shared-memory parallel machines, the AL compiler is one of the first working parallelizing compilers for distributed­ memory machines, of which systolic arrays are a special case. The AL compiler takes advantage of the fine grain and high bandwidth interprocessor communication capabilities in a systolic architecture to generate efficient parallel code. xii Foreword While capable of handling an important class of applications, AL is not intended to be a general-purpose parallelizing compiler