Nondominated local coteries for resource allocation in grids and clouds

https://doi.org/10.1016/j.ipl.2011.01.008Get rights and content

Abstract

The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the problem in a distributed way. Distributed algorithms using coteries usually incur low communication overheads and have high degrees of fault-tolerance, and ND coteries are candidates for the algorithms to achieve the highest degree of fault-tolerance. A new type of coteries, called p-coteries, is defined to aid the construction of local coteries. Theorems about the nondomination of p-coteries are then developed, and an operation, called pairwise-union (p-union), is proposed to help generate ND p-coteries, which in turn can be used to generate ND local coteries for solving the resource allocation problem.

Highlights

► We study the resource allocation problem in Grid and Cloud computing environments. ► We construct nondominated (ND) local coteries to solve the problem. ► A new type of coteries, called p-coteries, is defined. ► Theorems about p-coterie nondomination are developed. ► The pairwise-union operation is used to form ND p-coteries and ND local coteries.

References (16)

  • I. Foster et al.

    The anatomy of the grid: Enabling scalable virtual organizations. International

    Journal Supercomputer Applications

    (2001)
  • F. Chang, J. Ren, R. Viswanathan, Optimal resource allocation in clouds, in: Proc. of IEEE 3rd International Conference...
  • E.W. Dijkstra

    Solution to a problem in concurrent programming control

    CACM

    (1965)
  • M. Fisher, N. Lynch, J. Burns, A. Borondin, Resource allocation with immunity to limited process failure, in: Proc. of...
  • M. Raynal

    A distributed solution for the k-out of-m resources allocation problem

  • E.W. Dijkstra

    Hierarchical ordering of sequential processes

    Acta Informatica

    (1971)
  • K.M. Chandy et al.

    The drinking philosophers problem

    ACM Transactions on Programming Languages and Systems

    (1984)
  • H. Garcia-Molina et al.

    How to assign votes in a distributed system

    JACM

    (1985)
There are more references available in the full text version of this article.

Cited by (6)

View full text