Sciweavers

1389 search results - page 222 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
155
Voted
PODC
2009
ACM
16 years 3 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
117
Voted
ICPP
2006
IEEE
15 years 8 months ago
Data Sharing Pattern Aware Scheduling on Grids
These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, da...
Young Choon Lee, Albert Y. Zomaya
IEEEPACT
2006
IEEE
15 years 8 months ago
Testing implementations of transactional memory
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
Chaiyasit Manovit, Sudheendra Hangal, Hassan Chafi...
SPAA
2004
ACM
15 years 8 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
154
Voted
SPAA
1999
ACM
15 years 6 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...