Sciweavers

1414 search results - page 15 / 283
» Cover Time and Broadcast Time
Sort
View
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
14 years 3 months ago
Approximation Schemes for Broadcasting in Heterogenous Networks
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
IPPS
2000
IEEE
14 years 1 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
IWCMC
2006
ACM
14 years 3 months ago
MAC-assisted broadcast speedup in ad-hoc wireless networks
The primary performance objective of a broadcast scheme in an ad-hoc wireless network is to reduce the total number of retransmissions needed to reach all nodes. Another (less app...
Ashikur Rahman, Pawel Gburzynski
MASCOTS
1998
13 years 11 months ago
Efficient Broadcasting Protocols for Video on Demand
Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers...
Jehan-François Pâris, Steven W. Carte...
ICALP
2001
Springer
14 years 2 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan