Windows scheduling as a restricted version of bin packing

ACM Transactions on Algorithms

Volumn 3, Issue 3, 2007, Pages

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

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c Interdisciplinary Center

^d University of Washington

^e INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Approximation algorithms; Bin packing; Online algorithms; Periodic scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; BANDWIDTH; CHANNEL STATE INFORMATION; ONLINE SYSTEMS; PROBLEM SOLVING; SCHEDULING;

BIN-PACKING; ONLINE ALGORITHMS; PERIODIC SCHEDULING;

INTEGER PROGRAMMING;

EID: 34548251827     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1273340.1273344     Document Type: Article

References (27)

1. ACHARYA, S., FRANKLIN, M. J., AND ZDONIK, S. 1995. Dissemination-Based data delivery using broadcast disks. IEEE Personal Commun. 2, 6, 50-60.
2. AMMAR, M. H., AND WONG, J. W. 1985. The design of teletext broadcast cycles. Perform. Eval. 5, 4, 235-242.
3. BAR-NOY, A., AND LADNER, R. E. 2003. Windows scheduling problems for broadcast systems. SIAM J. Comput. 32, 4, 1091-1113.
4. BAR-NOY, A., NAOR, J., AND SCHIEBER, B. 2003. Pushing dependent data in clients-providers-servers systems. Wireless Netw. J. 9, 5, 175-186.
5. BAR-NOY, A., BHATIA, R., NAOR, J., AND SCHIEBER, B. 2002a. Minimizing service and operation, costs of periodic scheduling. Math. Oper. Res. 27, 3, 518-544.
6. BAR-NOY, A., LADNER, R. E., AND TAMIR, T. 2002b. Scheduling techniques for media-on-demand. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 791-800.
7. HAN, M. Y., AND CHIN, F. 1992. General schedulers for the pinwheel problem based on. double-integer reduction. IEEE Trans. Comput. 41, 6, 755-768.
8. HAN, W. T., AND WONG, P. W. H. 2004. On-Line windows scheduling of temporary items. In Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC). 259-270.
9. OFFMAN, E. G., COURCOUBETIS, C. A., GAREY, M. R., JOHNSON, D. S., SHOR, P. W., WEBER, R. R., AND YANNAKAKIS, M. 2000. Bin packing with discrete item sizes, Part. I: Perfect packing theorems and the average case behavior of optimal, packings. SIAM J. Discrete Math. 13, 3, 384-402.
10. OFFMAN, E. G., GAREY, M. R., AND JOHNSON, D. S. 1987. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed. PWS Publishing, Boston, MA. 46-93.
11. OFFMAN, E. G., GAREY, M. R., AND JOHNSON, D. S. 1996. Bin packing with divisible item, sizes. J. Complex. 3, 4, 406-428.
12. ENGEBRETSEN, L., AND SUDAN, M. 2002. Harmonic broadcasting is optimal. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 431-432.
13. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman.
14. GONDHALEKAR, V., JAIN, R., AND WERTH, J. 1997. Scheduling on airdisks: Efficient access to personalized information, services via periodic wireless data broadcast. In Proceedings of the IEEE International Conference on Communications (ICC), vol. 3. 1276-1280.
15. HOLTE, R., MOK, A., ROSIER, L., TULCHINSKY, I., AND VARVEL, D. 1989. The pinwheel: A real-time scheduling problem. In Proceedings of the 22nd Hawaii International Conference on System Science. 693-702.
16. HUA, K. A., AND SHEU, S. 2000. An efficient periodic broadcast technique for digital video libraries. Multimedia Tools Appl. 10, 2-3, 157-177.
17. JOHNSON, D. S., DEMERS, A., ULLMAN, J. D., GAREY, M. R., AND GRAHAM, R. L. 1974. Worst-Case performance bounds for simple one-dimensional, packing algorithm. SIAM J. Comput. 3, 4, 299-325.
18. JUHN, L., AND TSENG, L. 1997. Harmonic broadcasting for video-on-demand service. IEEE Trans. Broadcast. 43, 3, 268-271.
19. KANN, V. 1991. Maximum bounded. 3-dimensional matching is max SNP-complete. Inf. Process. Lett. 37, 1, 27-35.
20. EE, C. C., AND LEE, D. T. 1985. A simple online bin packing algorithm. J. ACM 32, 562-572.
21. IU, C. L., AND LAYLEND, W. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20, 1, 46-61.
22. SEIDEN, S. 2002. On the online bin-packing problem. J. ACM 49, 5, 640-671.
23. NJDEMAN, R. 1980. The chairman assignment problem. Discrete Math. 32, 3, 323-330.
24. VAN VLIET, A. 1996. On the asymptotic worst case behavior of harmonic fit. J. Alg. 20, 1, 113-136.
25. EGA, W. F., AND LEUKER, G. S. 1981. Bin packing can be solved within 1 + in lineartime. Combinatorica 1, 4, 349-355.
26. ISWANATHAN, S., AND IMIELINSKI, T. 1996. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Syst. J. 4, 3, 197-208.
27. WONG, P. W. H., CHAN, W. T., AND LAM, T. W. 2005. Dynamic bin packing of unit-fractions items. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP).