Maintaining a dynamic set of processors in a distributed system

Satoshi Fujita; Masafumi Yamashita

doi:10.1007/3-540-61769-8_15

Maintaining a dynamic set of processors in a distributed system

Satoshi Fujita, Masafumi Yamashita

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

Consider a distributed system consisting of a set V of processors, and assume that every pair of processors can directly communicate with each other. A processor structure is proposed, for implementing a dynamic set U ⊆ V of processors in the distributed system. The dynamic set supports the following three operations: Insert inserts the caller (i.e., the processor executing this operation) in U, Delete removes the caller from U, and Find searches for a processor in U. To evaluate the efficiency of the implementation, an amortized analysis of the message complexity of operations is performed; the amortized number of messages per each operation is 8 + 121og₂(|V| - 1), in the worst case. The dynamic set is applicable to many important problems, including the load balancing problem, and the proposed processor structure is used to solve the mutual exclusion problem, and to construct a more complex dynamic set of processors like FIFO queue.

Original language	English
Title of host publication	Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings
Editors	Ozalp Babaoglu, Keith Marzullo
Publisher	Springer Verlag
Pages	220-233
Number of pages	14
ISBN (Print)	9783540617693
DOIs	https://doi.org/10.1007/3-540-61769-8_15
Publication status	Published - 1996
Event	10th International Workshop on Distributed Algorithms, WDAG 1996 - Bologna, Italy Duration: Oct 9 1996 → Oct 11 1996

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1151
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th International Workshop on Distributed Algorithms, WDAG 1996
Country/Territory	Italy
City	Bologna
Period	10/9/96 → 10/11/96

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-61769-8_15

Cite this

Fujita, S., & Yamashita, M. (1996). Maintaining a dynamic set of processors in a distributed system. In O. Babaoglu, & K. Marzullo (Eds.), Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings (pp. 220-233). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1151). Springer Verlag. https://doi.org/10.1007/3-540-61769-8_15

Maintaining a dynamic set of processors in a distributed system. / Fujita, Satoshi; Yamashita, Masafumi.
Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings. ed. / Ozalp Babaoglu; Keith Marzullo. Springer Verlag, 1996. p. 220-233 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1151).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Fujita, S & Yamashita, M 1996, Maintaining a dynamic set of processors in a distributed system. in O Babaoglu & K Marzullo (eds), Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1151, Springer Verlag, pp. 220-233, 10th International Workshop on Distributed Algorithms, WDAG 1996, Bologna, Italy, 10/9/96. https://doi.org/10.1007/3-540-61769-8_15

Fujita S, Yamashita M. Maintaining a dynamic set of processors in a distributed system. In Babaoglu O, Marzullo K, editors, Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings. Springer Verlag. 1996. p. 220-233. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-61769-8_15

Fujita, Satoshi ; Yamashita, Masafumi. / Maintaining a dynamic set of processors in a distributed system. Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings. editor / Ozalp Babaoglu ; Keith Marzullo. Springer Verlag, 1996. pp. 220-233 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d682c9c23f7649d28d56b4781481c599,

title = "Maintaining a dynamic set of processors in a distributed system",

abstract = "Consider a distributed system consisting of a set V of processors, and assume that every pair of processors can directly communicate with each other. A processor structure is proposed, for implementing a dynamic set U ⊆ V of processors in the distributed system. The dynamic set supports the following three operations: Insert inserts the caller (i.e., the processor executing this operation) in U, Delete removes the caller from U, and Find searches for a processor in U. To evaluate the efficiency of the implementation, an amortized analysis of the message complexity of operations is performed; the amortized number of messages per each operation is 8 + 121og2(|V| - 1), in the worst case. The dynamic set is applicable to many important problems, including the load balancing problem, and the proposed processor structure is used to solve the mutual exclusion problem, and to construct a more complex dynamic set of processors like FIFO queue.",

author = "Satoshi Fujita and Masafumi Yamashita",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; 10th International Workshop on Distributed Algorithms, WDAG 1996 ; Conference date: 09-10-1996 Through 11-10-1996",

year = "1996",

doi = "10.1007/3-540-61769-8_15",

language = "English",

isbn = "9783540617693",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "220--233",

editor = "Ozalp Babaoglu and Keith Marzullo",

booktitle = "Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings",

address = "Germany",

}

TY - GEN

T1 - Maintaining a dynamic set of processors in a distributed system

AU - Fujita, Satoshi

AU - Yamashita, Masafumi

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1996.

PY - 1996

Y1 - 1996

N2 - Consider a distributed system consisting of a set V of processors, and assume that every pair of processors can directly communicate with each other. A processor structure is proposed, for implementing a dynamic set U ⊆ V of processors in the distributed system. The dynamic set supports the following three operations: Insert inserts the caller (i.e., the processor executing this operation) in U, Delete removes the caller from U, and Find searches for a processor in U. To evaluate the efficiency of the implementation, an amortized analysis of the message complexity of operations is performed; the amortized number of messages per each operation is 8 + 121og2(|V| - 1), in the worst case. The dynamic set is applicable to many important problems, including the load balancing problem, and the proposed processor structure is used to solve the mutual exclusion problem, and to construct a more complex dynamic set of processors like FIFO queue.

AB - Consider a distributed system consisting of a set V of processors, and assume that every pair of processors can directly communicate with each other. A processor structure is proposed, for implementing a dynamic set U ⊆ V of processors in the distributed system. The dynamic set supports the following three operations: Insert inserts the caller (i.e., the processor executing this operation) in U, Delete removes the caller from U, and Find searches for a processor in U. To evaluate the efficiency of the implementation, an amortized analysis of the message complexity of operations is performed; the amortized number of messages per each operation is 8 + 121og2(|V| - 1), in the worst case. The dynamic set is applicable to many important problems, including the load balancing problem, and the proposed processor structure is used to solve the mutual exclusion problem, and to construct a more complex dynamic set of processors like FIFO queue.

UR - http://www.scopus.com/inward/record.url?scp=84955606308&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84955606308&partnerID=8YFLogxK

U2 - 10.1007/3-540-61769-8_15

DO - 10.1007/3-540-61769-8_15

M3 - Conference contribution

AN - SCOPUS:84955606308

SN - 9783540617693

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 220

EP - 233

BT - Distributed Algorithms - 10th International Workshop, WDAG 1996, Proceedings

A2 - Babaoglu, Ozalp

A2 - Marzullo, Keith

PB - Springer Verlag

T2 - 10th International Workshop on Distributed Algorithms, WDAG 1996

Y2 - 9 October 1996 through 11 October 1996

ER -

Maintaining a dynamic set of processors in a distributed system

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this