Sciweavers

1205 search results - page 34 / 241
» On P Systems with Bounded Parallelism
Sort
View
SPAA
1995
ACM
13 years 11 months ago
Parallel Sorting with Limited Bandwidth
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...
Micah Adler, John W. Byers, Richard M. Karp
IPPS
2007
IEEE
14 years 1 months ago
A Flexible Resource Management Architecture for the Blue Gene/P Supercomputer
Blue Gene R /P is a massively parallel supercomputer intended as the successor to Blue Gene/L. It leverages much of the existing architecture of its predecessor to provide scalabi...
Sam Miller, Mark Megerian, Paul Allen, Tom Budnik
IPPS
2009
IEEE
14 years 2 months ago
Crash fault detection in celerating environments
Failure detectors are a service that provides (approximate) information about process crashes in a distributed system. The well-known “eventually perfect” failure detector, 3P...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
POPL
1996
ACM
13 years 11 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
PPOPP
2006
ACM
14 years 1 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski