Sciweavers

3181 search results - page 328 / 637
» Adaptive Communication Algorithms for Distributed Heterogene...
Sort
View
KIVS
2009
Springer
15 years 11 months ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
175
Voted
HPDC
2007
IEEE
15 years 11 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
IPPS
2008
IEEE
15 years 11 months ago
Random choices for churn resilient load balancing in peer-to-peer networks
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...
Song Fu, Cheng-Zhong Xu, Haiying Shen
LCPC
1997
Springer
15 years 8 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
LCPC
2004
Springer
15 years 10 months ago
Power-Aware Scheduling for Parallel Security Processors with Analytical Models
Techniques to reduce power dissipation for embedded systems have recently come into sharp focus in the technology development. Among these techniques, dynamic voltage scaling (DVS)...
Yung-Chia Lin, Yi-Ping You, Chung-Wen Huang, Jenq ...