Dynamic Control Structures for Cooperating Processes (Elections, Deadlock Detection, Decentralized, Agreement)

In this thesis, we consider the problem of how to select a control structure for a set of processes cooperatively providing a service. The control structure dictates how the processes cooperate in providing the service, and therefore determines the performance they achieve in carrying out the service. Because different control structures achieve different performance, careful selection of the control structure is important if high performance is to be maintained. Moreover, as processor load, traffic density, or other system parameters vary, the control structure should be reassessed, and if necessary a new one adopted. The procedure of selecting a control structure involves a series of elections in which different subsets of processes select leaders amongst themselves. The processes form groups according to the leaders they select, and thereby define the control structure. When system conditions change, the processes choose different leaders, and thus reconfigure the control structure. In this thesis, we focus on the election procedures, considering the efficiency and effectiveness of different election protocols. Our work here differs from previous research on election protocols in that we consider both single leader and multiple leader election protocols, and we use a nonuniform merit scheme for ranking processes as potential leaders.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Railey, Malcolm Richard

• Computer Science

Identifier

(UMI)AAI8623393

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/69555