Online competitive algorithms for maximizing weighted throughput of unit jobs

Journal of Discrete Algorithms

Volumn 4, Issue 2, 2006, Pages 255-276

  Chin, Francis Y L ^a   Chrobak, Marek ^b   Fung, Stanley P Y ^a   Jawor, Wojciech ^b   Sgall, Jiří ^c   Tichý, Tomáš ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b University of California Riverside   (United States)

^c MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

Buffer management; Online algorithms; Scheduling

Indexed keywords

ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING; THROUGHPUT;

BUFFER MANAGEMENT; COMPETITIVE RATIOS; ONLINE ALGORITHMS; UNIT-JOB SCHEDULING;

ALGORITHMS;

EID: 33646487268     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.03.005     Document Type: Article

References (17)

1. Aiello W.A., Mansour Y., Rajagopolan S., and Rosen A. Competitive queue policies for differentiated services. Proc. of the IEEE INFOCOM (2000) 431-440
2. Andelman N., Mansour Y., and Zhu A. Competitive queuing policies in QoS switches. Proc. 14th Symp. on Discrete Algorithms (SODA) (2003), ACM/SIAM 761-770
3. Bansal N., Fleischer L., Kimbrel T., Mahdian M., Schieber B., and Sviridenko M. Further improvements in competitive guarantees for QoS buffering. Proc. 31st International Colloquium on Automata, Languages, and Programming (ICALP). Lecture Notes in Comput. Sci. vol. 3142 (2004), Springer, Berlin 196-207
4. Bartal Y., Chin F.Y.L., Chrobak M., Fung S.P.Y., Jawor W., Lavi R., Sgall J., and Tichý T. Online competitive algorithms for maximizing weighted throughput of unit jobs. Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Comput. Sci. vol. 2996 (2004), Springer, Berlin 187-198
5. Borodin A., and El-Yaniv R. Online Computation and Competitive Analysis (1998), Cambridge University Press, Cambridge
6. Chang E.-C., and Yap C. Competitive online scheduling with level of service. Proc. 7th Annual International Computing and Combinatorics Conference (COCOON). Lecture Notes in Comput. Sci. vol. 2108 (2001), Springer, Berlin 453-462
7. Chin F.Y.L., and Fung S.P.Y. Online scheduling with partial job values and bounded importance ratio. Proc. of International Computer Symposium (2002) 787-794
8. Chin F.Y.L., and Fung S.P.Y. Improved competitiveness algorithms for online scheduling with partial job values. 9th International Computing and Combinatorics Conference (2003) 425-434
9. Chin F.Y.L., and Fung S.P.Y. Online scheduling for partial job values: Does timesharing or randomization help?. Algorithmica 37 (2003) 149-164
10. Chrobak M., Epstein L., Noga J., Sgall J., van Stee R., Tichý T., and Vakhania N. Preemptive scheduling of tasks with hard deadlines. J. Comput. Systems Sci. 67 (2003) 183-197
11. Chrobak M., Jawor W., Sgall J., and Tichý T. Improved online algorithms for buffer management in QoS switches. Proc. 12th European Symp. on Algorithms (ESA). Lecture Notes in Comput. Sci. vol. 3221 (2004), Springer, Berlin 204-215
12. Epstein L., and van Stee R. Buffer management problems. SIGACT News 35 (2004) 58-66
13. Hajek B. On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. Conference in Information Sciences and Systems (2001) 434-438
14. Kesselman A., Lotker Z., Mansour Y., Patt-Shamir B., Schieber B., and Sviridenko M. Buffer overflow management in QoS switches. Proc. 33rd Symp. Theory of Computing (STOC) (2001), ACM 520-529
15. Kesselman A., Mansour Y., and van Stee R. Improved competitive guarantees for QoS buffering. Proc. 11th European Symp. on Algorithms (ESA). Lecture Notes in Comput. Sci. vol. 2832 (2003), Springer, Berlin 361-372
16. Liu J.W.S., Lin K.-J., Shih W.-K., shi Yu A.C., Chung J.-Y., and Zhao W. Algorithms for scheduling imprecise computations. IEEE Computer 24 5 (1991) 58-68
17. Lotker Z., and Patt-Shamir B. Nearly optimal FIFO buffer management for DiffServ. Proc. of the 21st Symp. on Principles of Distributed Computing (2002), ACM 134-143