Networking and Computation by Thomas G. Robertazzi & Li Shi

Author:Thomas G. Robertazzi & Li Shi
Language: eng
Format: epub
ISBN: 9783030367046
Publisher: Springer International Publishing

While an elegantly simple idea, actual implementations must take several complications into account. These include the time-varying nature of available processor effort and link capacity, the release times of processors (i.e., the times at which processors become free to accept additional load) and assuring that load is distributed on the fastest processors and links. All in all, these probing strategies are a promising approach to robust divisible load scheduling.

9. Extending Realism

Efforts have been made to extend the applicability of divisible load scheduling. This includes a consideration of systems with finite buffers [47, 80, 152], finite job granularity [43], start-up costs or fixed charges [41, 44], scheduling with processor release (i.e., availability) times [39, 47], scheduling multiple divisible loads [27, 147], probabilistic computation/communications speeds [14], energy issues [83, 85], real time computing [155, 156, 160, 161] and processor priorities [97]. Moreover efforts to produce a synthesis of deterministic divisible load modeling and stochastic (queueing) modeling have been made [143, 144, 171, 219]. Specialized applications of divisible load scheduling include databases [79, 141, 142, 144], image processing, multimedia systems [17–20, 45], matrix multiplication [70, 99, 146], aligning protein sequences [182], cloud computing [129, 154, 224], Map Reduce modeling [31–33, 35], and fault tolerant scheduling [25, 246].

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.