๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Multiple Instance Resource Allocation in Distributed Computing Systems

โœ Scribed by R. Satyanarayanan; C.R. Muthukrishnan


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
531 KB
Volume
23
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis


A token-based distributed algorithm to perform the allocation of any one from a set of multiple instances of a shared resource type has been presented in this note. The number of messages generated by the algorithm per critical section execution for accessing a resource instance varies from 0 to (2(n-1)), where (n) is the number of nodes in the distributed system. An advantage of the algorithm presented here is that the upper bound on the number of messages generated per critical section execution is independent of the number of instances of the resource type covered by the algorithm. 1994 Academic Press, Inc.


๐Ÿ“œ SIMILAR VOLUMES


An Improved Algorithm for Module Allocat
โœ Ajith Tom P.; C. Siva Ram Murthy ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

We consider the problem of finding an optimal and sub-optimal allocation of program modules onto processors of a distributed computing system. A module causes two types of cost to be incurred at the processor to which it is allocated-an execution cost for processing the module, and a communication c

Processor Allocation in Multiprogrammed
โœ Vijay K. Naik; Sanjeev K. Setia; Mark S. Squillante ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 451 KB

In this paper, we examine three general classes of space-sharing scheduling policies under a workload representative of large-scale scientific computing. These policies differ in the way processors are partitioned among the jobs as well as in the way jobs are prioritized for execution on the partiti