<s>
Mega-merger	B-Operating_System
is	O
a	O
distributed	O
algorithm	O
aimed	O
at	O
solving	O
the	O
election	O
problem	O
in	O
generic	O
connected	O
undirected	O
graph	O
.	O
</s>
<s>
Mega-Merger	B-Operating_System
was	O
developed	O
by	O
Robert	O
Gray	O
Gallager	O
at	O
MIT	O
in	O
1983	O
.	O
</s>
<s>
It	O
applies	O
a	O
distributed	O
divide	B-Algorithm
and	I-Algorithm
conquer	I-Algorithm
approach	I-Algorithm
mixed	O
with	O
a	O
rank-based	O
conquer	O
strategy	O
.	O
</s>
<s>
Mega-Merger	B-Operating_System
pushes	O
villages	O
to	O
bind	O
together	O
to	O
form	O
cities	O
according	O
to	O
each	O
other	O
's	O
rank	O
and	O
edges	O
.	O
</s>
<s>
Mega-Merger	B-Operating_System
builds	O
a	O
minimum	O
spanning	O
tree	O
over	O
connected	O
graphs	O
provided	O
:	O
</s>
<s>
Mega-Merger	B-Operating_System
holds	O
several	O
properties	O
:	O
</s>
<s>
Deadlock	O
prevention	O
:	O
Mega-Merger	B-Operating_System
does	O
n't	O
incur	O
in	O
any	O
deadlock	O
.	O
</s>
<s>
Mega-Merger	B-Operating_System
creates	O
a	O
minimum	O
spanning	O
tree	O
by	O
merging	O
sub-trees	O
through	O
the	O
minimum	O
cost	O
path	O
,	O
i.e.	O
</s>
<s>
By	O
construction	O
Mega-Merger	B-Operating_System
forwards	O
a	O
request	O
through	O
its	O
merge-link	O
,	O
and	O
that	O
sooner	O
or	O
later	O
that	O
edge	O
is	O
going	O
to	O
be	O
part	O
of	O
the	O
tree	O
by	O
deadlock	O
prevention	O
.	O
</s>
