Constructing Nondominated Local Coteries for Distributed Resource Allocation

  title={Constructing Nondominated Local Coteries for Distributed Resource Allocation},
  author={Jehn-Ruey Jiang and Cheng-Sheng Chou and Shing-Tsaan Huang},
  booktitle={ICPP Workshops},
The resource allocation problem is a fundamental problem in distributed systems. In this paper, we focus on constructing nondominated (ND) local coteries to solve the problem. Distributed algorithms using coteries usually incur low communication overhead and have high degree of fault-tolerance, and ND coteries are candidates for the algorithms to achieve the highest degree of fault-tolerance. We define a new type of coteries, called p-coteries, to aid the construction of local coteries. We then… CONTINUE READING

Figures and Topics from this paper.


Publications referenced by this paper.

Fault-tolerant distributed mutual exclusion with O(1) message overhead

  • J.-R. Jiang
  • Proc. of the 13th International Conference on…
  • 1995
Highly Influential
5 Excerpts

An efficient and fault-tolerant solution for distributed mutual exclusion

  • D. Agrawala, A. El Abbadi
  • ACM Transactions on Computing Systems, 9(1):1-20…
  • 1991
Highly Influential
4 Excerpts

Distributed h-out of-k mutual exclusion using k-coteries

  • J.-R. Jiang
  • Proc. of the 3rd International Conference on…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…