Windows Scheduling as a Restricted Version of Bin Packing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 217-226

  Bar Noy, Amotz ^a   Ladner, Richard E ^b   Tamir, Tami ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

UNIT FRACTIONS BIN PACKING (UFBP) PROBLEMS; WINDOWS SCHEDULING;

ALGORITHMS; BANDWIDTH; BROADCASTING; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PACKING; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

OPERATIONS RESEARCH;

EID: 1842488249     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. S. Acharya, M. J. Franklin, and S. Zdonik. Dissemination-based data delivery using broadcast disks. IEEE Personal Comm., 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, R. Bhatia, J. Naor, and B. Schieber. Minimizing service and operation costs of periodic scheduling. Mathematics of Operations Research (MOR), 27(3):518-544, 2002.
4. A. Bar-Noy and R. E. Ladner. Windows scheduling problems for broadcast systems. In Proc. of the 13-th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 433-442, 2002.
5. A. Bar-Noy, R. E. Ladner, and T. Tamir. Scheduling techniques for media-on-demand. In Proc. of the 14-th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 791-800, 2002.
6. A. Bar-Noy, J. Naor, and B. Schieber. Pushing dependent data in clients-providers-servers systems. Wireless Networks journal, 9(5):175-186, 2003.
7. E. G. Coffman, C .A. Courcoubetis, M .R. Garey, D .S. Johnson, P .W. Shor, R .R. Weber, and M. Yannakakis. Bin packing with discrete item sizes, part I: perfect packing theorems and the average case behavior of optimal packings. SIAM J. Discrete Math., 13:384-402, 2000.
8. E. G. Coffman, M .R. Garey, and D .S. Johnson. Bin packing with divisible item sizes. J. of Complexity, 3:406-428, 1987.
9. E. G. Coffman, M .R. Garey, and D .S. Johnson. Approximation Algorithms for Bin Packing: A Survey. Approximation Algorithms for NP-Hard Problems, D. Hochbaum (editor), PWS Publishing, Boston (1996), 46-93.
10. L. Engebretsen and M. Sudan. Harmonic broadcasting is optimal. In Proc. of the 13-th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 431-432, 2002.
11. M .R. Garey and D .S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, 1979.
12. V. Gondhalekar, R. Jain, and J. Werth. Scheduling on airdisks: e cient access to personalized information services via periodic wireless data broadcast. IEEE International Conference on Communications (ICC), 3:1276-1280, 1997.
13. K. A. Hua and S. Sheu. An E cient Periodic Broadcast Technique for Digital Video Libraries. Multimedia Tools and Applications, 10(2/3): 157-177, 2000.
14. D .S. Johnson, A. Demers, J .D. Ullman, M .R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithm. SIAM J. of Comput., 3:256-278, 1974.
15. L. Juhn and L. Tseng. Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting, 43(3):268-271, 1997.
16. V. Kann. Maximum bounded 3-dimensional matching is max SNP-complete. Information Processing Letters, 37:27-35, 1991.
17. C. L. Liu and W. Laylend. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
18. S. Seiden. On the online bin-packing problem. Journal of the ACM, 49(5):640-671, 2002.
19. R. Tijdeman. The chairman assignment problem. Discrete Mathematics, 32:323-330, 1980.
20. A. van Vliet. On the asymptotic worst case behavior of harmonic t. J. of Algs., 20:113-136, 1996.
21. W .F. Vega and G .S. Leuker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1:349-355, 1981.
22. S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, 4(3):197-208, 1996.