Design of parallel algorithms for the single resource allocation problem

Three new optimal parallel algorithms are presented for the single resource allocation problem. They run in the simplest networks: pipelines and rings. All of them have been implemented using PVM and MPI. Four representative platforms of the current state of parallel computing hardware were used for the experiences presented in this paper: the IBM SP2, the Cray T3E, the Silicon Origin 2000 and the Digital Alpha Server 8400. Computational results prove the good scalability of these three algorithms for practical cases.