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 -