Browse > Article
http://dx.doi.org/10.6109/jkiice.2015.19.12.2981

Resource Augmentation Analysis on Broadcast Scheduling for Requests with Deadlines  

Kim, Jae-hoon (Department of Computer Engineering, Busan University of Foreign Studies)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.19, no.12, 2015 , pp. 2981-2986 More about this Journal
Abstract
In this paper, there are m servers to carry out broadcasts and the scheduling problem to serve the requests with deadlines is studied. If a server broadcasts a page, then all the requests which require the page are satisfied. A scheduling algorithm shall determine which pages are broadcasted on servers at a time. Its goal is to maximize the sum of weights of requests satisfied within their deadlines. The performance of an on-line algorithm is compared with that of the optimal off-line algorithm which can see all the inputs in advance. In general, the off-line algorithms outperform the on-line algorithms. So we will use the resource augmentation analysis in which the on-line algorithms can utilize more resources. We consider the case that the on-line algorithms can use more servers in this paper.
Keywords
scheduling; on-line algorithm; off-line algorithm; broadcast; resource augmentation analysis;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Kalyanasundaram, K. Pruhs, M. Velauthapillai, "Scheduling broadcasts in wireless networks," in Proceeding of the 8th European Symposium on Algorithms, pp. 290-301, 2000.
2 T. Erlebach, A. Hall, "NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow," in Proceeding of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 194-202, 2002.
3 M. Brehob, E. Torng, P. Uthaisombut, "Applying extraresource analysis to load balancing," in Proceeding of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 560-561, 2000.
4 C. A. Phillips, C. Stein, E. Torng, J. Wein, "Optimal timecritical scheduling via resource augmentation," in Proceeding of the 29th ACM Symposium on Thoery of Computing, pp. 140-149, 1997.
5 J. Chang, T. Erlebach, R. Gailis, S. Khuller, "Broadcast scheduling: Algorithms and Complexity," in Proceeding of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 473-482, 2008.
6 J. Edmonds, K. Pruhs, "Broadcast scheduling: when fairness is fine," in Proceeding of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 421-430, 2002.
7 R. Gandhi, S. Khuller, Y. A. Kim, Y. C. Wan, "Algorithms for minimizing response time in broadcast scheduling," in Proceeding of the 9th International Symposium on Integer Programming and Combinatorial Optimization, pp. 425- 438, 2002.
8 Y. Bartal, S. Muthukrishnan, "Minimizing maximum response time in scheduling broadcasts," in Proceeding of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 558-559, 2000.
9 S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, F. Wand, "On the competitiveness of on-line task real-time task scheduling," Journal of Real-Time Systems, vol. 4, pp. 124-144, Apr. 1992.
10 R. Lipton, A. Tomkins, "Online interval scheduling," in Proceeding of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 302-311, 1994.
11 M. H. Goldwasser, "Patience is a virtue; The effect of slack on competitiveness for admission control," in Proceeding of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 396-405, 1999.
12 S. Jiang, N. Vaidya, "Scheduling data broadcasts to impatient users," in Proceeding of ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 52-59, 1999.
13 B. Kalyanasundaram, K. Pruhs, "Speed is as powerful as clairvoyance," Journal of ACM, vol. 47, pp. 617-643, Sep. 2000.   DOI