On-line windows scheduling of temporary items

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 259-270

  Chan, Wun Tat ^a,b   Wong, Prudence W H ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST CHANNELS; BROADCASTING SYSTEMS; COMPETITIVE RATIO; LOW BOUND; ON-LINE ALGORITHMS; ONE-TIME; POSITIVE INTEGERS; TIME UNITS; WINDOW SCHEDULING; LOWER BOUNDS;

ARTIFICIAL INTELLIGENCE; SCHEDULING;

ORBITAL TRANSFER;

EID: 35048819039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_24     Document Type: Article

References (15)

1. S. Acharya, M. Franklin, and S. Zdonik. Dissemination-based data delivery using broadcast disks. IEEE Personal Communications, 2(6):50-60, 1995.
2. M. H. Ammar and J. W. Wong. The design of teletext broadcast cycles. Performance Evaluation, 5(4):235-242, 1985.
3. A. Bar-Noy and R. E. Ladner. Windows scheduling problems for broadcast systems. SIAM Journal on Computing, 32(4):1091-1113, 2003. (A preliminary version appears in SODA 2002.).
4. A. Bar-Noy, R. E. Ladner, and T. Tamir. Windows scheduling as a restricted version of bin packing. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 224-233, 2004.
5. A. Bar-Noy, J. Naor, and B. Schieber. Pushing dependent data in clients-providers-servers systems. Wireless Network, 9(5):421-430, 2003.
6. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
7. M. Y. Chan and F. Y. L. Chin. General schedulers for the pinwheel problem based on double-integer reduction. IEEE Transactions on Computers, 41(6):755-768, 1992.
8. M. Y. Chan and F. Y. L. Chin. Schedulers for larger classes of pinwheel instances. Algorithmica, 9(5):425-625, 1993.
9. E. G. Coffman, M. R. Garey, and D. S. Johnson. Dynamic bin packing. SIAM Journal on Computing, 1983.
10. P. C. Fishburn and J. C. Lagarias. Pinwheel scheduling: Achievable densities. Algorithmica, 34(1):14-38, 2002.
11. V. Gondhalekar, R. Jain, and J. Werth. Scheduling on airdisks: Efficient access to personalized information services via periodic wireless data broadcast. In Proceedings of IEEE International Conference on Communications, volume 3, pages 1276-1280, 1997.
12. K. A. Hua and S. Sheu. Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems. In Proceedings of ACM SIGCOMM conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 89-100, 1997.
13. L.-S. Juhn and L.-M. Tseng. Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting, 43(3):268-271, 1997.
14. S. Viswanathan and T. Imielinski. Pyramid broadcasting for video-on-demand service. In Proceedings of Conference on Multimedia Computing and Networking, pages 66-77, 1995.
15. S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Journal of Multimedia Systems, 4(3):197-208, 1996.