June 2020
Intermediate to advanced
382 pages
11h 39m
English
Figure 1.3 shows the pseudocode of a resource allocation algorithm called SRPMP. In cluster computing, there are many situations where there are parallel tasks that need to be run on a set of available resources, collectively called a resource pool. This algorithm assigns tasks to a resource and creates a mapping set, called Ω. Note that the presented pseudocode captures the logic and flow of the algorithm, which is further explained in the following section:
1: BEGIN Mapping_Phase2: Ω = { }3: k = 14: FOREACH Ti∈T5: ωi = RA(Δk,Ti)6: add {ωi,Ti} to Ω7: state_changeTi [STATE 0: Idle/Unmapped] → [STATE 1: Idle/Mapped]8: k=k+19: IF (k>q)10: k=111: ENDIF12: END FOREACH13: END Mapping_Phase
Let's parse this algorithm ...