Efficient online scheduling for deadline-sensitive jobs

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2013, Pages 305-314

  Lucier, Brendan ^a   Menache, Ishai ^b   Naor, Joseph ^c   Yaniv, Jonathan ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b MICROSOFT RESEARCH   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Online scheduling; Resource allocation; Scheduling algorithms; Truthful mechanisms

Indexed keywords

CLUSTERING ALGORITHMS; RESOURCE ALLOCATION; SCHEDULING; SCHEDULING ALGORITHMS;

DEADLINE-AWARE SCHEDULING; ONLINE SCHEDULING; PRE-EMPTIVE SCHEDULER; RUN-TIME EFFICIENCY; SCHEDULING FRAMEWORKS; SCHEDULING MECHANISM; TRUTHFUL MECHANISMS; WORST-CASE PERFORMANCE;

JOB SHOP SCHEDULING;

EID: 84883498208     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2486159.2486187     Document Type: Conference Paper

References (13)

1. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. Bandwidth allocation with preemption. SIAM J. Compta., 28(5):1806-1828, 1999. (Pubitemid 129304152)
2. R. Canetti and S. Irani. Bounding the power of preemption in randomized scheduling. SIAM J. Comput., 27(4):993-1015, 1998. (Pubitemid 128689441)
3. A. Ferguson, P. Bodik, S. Kandula, E. Boutin, and R. Fonseca. Jockey: Guaranteed job latency in data parallel clusters. In Proceedings of the 7th ACM european conference on Computer Systems, pages 99-112. ACM, 2012.
4. J. A. Garay, J. Naor, B. Yener, and P. Zhao. On-line admission control and packet scheduling with interleaving. In INFOCOM, 2002.
5. A. Ghodsi, V. Sekar, M. Zaharia, and I. Stoica. Multi-resource fair queueing for packet processing. In Proceedings of the ACM SlGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication, pages 1-12. ACM, 2012.
6. M. T. Hajiaghayi, R. Kleinberg, M. Mahdian, and D. C. Parkes. Online auctions with re-usable goods, pages 165-174, 2005.
7. H. Herodotou, F. Dong, and S. Babu. No one (cluster) size fits all: Automatic cluster sizing for data-intensive analytics. In Proceedings of the 2nd ACM Symposium on Cloud Computing, page 18. ACM, 2011.
8. M. Isard, V. Prabhakaran, J. Currey, U. Wieder, K. Talwar, and A. Goldberg. Quincy: Fair scheduling for distributed computing clusters. In Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, pages 261-276. ACM, 2009.
9. N. Jain, I. Menache, J. Naor, and J. Yaniv. A truthful mechanism for value-based scheduling in cloud computing. Algorithmic Game Theory, pages 178-189, 2011.
10. N. Jain, I. Menache, J. Naor, and J. Yaniv. Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. In 5PAA, pages 255-266, 2012.
11. V. Jalaparti, H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron. Bridging the tenant-provider gap in cloud services. In ACM Symposium on Cloud Computing. ACM, 2012.
12. G. Koren and D. Shasha. Dover; an optimal on-line scheduling algorithm for overloaded real-time systems. In RTSS, pages 290-299. IEEE Computer Society, 1992.
13. G. Koren and D. Shasha. Moca: A multiprocessor on-line competitive algorithm for real-time system scheduling. Theor. Comput. Sci., 128(1&2):75-97, 1994.