메뉴 건너뛰기




Volumn 5757 LNCS, Issue , 2009, Pages 444-455

Minimizing maximum response time and delay factor in broadcast scheduling

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST SCHEDULING; COMPETITIVE MODELS; CONSTANT SPEED; DELAY FACTORS; FIRST-IN-FIRST-OUT; GREEDY ALGORITHMS; MAXIMUM DELAY; MAXIMUM RESPONSE TIME; ON-LINE ALGORITHMS; PAGE SIZES; RESPONSE TIME; UPPER BOUND; WAITING-TIME;

EID: 70350413292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_40     Document Type: Conference Paper
Times cited : (14)

References (27)
  • 1
    • 0029509866 scopus 로고
    • Dissemination-based data delivery using broadcast disks
    • Acharya, S., Franklin, M., Zdonik, S.: Dissemination-based data delivery using broadcast disks. IEEE Pers. Commun. 2(6), 50-60 (1995)
    • (1995) IEEE Pers. Commun , vol.2 , Issue.6 , pp. 50-60
    • Acharya, S.1    Franklin, M.2    Zdonik, S.3
  • 2
    • 0033352389 scopus 로고    scopus 로고
    • M.J.: Rxw: A scheduling approach for large-scale on-demand data broadcast
    • Aksoy, D., Franklin, M.J.: rxw: A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Trans. Netw. 7(6), 846-860 (1999)
    • (1999) IEEE/ACM Trans. Netw , vol.7 , Issue.6 , pp. 846-860
    • Aksoy, D.1    Franklin2
  • 7
    • 40249116989 scopus 로고    scopus 로고
    • Scheduling algorithms for procrastinators
    • Bender, M.A., Clifford, R., Tsichlas, K.: Scheduling algorithms for procrastinators. J. Scheduling 11(2), 95-104 (2008)
    • (2008) J. Scheduling , vol.11 , Issue.2 , pp. 95-104
    • Bender, M.A.1    Clifford, R.2    Tsichlas, K.3
  • 9
    • 35048840841 scopus 로고    scopus 로고
    • New results on on-demand broadcasting with deadline via job scheduling with cancellation
    • Chwa, K.-Y, Munro, J.I.J, eds, COCOON 2004, Springer,Heidelberg
    • Chan, W.-T., Lam, T.W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 210-218. Springer,Heidelberg (2004)
    • (2004) LNCS , vol.3106 , pp. 210-218
    • Chan, W.-T.1    Lam, T.W.2    Ting, H.-F.3    Wong, P.W.H.4
  • 12
    • 70350383718 scopus 로고    scopus 로고
    • Chekuri, C., Im, S., Moseley, B.: Minimizing maximum response time and delay factor in broadcast scheduling. CoRR, abs/0906.2048 (2009)
    • Chekuri, C., Im, S., Moseley, B.: Minimizing maximum response time and delay factor in broadcast scheduling. CoRR, abs/0906.2048 (2009)
  • 14
    • 30344442124 scopus 로고    scopus 로고
    • A note on scheduling equal-length jobs to maximize throughput
    • Chrobak, M., Dürr, C., Jawor, W., Kowalik, L., Kurowski, M.: A note on scheduling equal-length jobs to maximize throughput. J. Scheduling 9(1), 71-73 (2006)
    • (2006) J. Scheduling , vol.9 , Issue.1 , pp. 71-73
    • Chrobak, M.1    Dürr, C.2    Jawor, W.3    Kowalik, L.4    Kurowski, M.5
  • 15
    • 0942290217 scopus 로고    scopus 로고
    • Multicast pull scheduling: When fairness is fine
    • Edmonds, J., Pruhs, K.: Multicast pull scheduling: When fairness is fine. Algorithmica 36(3), 315-330 (2003)
    • (2003) Algorithmica , vol.36 , Issue.3 , pp. 315-330
    • Edmonds, J.1    Pruhs, K.2
  • 18
    • 21044440288 scopus 로고    scopus 로고
    • Algorithms for minimizing response time in broadcast scheduling
    • Gandhi, R., Khuller, S., Kim, Y.-A., Wan, Y.-C.J.: Algorithms for minimizing response time in broadcast scheduling. Algorithmica 38(4), 597-608 (2004)
    • (2004) Algorithmica , vol.38 , Issue.4 , pp. 597-608
    • Gandhi, R.1    Khuller, S.2    Kim, Y.-A.3    Wan, Y.-C.J.4
  • 19
    • 33746816635 scopus 로고    scopus 로고
    • Dependent rounding and its applications to approximation algorithms
    • Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3), 324-360 (2006)
    • (2006) J. ACM , vol.53 , Issue.3 , pp. 324-360
    • Gandhi, R.1    Khuller, S.2    Parthasarathy, S.3    Srinivasan, A.4
  • 20
    • 0000696568 scopus 로고    scopus 로고
    • Speed is as powerful as clairvoyance
    • Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617-643 (2000)
    • (2000) J. ACM , vol.47 , Issue.4 , pp. 617-643
    • Kalyanasundaram, B.1    Pruhs, K.2
  • 22
    • 4544231084 scopus 로고    scopus 로고
    • Scheduling broadcasts with deadlines
    • Kim, J.-H., Chwa, K.-Y.: Scheduling broadcasts with deadlines. Theor. Comput. Sci. 325(3), 479-488 (2004)
    • (2004) Theor. Comput. Sci , vol.325 , Issue.3 , pp. 479-488
    • Kim, J.-H.1    Chwa, K.-Y.2
  • 23
    • 43049087550 scopus 로고    scopus 로고
    • Competitive online scheduling for server systems. SIGMETRICS Perform
    • Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev. 34(4), 52-58 (2007)
    • (2007) Eval. Rev , vol.34 , Issue.4 , pp. 52-58
    • Pruhs, K.1
  • 25
    • 22344453478 scopus 로고    scopus 로고
    • A comparison of multicast pull models
    • Pruhs, K., Uthaisombut, P.: A comparison of multicast pull models. Algorithmica 42(3-4), 289-307 (2005)
    • (2005) Algorithmica , vol.42 , Issue.3-4 , pp. 289-307
    • Pruhs, K.1    Uthaisombut, P.2
  • 26
    • 0024167643 scopus 로고
    • Broadcast delivery
    • Wong, J.: Broadcast delivery. Proc. IEEE 76(12), 1566-1577 (1988)
    • (1988) Proc. IEEE , vol.76 , Issue.12 , pp. 1566-1577
    • Wong, J.1
  • 27
    • 33749579482 scopus 로고    scopus 로고
    • Improved on-line broadcast scheduling with deadlines
    • Chen, D.Z, Lee, D.T, eds, COCOON 2006, Springer, Heidelberg
    • Zheng, F., Fung, S.P.Y., Chan, W.-T., Chin, F.Y.L., Poon, C.K., Wong, P.W.H.: Improved on-line broadcast scheduling with deadlines. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 320-329. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4112 , pp. 320-329
    • Zheng, F.1    Fung, S.P.Y.2    Chan, W.-T.3    Chin, F.Y.L.4    Poon, C.K.5    Wong, P.W.H.6


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.