Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
