Sciweavers

3107 search results - page 510 / 622
» Parallel Communication
Sort
View
122
Voted
DEBS
2009
ACM
15 years 4 months ago
Event-based systems: opportunities and challenges at exascale
Streaming data models have been shown to be useful in many applications requiring high-performance data exchange. Application-level overlay networks are a natural way to realize t...
Greg Eisenhauer, Matthew Wolf, Hasan Abbasi, Karst...
122
Voted
JNW
2008
173views more  JNW 2008»
15 years 24 days ago
Dominating Set Theory based Semantic Overlay Networks for Efficient and Resilient Content Distribution
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
J. Amutharaj, S. Radhakrishnan
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 15 days ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
95
Voted
IPPS
2010
IEEE
14 years 10 months ago
Out-of-core distribution sort in the FG programming environment
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...
Priya Natarajan, Thomas H. Cormen, Elena Riccio St...
120
Voted
IPPS
2010
IEEE
14 years 10 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke