Optimal Deterministic Routing and Sorting on the Congested CliqueReportar como inadecuado



 Optimal Deterministic Routing and Sorting on the Congested Clique


Optimal Deterministic Routing and Sorting on the Congested Clique - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Descargar gratis o leer online en formato PDF el libro: 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.



Autor: Christoph Lenzen

Fuente: https://archive.org/







Documentos relacionados