Abstract
The authors develop a parallel single-row routing algorithm for a hypercube multiprocessor. The parallel algorithm is based on an earlier sequential O(n/sup 2/ log n) algorithm and an efficient allocation scheme. The algorithm uses a graph decomposition technique and modified cut-number to partition the problem into several subproblems. Each problem is solved on a different processor and solutions are merged in parallel. It is proved that the algorithm has a linear speedup of (n/sup 2/ log n)/N using N processors and that the allocation scheme is optimal. The experimental results show that the proposed algorithm achieves a speedup factor that is quite close to the theoretical bound while maintaining the quality of the solutions as compared to sequential algorithms. >
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.
