Sciweavers

995 search results - page 1 / 199
» Minimizing Congestion in General Networks
Sort
View
FOCS
2002
IEEE
13 years 10 months ago
Minimizing Congestion in General Networks
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
Harald Räcke
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
13 years 11 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
PODC
2006
ACM
13 years 11 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
FOCS
2004
IEEE
13 years 9 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
ISPD
1999
ACM
108views Hardware» more  ISPD 1999»
13 years 9 months ago
On the behavior of congestion minimization during placement
Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is least understood, however, it models routability accurately. In thi...
Maogang Wang, Majid Sarrafzadeh