Presentation 2001/9/7
A Distributed Resource Allocation Algorithm in a Unidirectional Ring
Atsushi Sasaki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We designed a time-optimal algorithm for a variant of a k-mutual exclusion in a unidirectional ring. Our problem is that none of the processes specifies the resource that it requires and each resource is assigned to a process with a higher priority than that of unassigned processes without overlapping when there are k resources with the same ability in the network. There are two major conventional resource allocation problems with multiple resources in a distributed context, the k-mutual exclusion problem and the drinking philosophers problem. However, these problems do not include ours. In this paper, we report our design of a strictly time-optimal algorithm in a static situation, which we extended to cope with a dynamic situation.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) distributed algorithm / k-selection / k-mutural exclusion / time complexity / unidirectional ring / resource allocation
Paper # COMP2001-34
Date of Issue

Conference Information
Committee COMP
Conference Date 2001/9/7(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Distributed Resource Allocation Algorithm in a Unidirectional Ring
Sub Title (in English)
Keyword(1) distributed algorithm
Keyword(2) k-selection
Keyword(3) k-mutural exclusion
Keyword(4) time complexity
Keyword(5) unidirectional ring
Keyword(6) resource allocation
1st Author's Name Atsushi Sasaki
1st Author's Affiliation NTT Communication Science Laboratories, NTT Corporation()
Date 2001/9/7
Paper # COMP2001-34
Volume (vol) vol.101
Number (no) 307
Page pp.pp.-
#Pages 8
Date of Issue