Abstract
This chapter provides an in-depth look at the theory of scheduling computation and communication involving divisible (i.e., partitionable) loads being processed on networks of processors. This is a very useful methodology for understanding, designing, and analyzing load distribution scheduling. A literature survey begins the chapter. This is followed by a discussion of time optimal scheduling in single level tree (i.e., star) networks. Other sections cover equivalent processors, product form solutions, infinite size network performance, time-varying environments, and multi-installment scheduling. Applied scheduling problems involving monetary cost optimization and signature searching are presented. The chapter concludes by discussing mathematical programming solutions for divisible load scheduling.
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.
