The queue-read queue-write pram model: Accounting for contention in parallel algorithms

SIAM Journal on Computing

Volumn 28, Issue 2, 1998, Pages 733-769

  Gibbons, Phillip B ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Memory contention; Models of parallel computation; Parallel algorithms; PRAM; Work time framework

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; RANDOM ACCESS STORAGE; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

QUEUE-READ QUEUE-WRITE PARALLEL RANDOM ACCESS MACHINES (RQW PRAM);

PARALLEL PROCESSING SYSTEMS;

EID: 0032107941     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979427491     Document Type: Article

References (2)

1. F. ABOLHASSAN, J. KELLER, AND W. J. PAUL, On the cost-effectiveness of PRAMs, in Proc. 3rd IEEE Symp. on Parallel and Distributed Processing, Dallas, TX, 1991, pp. 2-9.
2. R. ALVERSON, D. CALLAHAN, D. CUMMINGS, B. KOBLENZ, A. PORTERFIELD, AND B. SMITH, The Tera computer system, in Proc. 1990 International Conf. on Supercomputing, Amsterdam, The Netherlands, 1990, pp. 1-G.