58:
process will compare the incoming UID to its own. If the UID is greater than its own UID then it will continue the message on. Otherwise if the UID is less than its own UID, it will not pass the information on. At the end of a phase, a process can determine if it will send out messages in the next round by if it received both of its incoming messages. Phases continue until a process receives both of its out messages, from both of its neighbors. At this time the process knows it is the largest UID in the ring and declares itself the leader.
175:
57:
The algorithm requires the use of unique IDs (UID) for each process. The algorithm works in phases and sends its UID out in both directions. The message goes out a distance of 2 hops and then the message heads back to the originating process. While the messages are heading "out" each receiving
244:
220:
157:
137:
117:
239:
213:
73:
71:; Sinclair, J. B. (November 1980), "Decentralized extrema-finding in circular configurations of processors",
206:
35:
51:
92:
153:
147:
133:
127:
113:
107:
190:
82:
39:
186:
68:
47:
233:
96:
43:
103:
182:
17:
87:
174:
146:
Garg, Vijay K. (2002), "9.4 Hirschberg–Sinclair
Algorithm",
194:
112:, Morgan Kaufmann Publishers, Inc., pp. 482–483,
132:, Cambridge University Press, pp. 232–233,
214:
8:
152:, John Wiley & Sons, pp. 111–112,
221:
207:
86:
129:Introduction to Distributed Algorithms
7:
245:Algorithms and data structures stubs
171:
169:
106:(1996), "15.1.2 The HS Algorithm",
46:. It is named after its inventors,
193:. You can help Knowledge (XXG) by
25:
149:Elements of Distributed Computing
173:
1:
32:Hirschberg–Sinclair algorithm
261:
168:
74:Communications of the ACM
42:problem in a synchronous
27:Leader election algorithm
240:Distributed algorithms
189:-related article is a
109:Distributed Algorithms
88:10.1145/359024.359029
36:distributed algorithm
126:Tel, Gerard (2000),
202:
201:
69:Hirschberg, D. S.
16:(Redirected from
252:
223:
216:
209:
177:
170:
162:
142:
122:
99:
90:
21:
260:
259:
255:
254:
253:
251:
250:
249:
230:
229:
228:
227:
187:data structures
166:
160:
145:
140:
125:
120:
104:Lynch, Nancy A.
102:
81:(11): 627–628,
67:
64:
40:leader election
28:
23:
22:
15:
12:
11:
5:
258:
256:
248:
247:
242:
232:
231:
226:
225:
218:
211:
203:
200:
199:
178:
164:
163:
158:
143:
138:
123:
118:
100:
63:
60:
52:J. B. Sinclair
48:Dan Hirschberg
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
257:
246:
243:
241:
238:
237:
235:
224:
219:
217:
212:
210:
205:
204:
198:
196:
192:
188:
184:
179:
176:
172:
167:
161:
159:9780471036005
155:
151:
150:
144:
141:
139:9780521794831
135:
131:
130:
124:
121:
119:9780080504704
115:
111:
110:
105:
101:
98:
94:
89:
84:
80:
76:
75:
70:
66:
65:
61:
59:
55:
53:
49:
45:
41:
38:designed for
37:
33:
19:
195:expanding it
180:
165:
148:
128:
108:
78:
72:
56:
44:ring network
31:
29:
18:HS algorithm
234:Categories
183:algorithms
62:References
97:15299430
156:
136:
116:
95:
181:This
93:S2CID
34:is a
191:stub
154:ISBN
134:ISBN
114:ISBN
50:and
30:The
185:or
83:doi
236::
91:,
79:23
77:,
54:.
222:e
215:t
208:v
197:.
85::
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
