Tians scheduling: Using partial processing in best-effort applications

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2011, Pages 434-445

  He, Yuxiong ^a   Elnikety, Sameh ^a   Sun, Hongyang ^b  

^a MICROSOFT RESEARCH   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Best effort applications; Interactive services; Offline; Online clairvoyant; Online nonclairvoyant; Partial results; Quality profile; Scheduling; VOD bandwidth allocation; Web search engine

Indexed keywords

BANDWIDTH ALLOCATIONS; BEST-EFFORT APPLICATIONS; INTERACTIVE SERVICES; OFFLINE; ONLINE CLAIRVOYANT; ONLINE NONCLAIRVOYANT; PARTIAL RESULTS; QUALITY PROFILE;

COMPUTER SIMULATION; INFORMATION RETRIEVAL; ONLINE SYSTEMS; QUALITY OF SERVICE; SCHEDULING ALGORITHMS; SEARCH ENGINES; USER INTERFACES; VIDEO ON DEMAND;

WORLD WIDE WEB;

EID: 80051883678     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2011.91     Document Type: Conference Paper

References (27)

1. W. Baek and T. M. Chilimbi. Green: A framework for supporting energy-conscious programming using controlled approximation. In PLDI, 2010.
2. N. Bansal, T. Kimbrel, and K. Pruhs. Dynamic speed scaling to manage energy and temperature. In FOCS, 2004.
3. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. Bandwidth allocation with preemption. In STOC, 1995.
4. A. Bar-Noy, J. A. Garay, and A. Herzberg. Sharing video on demand. Discrete Applied Mathematics, 129:3-30, 2003.
5. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line real-time task scheduling. Real-Time Systems, 4:125-144, May 1992. (Pubitemid 23566344)
6. E.-C. Chang and C.-K. Yap. Competitive online scheduling with level of service. In Computing and Combinatorics, 2001.
7. Y. Chen. Detecting web page structure for adaptive viewing on small form factor devices. In WWW, pages 225-233, 2003.
8. F. Y. L. Chin and S. P. Y. Fung. Improved competitive algorithms for online scheduling with partial job values. In Computing and Combinatorics, 2003.
9. F. Y. L. Chin and S. P. Y. Fung. Online scheduling with partial job values: Does timesharing or randomization help? Algorithmica, 37:149-164, 2003.
10. M. Chrobak, L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tichý, and N. Vakhania. Preemptive scheduling in overloaded systems. Journal of Computer and System Sciences, 67:183-197, 2003.
11. A. Fox, S. D. Gribble, Y. Chawathe, and E. A. Brewer. Mobility. chapter Adapting to network and client variation using infrastructural process proxies: lessons and perspectives, pages 431-446. 1999.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. 1979.
13. M. Garofalakis, Y. Ioannidis, B. Ozden, and A. Silberschatz. Competitive on-line scheduling of continuousmedia streams. Journal of Computer and System Sciences, 64:219-248, 2002. (Pubitemid 34599448)
14. C. Huang, P. A. Chou, and A. Klemets. Optimal control of multiple bit rates for streaming media. In Picture Coding Symposium, 2004.
15. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617- 643, 2000.
16. C.-Y. Koo, T. W. Lam, T.-W. Ngan, and K.-K. To. Online scheduling with tight deadlines. In Mathematical Foundations of Computer Science, 2001.
17. G. Koren and D. Shasha. Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor realtime systems. SIAM Journal on Computing, 24:318- 339, 1995.
18. T. W. Lam and K. K. To. Trade-offs between speed and processor in hard-deadline scheduling. In SODA, 1999.
19. E. L. Lawler. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research, 26:125-133, 1991.
20. M. Li, A. C. Yao, and F. F. Yao. Discrete and continuous min-energy schedules for variable voltage processors. National Academy of Sciences, 103:3983- 3987, 2006.
21. J. Liu, R. S.G., B. Li, and H. Zhang. Opportunities and challenges of peer-to-peer internet video broadcast. Proceedings of the IEEE, 96:11-24, 2008.
22. C. McCann, R. Vaswani, and J. Zahorjan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Transactions on Computer Systems, 11(2):146-178, 1993. (Pubitemid 23668699)
23. R. Rejaie, M. Handley, and D. Estrin. Quality adaptation for congestion controlled video playback over the internet. SIGCOMM Computer Communication Review, 29:189-200, 1999. (Pubitemid 32081865)
24. K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang. The feasibility of supporting large-scale live streaming applications with dynamic application endpoints. SIGCOMM Comput. Commun. Rev., 34:107- 120, 2004. (Pubitemid 40954873)
25. J. Stankovic, M. Spuri, K. Ramamritham, and G. C. Buttazzo. Deadline Scheduling for Real-Time systems - EDF and related algorithms. Academic Publishers, 1998.
26. F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In FOCS, 1995.
27. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996. (Pubitemid 126669856)