A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array

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.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Pierpaolo Baglietto, Massimo Maresca, Mauro Migliardi
• Keywords: Distributed And Parallel Computing, Interconnection Network, IPPS 1998, Polymorphic Parallel, Polymorphic Processor Array