Zeta: Scheduling interactive services with partial execution

Proceedings of the 3rd ACM Symposium on Cloud Computing, SoCC 2012

Volumn , Issue , 2012, Pages

  He, Yuxiong ^a   Elnikety, Sameh ^a   Larus, James ^a   Yan, Chenyu ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Deadline; Interactive service; Partial execution; Quality; Quality profile; Response time; Scheduling; Web search

Indexed keywords

DEADLINE; INTERACTIVE SERVICES; PARTIAL EXECUTION; QUALITY PROFILE; WEB SEARCHES;

CLOUD COMPUTING; IMAGE QUALITY; INFORMATION RETRIEVAL; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING ALGORITHMS; SEARCH ENGINES; WEBSITES;

SCHEDULING;

EID: 84870566495     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2391229.2391241     Document Type: Conference Paper

References (29)

1. T. Abdelzaher and N. Bhatti. Web content adaptation to improve server overload behavior. In WWW, 1999.
2. T. Abdelzaher, K. G. Shin, and N. Bhatti. User-level qos-adaptive resource management in server end-systems. IEEE Trans. on Computers, 52:2003, 2003.
3. W. Baek and T. M. Chilimbi. Green: A framework for supporting energy-conscious programming using controlled approximation. In PLDI, 2010.
4. U. Balli, H. Wu, B. Ravindran, J. S. Anderson, and E. Douglas Jensen. Utility accrual real-time scheduling under variable cost functions. IEEE Trans. Comput., 56(3):385-401, Mar. 2007.
5. A. Block, B. Brandenburg, J. H. Anderson, and S. Quint. An adaptive framework for multiprocessor real-time system. In Euromicro Conference on Real-Time Systems, 2008.
6. M. Broadie and P. Glasserman. Estimating security price derivatives using simulation. Manage. Sci., 42:269-285, February 1996.
7. E.-C. Chang and C.-K. Yap. Competitive online scheduling with level of service. In Computing and Combinatorics, 2001.
8. Y. Chen. Detecting web page structure for adaptive viewing on small form factor devices. In WWW, 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. G. Cortazar, M. Gravet, and J. Urzua. The valuation of multidimensional american real options using the lsm simulation method. Computers and Operations Research., 2006.
12. B. Croft, D. Metzler, and T. Strohman. Search Engines: Information Retrieval in Practice. Addison Wesley, 2009.
13. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazon's highly available key-value store. In SOSP, 2007.
14. S. Elnikety, J. Tracey, E. Nahum, and W. Zwaenepoel. A method for transparent admission control and request scheduling in e-commerce web sites. In WWW, 2004.
15. A. Fox, S. D. Gribble, Y. Chawathe, and E. A. Brewer. Adapting to network and client variation using infrastructural process proxies: lessons and perspectives. Personal Communications, 5:10-19, 1998.
16. J. Hamilton. Blog article: Perspectives. http://perspectives.mvdirona. com/2009/10/31/thecostoflatency.aspx. 2009.
17. Y. He, S. Elnikety, and H. Sun. Tians scheduling: Using partial processing in best-effort applications. In ICDCS, 2011.
18. H. Hoffmann, S. Sidiroglou, M. Carbin, S. Misailovic, A. Agarwal, and M. C. Rinard. Dynamic knobs for responsive power-aware computing. In ASPLOS, 2001.
19. J. Huang, P.-J. Wan, and D.-Z. Du. Criticality- and qos-based multiresource negotiation and adaptation. RTS, 15:249-273, 1998.
20. C.-Y. Koo, T. W. Lam, T.-W. Ngan, and K.-K. To. On-line scheduling with tight deadlines. In MFCS, 2001.
21. C. Li, C. Ding, and K. Shen. Quantifying the cost of context switch. In ECS, 2007.
22. J. W. S. Liu, K.-J. Lin, W.-K. Shih, A. C.-s. Yu, J.-Y. Chung, and W. Zhao. Algorithms for scheduling imprecise computations. Computer, 24:58-68, 1991.
23. C. Lu, J. A. Stankovic, T. Abdelzaher, S. H. Son, and G. Tao. Feedback control real-time scheduling: support for performance guarantees in unpredictable environments. Oper. Syst. Rev., 34:33-43, 2000.
24. A. Povzner, T. Kaldewey, S. Brandt, R. Golding, T. M. Wong, and C. Maltzahn. Efficient guaranteed disk request scheduling with fahrrad. In Eurosys, 2008.
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. M. Welsh and D. Culler. Adaptive overload control for busy internet servers. In USITS, 2003.
27. M. Welsh, D. Culler, and E. Brewer. Seda: an architecture for well-conditioned, scalable internet services. In SOSP, 2001.
28. F. Yu, Q. Zhang, W. Zhu, and Y.-Q. Zhang. Qos-adaptive proxy caching for multimedia streaming over the internet. In IEEE Trans. Circuits Syst. Video Techno., pages 257-269, 2002.
29. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3), 1996.