3 search results - page 1 / 1 » BSP vs LogP |
SPAA
1996
ACM
13 years 9 months ago
1996
ACM
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
SPAA
1995
ACM
13 years 8 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...