Deterministic simulation of idealized parallel computers on more realistic ones

Journal Article · Thu Oct 01 04:00:00 EDT 1987 · SIAM J. Comput.; (United States)

DOI:https://doi.org/10.1137/0216053· OSTI ID:5793238

Alt, H; Hagerup, T; Mehlhorn, K; Preparata, F P

The authors describe a nonuniform deterministic simulation of PRAMs on module parallel computers (MPCs) and on processor networks of bounded degree. The simulating machines have the same number n of processors as the simulated PRAM, and if the size of the PRAM's shared memory is polynomial in n, each PRAM step is simulated by O(log n) MPC steps or by O((log n)/sup 2/) steps of the bounded-degree network. This improves upon a previous result. The authors also prove an ..cap omega..((log n/sup 2//log log n) lower bound on the number of steps needed to simulate one PRAM step on a bounded-degree network under the assumption that the communication in the network is point to point. As an important part of the simulation of PRAMs on MPCs, a new technique for dynamically averaging out a given work load among a set of processors operating in parallel is used.

• Research Organization: Fachbereich Mathematik, Freie Universitat Berlin, Arnimallee 2-6, D-1000 Berlin 33
• OSTI ID: 5793238
• Journal Information: SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 16:5; ISSN SMJCA
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210 -- Supercomputers-- (1987-1989)
990230* -- Mathematics & Mathematical Models-- (1987-1989)
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTERIZED SIMULATION
COMPUTERS
DIGITAL COMPUTERS
FUNCTIONS
MATHEMATICS
MEMORY DEVICES
MODULAR STRUCTURES
PARALLEL PROCESSING
POLYNOMIALS
PROGRAMMING
SIMULATION
SUPERCOMPUTERS