H. Kaplan, R. Tarjan, K. Tsioutsiouliklis, "Faster kinetic heaps and their use in broadcast scheduling" SODA, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Minimizing Response Time in Broadcast.. - Gandhi, Khuller, Kim, Wan (2002) (3 citations) (Correct)
....number of outstanding requests for page with the longest waiting time to compute the demand for a page. The page with the maximum demand is then broadcast. Another reasonable heuristic is to take the sum of waiting times of all outstanding requests for a page to compute its demand. Tarjan et al. [22] have recently shown how to implement this algorithm eciently. Not surprisingly, the worst case competitive ratio of these algorithms is unbounded, as shown in [18] While the practical problem is clearly online, it is interesting to study the complexity of the o ine problem as well. In trying to ....
H. Kaplan, R. E. Tarjan, and K. Tsioutsiouliklis. Faster kinetic heaps and their use in broadcast scheduling. In Proc. of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 836-844, 2001.
Middleware Support for Multicast-based Data.. - Chrysanthis.. (2001) (Correct)
....a counter for each data item that is the sum over all unsatisfied requests for that page, of the elapsed time since that request. The algorithm LWF then always broadcasts the page with highest counter. LWF can be implemented in logarithmic time per broadcast using the data structure given in [34]. The generalization that we propose is to divide the counter by the file size. A tight mathematical analysis of Broadcast Equipoise and LWF seems quite difficult. We are currently experimentally evaluating these algorithms. At the same time, we have looked into flexible scheduling schemes that ....
H. Kaplan, R. Tarjan, and K. Tsiotsiouliklis. Faster kinetic heaps and their use in broadcast scheduling. In Proc. of the ACM/SIAM Symposium on Discrete Algorithms, 2001.
Middleware Support for Multicast-based Data.. - Chrysanthis.. (2003) (Correct)
....a counter for each data item that is the sum over all unsatisfied requests for that 6 page, of the elapsed time since that request. The algorithm LWF then always broadcasts the page with highest counter. LWF can be implemented in logarithmic time per broadcast using the data structure given in [32]. The generalization that we propose is to divide the counter by the file size. A tight mathematical analysis of Broadcast Equipoise and LWF seems quite difficult. We are currently experimentally evaluating these algorithms. At the same time, we have looked into flexible scheduling schemes that ....
Haim Kaplan, Robert Tarjan, and Kostas Tsiotsiouliklis. Faster kinetic heaps and their use in broadcast scheduling. In Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, 2001.
A Maiden Analysis of Longest Wait First - Jeff Edmonds Kirk (2004) (Correct)
No context found.
H. Kaplan, R. Tarjan, K. Tsioutsiouliklis, "Faster kinetic heaps and their use in broadcast scheduling" SODA, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC