Sciweavers

405 search results - page 51 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
HPDC
1997
IEEE
15 years 6 months ago
A Directory Service for Configuring High-Performance Distributed Computations
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...
ISPASS
2003
IEEE
15 years 8 months ago
Performance study of a cluster runtime system for dynamic interactive stream-oriented applications
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
Arnab Paul, Nissim Harel, Sameer Adhikari, Bikash ...
126
Voted
SOSP
2003
ACM
16 years 3 days ago
Bullet: high bandwidth data dissemination using an overlay mesh
In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
PARELEC
2006
IEEE
15 years 9 months ago
Hierarchical Partitioning for Piecewise Linear Algorithms
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...
Hritam Dutta, Frank Hannig, Jürgen Teich
153
Voted
ICPADS
2010
IEEE
15 years 1 months ago
Enhancing MapReduce via Asynchronous Data Processing
The MapReduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map function that processes input key/value pairs to generate...
Marwa Elteir, Heshan Lin, Wu-chun Feng