1 / 27

Distributed Scheduling

B. Prabhakaran. 2. Distributed Scheduling .... . . . . . P. ?. N = 5. N = 10. N = 20. 0.3. 0.2. 1.0. 1.0. B. Prabhakaran. 3. What is Load?. Load on a system/node can correspond to the queue length of tasks/ processes that need to be processed.Queue length of waiting tasks: proportional to task resp

cain
Download Presentation

Distributed Scheduling

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. B. Prabhakaran 1 Distributed Scheduling Motivation: A distributed system may have a mix of heavily and lightly loaded systems. Hence, migrating a task to share or balance load can help. Let P be the probability that the system is in a state in which at least 1 task is waiting for service and at least 1 server is idle. Let ? be the utilization of each server. We can estimate P using probabilistic analysis and plot a graph against system utilization. For moderate system utilization, value of P is high, i.e., at least 1 node is idle. Hence, performance can be improved by sharing of tasks.

    2. B. Prabhakaran 2 Distributed Scheduling ...

More Related