Sciweavers

22 search results - page 4 / 5
» Randomized Routing and PRAM Emulation on Parallel Machines
Sort
View
SPAA
1997
ACM
13 years 10 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
HPDC
2005
IEEE
13 years 11 months ago
Increasing application performance in virtual environments through run-time inference and adaptation
Virtual machine distributed computing greatly simplifies the use of widespread computing resources by lowering the abstraction, benefiting both resource providers and users. Tow...
Ananth I. Sundararaj, Ashish Gupta, Peter A. Dinda
CLUSTER
2006
IEEE
13 years 12 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
IPPS
1999
IEEE
13 years 10 months ago
Hardwired-Clusters Partial-Crossbar: A Hierarchical Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
ICPP
2002
IEEE
13 years 10 months ago
ART: Robustness of Meshes and Tori for Parallel and Distributed Computation
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
Chi-Hsiang Yeh, Behrooz Parhami