Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > RANDOMIZED PARALLEL ALGORITHMS:
Reports tagged with Randomized Parallel Algorithms:
TR00-053 | 5th May 2000
Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, Jose' D. P. Rolim

Parallel Read Operations Without Memory Contention

We address the problem of organizing a set $T$ of shared data into
the memory modules of a Distributed Memory Machine (DMM) in order
to minimize memory access conflicts (i.e. memory contention)
during read operations.
Previous solutions for this problem can be found as fundamental ... more >>>




ISSN 1433-8092 | Imprint