Sciweavers

PPOPP
2006
ACM
14 years 5 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
PPOPP
2006
ACM
14 years 5 months ago
Programming for parallelism and locality with hierarchically tiled arrays
Tiling has proven to be an effective mechanism to develop high performance implementations of algorithms. Tiling can be used to organize computations so that communication costs i...
Ganesh Bikshandi, Jia Guo, Daniel Hoeflinger, Gheo...
PPOPP
2006
ACM
14 years 5 months ago
Optimizing irregular shared-memory applications for distributed-memory systems
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
Ayon Basumallik, Rudolf Eigenmann
PPOPP
2006
ACM
14 years 5 months ago
Performance characterization of molecular dynamics techniques for biomolecular simulations
Large-scale simulations and computational modeling using molecular dynamics (MD) continues to make significant impacts in the field of biology. It is well known that simulations...
Sadaf R. Alam, Jeffrey S. Vetter, Pratul K. Agarwa...
PPOPP
2006
ACM
14 years 5 months ago
Adaptive scheduling with parallelism feedback
Kunal Agrawal, Yuxiong He, Wen-Jing Hsu, Charles E...
PODC
2006
ACM
14 years 5 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
PODC
2006
ACM
14 years 5 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
PODC
2006
ACM
14 years 5 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
PODC
2006
ACM
14 years 5 months ago
Reliable broadcast in radio networks: the bounded collision case
Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Ni...