Localization of Data Transfer in Processor Arrays

  • Dirk Fimmel
  • Renate Merker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1685)


In this paper we present an approach to localize the data transfer in processor arrays. Our aim is to select channels between processors of the processor array performing the data transfers. Channels can be varying with respect to the bandwidth and to the communication delay and can be bidirectional. Our objective is to minimize the implementation cost of the channels while satisfying the data dependencies. The presented approach also applies to the problem of localizing data dependencies for a given interconnection topology. The formulation of our method as an integer linear program allows its use for automatic parallelization.


  1. [1]
    W.H. Chou and S.Y. Kung. Scheduling partitioned algorithms on processor arrays with limited communication support. In Proc. IEEE Int. Conf. on Application Specific Systems, Architectures and Processors’93, pages 53–64, Venice, 1993.Google Scholar
  2. [2]
    A. Darte and Y. Robert. Constructive methods for scheduling uniform loop nests. IEEE Trans. on Parallel and Distributed Systems, 5(8):814–822, 1994.Google Scholar
  3. [3]
    M. Dion, T. Risset, and Y. Robert. Resource constraint scheduling of partitioned algorithms on processor arrays. Integration, the VLSI Journal, 20:139–159, 1996.Google Scholar
  4. [4]
    D. Fimmel and R. Merker. Determination of the processor functionality in the design of processor arrays. In Proc. IEEE Int. Conf. on Application Specific Systems, Architectures and Processors’97, pages 199–208, Zü;rich, 1997.Google Scholar
  5. [5]
    D. Fimmel and R. Merker. Design of processor arrays for real-time applications. In Proc. Int. Conf. Euro-Par’ 98, pages 1018–1028, Southampton, 1998. Lecture Notes in Computer Science, Springer.Google Scholar
  6. [6]
    J.A.B. Fortes and D.I. Moldovan. Parallelism detection and transformation techniques useful for vlsi algorithms. Journal of Parallel and Distributed Computing, 2:277–301, 1985.Google Scholar
  7. [7]
    R.M. Karp, R.E. Miller, and S. Winograd. The organization of computations for uniform recurrence equations. Journal of the ACM, 14:563–590, 1967.Google Scholar
  8. [8]
    S.Y. Kung. VLSI Array Processors. Prentice Hall, Englewood Cliffs, 1987.Google Scholar
  9. [9]
    P.Z. Lee and Z.M. Kedem. Mapping nested loop algorithms into multidimensional systolic arrays. IEEE Trans. on Parallel and Distributed Systems, 1:64–76, 1990.Google Scholar
  10. [10]
    S.K. Rao. Regular Iterative Algorithms and their Implementations on Processor Arrays. PhD thesis, Stanford University, 1985.Google Scholar
  11. [11]
    A. Schrijver. Theory of Integer and Linear Programming. John Wiley & Sons, New York, 1986.Google Scholar
  12. [12]
    L. Thiele. Resource constraint scheduling of uniform algorithms. Int. Journal on VLSI and Signal Processing, 10:295–310, 1995.Google Scholar
  13. [13]
    Y. Wong and J.M. Delosme. Optimal systolic implementation of n-dimensional recurrences. In Proc. ICCD, pages 618–621, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Dirk Fimmel
    • 1
  • Renate Merker
    • 1
  1. 1.Department of Electrical EngineeringDresden University of TechnologyDresdenGermany

Personalised recommendations