Sciweavers

2438 search results - page 206 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
148
Voted
PODC
2003
ACM
15 years 11 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
PPOPP
2009
ACM
16 years 6 months ago
Effective performance measurement and analysis of multithreaded applications
Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore process...
Nathan R. Tallent, John M. Mellor-Crummey
MMM
2007
Springer
127views Multimedia» more  MMM 2007»
16 years 12 days ago
Optimizing the Throughput of Data-Driven Based Streaming in Heterogeneous Overlay Network
Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes rando...
Meng Zhang, Chunxiao Chen, Yongqiang Xiong, Qian Z...
INFOCOM
2009
IEEE
16 years 24 days ago
On the Market Power of Network Coding in P2P Content Distribution Systems
Abstract—Network coding is emerging as a promising alternative to traditional content distribution approaches in P2P networks. By allowing information mixture in peers, it simpli...
Xinyu Zhang, Baochun Li
195
Voted
AAAI
1994
15 years 7 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex