Optimal Deterministic Routing and Sorting on the Congested CliqueReport as inadecuate



 Optimal Deterministic Routing and Sorting on the Congested Clique


Optimal Deterministic Routing and Sorting on the Congested Clique - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Optimal Deterministic Routing and Sorting on the Congested Clique
Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange Olog n bits. We provide deterministic constant-time solutions for two problems in this model. The first is a routing problem where each node is source and destination of n messages of size Olog n. The second is a sorting problem where each node i is given n keys of size Olog n and needs to receive the ith batch of n keys according to the global order of the keys. The latter result also implies deterministic constant-round solutions for related problems such as selection or determining modes.



Author: Christoph Lenzen

Source: https://archive.org/



DOWNLOAD PDF




Related documents