Abstract
In a large-scale parallel computing system, partitionability is an important feature that allows a large system to be partitioned into smaller subsystems so that multiple tasks can be run independently on different subsystems. In such a system, a task run on a subsystem may need to be migrated to another subsystem if the subsystem is faulty, if load balance is needed, or if subsystem restructuring is desired. This paper studies the partitionability of k-extra-stage Omega networks and presents an optimal task migration algorithm for k-extra-stage Omega networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.