Please use this identifier to cite or link to this item: doi:10.22028/D291-26107
Title: Granularity of parallel memories
Author(s): Mehlhorn, Kurt
Vishkin, Uzi
Language: English
Year of Publication: 1983
OPUS Source: Saarbrücken, 1983
Free key words: granularity problem
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: Consider algorithms which are designed for shared memory models of parallel computation in which processors are allowed to have fairly unrestricted access patterns to the shared memory. General fast simulations of such algorithms by parallel machines in which the shared memory is organized in modules where only one cell of each module can be accessed at a time are proposed. The paper provides a comprehensive study of the problem. The solution involves three stages: (a) Before a simulation, distribute randomly the memory addresses among the memory modules. (b) Keep several copies of each address and assign memory requests of processors to the "right'; copies at any time. (c) Satisfy these assigned memory requests according to specifications of the parallel machine.
Link to this record: urn:nbn:de:bsz:291-scidok-41122
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1983/10
Date of registration: 23-Aug-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1983_10.pdf8,03 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.