2022/08/22 by Molla, Anisur Rahaman, Kumar, Manish, Sivasubramaniam, Sumathi · 1 citation
#Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
paper · doi:10.48550/arxiv.2208.10135
In this paper, we study the graph realization problem in the Congested Clique model of distributed computing under crash faults. We consider \em degree-sequence realization, in which each node v is associated with a degree value d(v), and the resulting degree sequence is realizable if it is possible to construct an overlay network with the given degrees. Our main result is a O(f)-round deterministic algorithm for the degree-sequence realization problem in a n-node Congested Clique, of which f nodes could be faulty (f