Sciweavers

799 search results - page 57 / 160
» Bound Performance Models of Heterogeneous Parallel Processin...
Sort
View
127
Voted
PPOPP
2012
ACM
13 years 9 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
CCGRID
2010
IEEE
15 years 3 months ago
Streamflow Programming Model for Data Streaming in Scientific Workflows
Geo-sciences involve large-scale parallel models, high resolution real time data from highly asynchronous and heterogeneous sensor networks and instruments, and complex analysis a...
Chathura Herath, Beth Plale
128
Voted
ALGORITHMICA
2005
84views more  ALGORITHMICA 2005»
15 years 1 months ago
Optimal Read-Once Parallel Disk Scheduling
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
Mahesh Kallahalla, Peter J. Varman
111
Voted
HPDC
2009
IEEE
15 years 8 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
IISWC
2009
IEEE
15 years 8 months ago
Logicalization of communication traces from parallel execution
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
Qiang Xu, Jaspal Subhlok, Rong Zheng, Sara Voss