Loading in 2 Seconds...
Loading in 2 Seconds...
Chapter 5 Distributed Process Scheduling. 5.1 A System Performance Model. --Niharika Muriki. Outline. Need for Scheduling Process Interaction Models System Performance Model Efficiency Loss Distribution of Workload Comparison of Performance for Workload Sharing
Process scheduling in distributed systems touches upon several
practical considerations that are often omitted in the traditional multiprocessor scheduling.
In distributed systems,
Based on the differences in interactions between processes, we have 3 types of process interaction models namely,
We have depicted the differences in interactions between processes using a simple example of a program computation consisting of four processes mapped to a two-processor multiple computer system.
Speedup is a function of
Si can be further derived as,
Sd can be rewritten as
Following figure demonstrates the decomposition of efficiency loss due to scheduling and system communication.
Static Load Sharing
Dynamic Load Balancing
*M for Markovian distribution
Flow scheduling is crucial in the next-generation network but hard to address due to fast changing link states and tremendous cost to explore the global structure.
Large-scale Bag-of-Tasks (BoT) applications are characterized by their massively parallel, yet independent operations. The use of resources in public clouds to dynamically expand the capacity of a private computer system might be an appealing alternative to cope with such massive parallelism. To fully realize the benefit of this 'cloud bursting', the performance to cost ratio (or cost efficiency) must be thoroughly studied and incorporated into scheduling and resource allocation strategies.
 Randy Chow, Theodore Johnson, Distributed Operating Systems & Algorithms, 1997
 5 real life instances where queue operations are being used http://wiki.answers.com/Q/List_out_atleast_5_real_life_instances_where_queue_operations_are_being_used.
 Yaoqing Yang., Kegin Liu, & Pingyi Fan, Distributed flow scheduling in an unknown environment. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6576397&sortType%3Ddesc_p_Publication_Year%26queryText%3DDistributed+scheduling
 M. Reza HoseinyFarahabady, Young Choon Lee, Albert Y. Zomaya, "Pareto-Optimal Cloud Bursting," IEEE Transactions on Parallel and Distributed Systems, 27 Aug. 2013. IEEE computer Society Digital Library. IEEE Computer Society, http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.218