A Systolic Array Parallelizing Compiler

  • Ping-Sheng Tseng

Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 106)

Table of contents

  1. Front Matter
    Pages i-xvii
  2. Ping-Sheng Tseng
    Pages 1-3
  3. Ping-Sheng Tseng
    Pages 5-19
  4. Ping-Sheng Tseng
    Pages 21-35
  5. Ping-Sheng Tseng
    Pages 37-57
  6. Ping-Sheng Tseng
    Pages 59-68
  7. Ping-Sheng Tseng
    Pages 69-99
  8. Ping-Sheng Tseng
    Pages 101-103
  9. Back Matter
    Pages 105-130

About this book


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.


Scheduling communication computer fast Fourier transform (FFT) optimization processor

Authors and affiliations

  • Ping-Sheng Tseng
    • 1
  1. 1.Bell Communications Research, Inc.USA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag US 1990
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8835-0
  • Online ISBN 978-1-4613-1559-9
  • Series Print ISSN 0893-3405
  • Buy this book on publisher's site