Cloud Computing by Dan C. Marinescu

Author:Dan C. Marinescu
Language: eng
Format: epub
ISBN: 9780124046412
Publisher: Elsevier Inc.
Published: 2013-06-03T16:00:00+00:00

(6.80)

The application can meet its deadline only if , and under this condition this inequality becomes

(6.81)

If , there is not enough time even for data distribution and the application should be rejected. When , then . Thus, the minimum number of nodes for the OPR strategy is

(6.82)

Equal Partitioning Rule (EPR). EPR assigns an equal workload to individual worker nodes, . From the diagram in Figure 6.14 we see that

(6.83)

The condition for meeting the deadline, , leads to

(6.84)

Figure 6.14 The timing diagram for the equal partitioning rule. The algorithm assigns an equal workload to individual worker nodes, . The head node, , distributes sequentially the data to individual worker nodes. The communication time is . Worker node starts processing the data as soon as the transfer is complete. The processing time is .

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.