Sciweavers

1519 search results - page 285 / 304
» Network Partitioning of Data Parallel Computations
Sort
View
WWW
2011
ACM
13 years 2 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
CCGRID
2006
IEEE
14 years 1 months ago
Adapting Distributed Shared Memory Applications in Diverse Environments
A problem with running distributed shared memory applications in heterogeneous environments is that making optimal use of available resources often requires significant changes t...
Daniel Potts, Ihor Kuz
ICDCS
2007
IEEE
14 years 2 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
DEBS
2007
ACM
13 years 11 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
IPPS
1999
IEEE
14 years 1 days ago
Qos Control and Adaptation in Distributed Multimedia Systems
Presently, many distributed multimedia systems adapt to their changing environments and Quality of Service (QoS) requirements by exchanging control and feedback data between server...
Farid Naït-Abdesselam, Nazim Agoulmine