A parallel algorithm for minimum cost path computation on polymorphic processor array

  • P. Baglietto
  • M. Maersca
  • M. Migliardi
Reconfigurable Architectures Workshop Peter M. Athanas, Virginia Tech, USA Reiner W. Hartenstein, University of Kaiserslautern, Germany
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1388)


This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh interconnection network. The proposed algorithm has been implemented using the Polymorphic Parallel C language and has been validated through simulation. The proposed algorithm for the Polymorphic Processor Array, delivers the same performance, in terms of computational complexity, as the hypercube interconnection network of the Connection Machine, and as the Gated Connection Network.


Interconnection Network Processor Array Minimum Cost Path Destination Vertex Connection Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Miller, V.K. Prasanna-Kumar: D.I. Reisis and Q. F. Stout, Parallel Computations on Reconfigurable Meshes. IEEE Trans. on Computers, Vol. 42, No. 6, pp. 678692, June 1993CrossRefGoogle Scholar
  2. [2]
    M. Maresca, H. Li and P. Baglietto: Hardware Support for Fast Reconfigurability in Processor Arrays. Proc. of the International Conference on Parallel Processing (ICPP), St. Charles (IL), August 1993.Google Scholar
  3. [3]
    M. Maresca and P. Baglietto: A Programming Model for Reconfigurable Mesh Based Parallel Computers. Proc. of the Working Conference on Massively Parallel Programming Models (IEEE Press), Berlin (Germany), Sept 20–22, 1993.Google Scholar
  4. [4]
    W. D. Hillis: The Connection Machine. The MIT Press, Cambridge (MA), 1985.Google Scholar
  5. [5]
    D. B. Shu, J. G. Nash: The Gated Interconnection Network for Dynamic Programming. Concurrent Computations, S. K. Tewsburg, B. W. Dickinson and S. C. Schwartz eds., Plenum Publishing Company, pp. 645–658.Google Scholar
  6. [6]
    B. F. Wang and G. C. Chen: Constant Time Algorithms for the Transistive Closure and Some Related Graph Problem on Processor Arrays with Reconfigurable Bus System. IEEE Trans. on Parallel and Distributed Systems Vol. 1, No. 4, pp. 500–507, 1990. *** DIRECT SUPPORT *** A0008D07 00002CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • P. Baglietto
    • 1
  • M. Maersca
    • 2
  • M. Migliardi
    • 1
  1. 1.DIST - University of GenoaGenovaItaly
  2. 2.DEI - University of PaduaPadovaItaly

Personalised recommendations