Sciweavers

2875 search results - page 80 / 575
» Distributed Reactive Machines
Sort
View
CCGRID
2002
IEEE
14 years 4 months ago
A Malleable-Job System for Timeshared Parallel Machines
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
Laxmikant V. Kalé, Sameer Kumar, Jayant DeS...
IPPS
2000
IEEE
14 years 3 months ago
Improving Throughput and Utilization in Parallel Machines through Concurrent Gang
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
Fabrício Alves Barbosa da Silva, Isaac D. S...
IPPS
1998
IEEE
14 years 3 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
ICPP
1993
IEEE
14 years 3 months ago
A Hybrid Shared Memory/Message Passing Parallel Machine
Current and emerging high-performance parallel computer architectures generally implement one of two types of communication mechanisms: shared memory (SM) or message passing (MP)....
Matthew Frank, Mary K. Vernon
CLUSTER
2008
IEEE
13 years 11 months ago
Benchmarking the effects of operating system interference on extreme-scale parallel machines
We investigate operating system noise, which we identify as one of the main reasons for a lack of synchronicity in parallel applications. Using a microbenchmark, we measure the no...
Peter H. Beckman, Kamil Iskra, Kazutomo Yoshii, Su...