Sciweavers

6939 search results - page 180 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
IPPS
1999
IEEE
14 years 19 days ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
EUROPAR
2000
Springer
13 years 12 months ago
BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations
We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, ge...
Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Gol...
ICPP
2007
IEEE
14 years 2 months ago
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems
In this paper, we present a heuristic algorithm that improves the performance of static task scheduling. Our algorithm is based on the list-scheduling mechanism. For the listing p...
Chih-Hsueh Yang, PeiZong Lee, Yeh-Ching Chung
SIGGRAPH
1993
ACM
14 years 13 days ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan