By Topic

Robust coordination in distributed multi-server systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
I-Ling Yen ; Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA ; Bastani, F.B.

One way of substantially improving the reliability and performance of parallel and distributed applications is to replicate a server over multiple machines. Examples of multiple server systems include operating system support for parallel machines, distributed database systems, and multi-agent robotic and manufacturing systems. Coordination is required for parallel access to shared resources such as data structures, communication network, and physical space. Coordination is also required to ensure adequate speed-up when multiple servers are harnessed to work on different portions of the same task. The authors present two coordination algorithms for task distribution among identical servers, namely, a ticket-based algorithm and a toroidal graph algorithm. These two algorithms are highly robust and efficient. They allow uniform task distribution over working servers even in the presence of up to N - 1 server failures, where N is the number of servers. The ticket-based algorithm has a time complexity O(log N) and the toroidal graph algorithm requires only constant time

Published in:

Advances in Parallel and Distributed Systems, 1993., Proceedings of the IEEE Workshop on

Date of Conference:

6 Oct 1993