Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Resource Augmentation Analysis on Broadcast Scheduling for Requests with Deadlines

마감시간을 가진 요청들에 대한 브로드캐스트 스케줄링의 자원추가 분석

  • Kim, Jae-hoon (Department of Computer Engineering, Busan University of Foreign Studies)
  • Received : 2015.08.28
  • Accepted : 2015.09.30
  • Published : 2015.12.31
Download PDF
⟨ Previous Next ⟩

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.

본 논문에서는 브로드캐스트를 수행할 수 있는 m개의 서버가 존재하는 경우에 마감시간이 있는 요청들을 만족시키는 스케줄링 문제를 다룰 것이다. 서버가 어떤 페이지를 브로드캐스트하면 이 페이지를 요구한 모든 요청들은 만족된다. 스케줄링 알고리즘은 매 시간에 서버에서 브로드캐스트 할 페이지를 결정한다. 알고리즘의 목표는 마감시간 안에 만족된 요청들의 가중치 합을 최대로 하는 것이다. 온라인 알고리즘의 성능은 입력을 미리 다 알고 결정을 내리는 최적 오프라인 알고리즘의 성능과 비교된다. 일반적으로 최적 오프라인 알고리즘의 성능이 월등히 뛰어 나기 때문에 온라인 알고리즘이 보다 많은 자원을 이용할 수 있는 자원추가 분석 방법을 사용한다. 본 논문에서는 온라인 알고리즘이 보다 많은 서버를 사용하는 경우를 다룰 것이다.

Keywords

References

  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. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. R. Lipton, A. Tomkins, "Online interval scheduling," in Proceeding of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 302-311, 1994.
  9. 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.
  10. 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.
  11. B. Kalyanasundaram, K. Pruhs, "Speed is as powerful as clairvoyance," Journal of ACM, vol. 47, pp. 617-643, Sep. 2000. https://doi.org/10.1145/347476.347479
  12. 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.
  13. 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.