Skip to main content

A system for designing parallel processor arrays

  • 1 Design Environments and Tools
  • Conference paper
  • First Online:
Computer Aided Systems Theory — EUROCAST'97 (EUROCAST 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1333))

Included in the following conference series:

Abstract

In this paper a system for the design of massively parallel processor arrays is presented. We describe new methods for the consideration of hardware constraints and of performance criteria in the design process. In particular, we focus on the determination of a full size array for the original algorithm which we want to implement in silicon. The arising optimization problems can be solved using integer linear programming. Furthermore, we describe methods for adapting the full size arrays to hardware constraints of a target architecture which is embedded in a peripheral system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Baltus: Efficient Exploration of Affine Space-Time Transformations for Optimal Systolic Array Synthesis, PhD Theses, MIT 1994

    Google Scholar 

  2. P. Held, P. Dewilde, E.F. Deprettere, P. Willage: HIFI: From Parallel Algorithm to Fixed-Size VLSI Prozessor Array, in Application-Driven Architecture Synthesis, F. Cathoor, L. Svensson (eds.), Kluwer Academic Publishers, pages 71–94, 1993

    Google Scholar 

  3. C.M.H. Leverge, P. Quinton: A language-oriented approach to the design of systolic chips, in Algorithms and Parallel VLSI-Architectures, A.J. van der Veen, E.F. Deprettere (eds.) Elsevier Science Publisher B.V., volume A, pages 309–327, 1991

    Google Scholar 

  4. A. Schubert, R. Merker, H. Schreiber: Systematic Generation of a Variety of Processor Arrays,in Parcella '94, Mathematical Research, Chr.Jesshope, V.Jossifov, W.Wilhelmi (eds.), vol. 81, Akademie-Verlag 1994, pages 267–276, 1994

    Google Scholar 

  5. J. Teich: A Compiler for Application-Specific Processor Arrays, PhD thesis, Univ. of Saarland, Verlag Shaker, Aachen 1993

    Google Scholar 

  6. L. Thiele: Resource Constraint Scheduling of Uniform Algorithms, Int. Journal on VLSI and Signal Processing, vol. 10, pp.295–310, 1995

    Article  Google Scholar 

  7. K. Jainandunsing: Optimal partitioning scheme for wavefront/systolic array processors, Proc. ISCAS86, 1986

    Google Scholar 

  8. X.Zhong, S.Rajopadhyue, I.Wong: Systematic Generation of Linear Allocation Functions in Systolic Array Design, Journ. of VLSI Signal Processing, vol. 4 pages 279–293, 1992

    Article  Google Scholar 

  9. J.Bu: Systematic Design of Regular VLSI Processor Arrays, PhD Thesis, Delft University of Technology, Delft, The Netherlands, 1990

    Google Scholar 

  10. U.Eckhardt: Nested Partitioning, Forschungsbericht SFB 358-Al-2/96

    Google Scholar 

  11. U.Eckhardt, R.Merker: Co-Partitioning-A Method for Hardware/Software Codesign for Scalable Systolic Arrays, In: Reconfigurable Architectures, R.W.Hartenstein, V.K.Prasanna (eds.) ITpress Verlag, 1997, pp.131–138

    Google Scholar 

  12. D.Fimmel, R.Merker: Optimization of the Processor Allocation in the Design of Massively Parallel Processor Arrays, Technical Report SFB 358-Al-6/96, TU Dresden, 1996

    Google Scholar 

  13. R.M.Karp, R.E.Miller, S.Winograd: The organization of computations for uniform recurrence equations, Journal of ACM, 14(3), July 1967

    Google Scholar 

  14. D.Fimmel, R.Merker: Determination of the Processor Functionality in the design of processor arrays, appears in Proc. ASAP'97, Zuerich, 1997

    Google Scholar 

  15. S.K.Rao: Regular Iterative Algorithms and their Implementations on Processor Arrays, PhD thesis, Stanford Universtity 1985

    Google Scholar 

  16. U.Eckhardt, R.Merker: Scheduling in Co-Partitioned Array Architectures, appears in Proc. ASAP'97, Zuerich, 1997

    Google Scholar 

  17. [17] U.Eckhardt: The Clustering of Systolic Arrays with Temporarily Passive Processors, Forschungsbericht SFB 358-A1-2/94

    Google Scholar 

  18. W.Shang, J.A.B.Fortes: Independent Partitioning of algorithms with uniform dependencies, Proc. Int. Con£ Parallel Processing, 1988, pp. 26–33

    Google Scholar 

  19. T. Thiessenhusen: Logic-Based Analysis of Transparency Properties of Complex Data Paths, appears in Proc. IEEE European Test Workshop, Cagliari 1997

    Google Scholar 

  20. Eckhardt, U.: Memory Management by Partitioning, Forschungsbericht SFB-358Al-1/97

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Franz Pichler Roberto Moreno-Díaz

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merker, R., Eckhardt, U., Fimmel, D., Schreiber, H. (1997). A system for designing parallel processor arrays. In: Pichler, F., Moreno-Díaz, R. (eds) Computer Aided Systems Theory — EUROCAST'97. EUROCAST 1997. Lecture Notes in Computer Science, vol 1333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025030

Download citation

  • DOI: https://doi.org/10.1007/BFb0025030

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63811-7

  • Online ISBN: 978-3-540-69651-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics