Optimizing job scheduling on multicore computers

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Standard

Optimizing job scheduling on multicore computers. / Zhu, Huanzhou; He, Ligang; Jarvis, Stephen A.

Proceedings - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014. February. ed. IEEE Computer Society, 2015. p. 61-70 7033638 (Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS; Vol. 2015-February, No. February).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Zhu, H, He, L & Jarvis, SA 2015, Optimizing job scheduling on multicore computers. in Proceedings - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014. February edn, 7033638, Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS, no. February, vol. 2015-February, IEEE Computer Society, pp. 61-70, 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014, Paris, France, 9/09/14. https://doi.org/10.1109/MASCOTS.2014.16

APA

Zhu, H., He, L., & Jarvis, S. A. (2015). Optimizing job scheduling on multicore computers. In Proceedings - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014 (February ed., pp. 61-70). [7033638] (Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS; Vol. 2015-February, No. February). IEEE Computer Society. https://doi.org/10.1109/MASCOTS.2014.16

Vancouver

Zhu H, He L, Jarvis SA. Optimizing job scheduling on multicore computers. In Proceedings - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014. February ed. IEEE Computer Society. 2015. p. 61-70. 7033638. (Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS; February). https://doi.org/10.1109/MASCOTS.2014.16

Author

Zhu, Huanzhou ; He, Ligang ; Jarvis, Stephen A. / Optimizing job scheduling on multicore computers. Proceedings - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014. February. ed. IEEE Computer Society, 2015. pp. 61-70 (Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS; February).

Bibtex

@inproceedings{54bec79a71bb42189e7fa268fab99f51,
title = "Optimizing job scheduling on multicore computers",
abstract = "It is common nowadays that multiple cores reside on the same chip and share the on-chip cache. Resource sharing may cause performance degradation of the co-running jobs. Job co-scheduling is a technique that can effectively alleviate the contention. Many co-schedulers have been developed in the literature, but most of them do not aim to find the optimal co-scheduling solution. Being able to determine the optimal solution is critical for evaluating co-scheduling systems. Moreover, most co-schedulers only consider serial jobs. However, there often exist both parallel and serial jobs in some situations. This paper aims to tackle these issues. In this paper, a graph-based method is developed to find the optimal co-scheduling solution for serial jobs, and then the method is extended to incorporate parallel jobs. The extensive experiments have been conducted to evaluate the effectiveness and efficiency of the proposed co-scheduling algorithms. The results show that the proposed algorithms can find the optimal co-scheduling solution for both serial and parallel jobs.",
keywords = "Co-scheduling, Multicore, Parallel application",
author = "Huanzhou Zhu and Ligang He and Jarvis, {Stephen A.}",
note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014 ; Conference date: 09-09-2014 Through 11-09-2014",
year = "2015",
month = feb,
day = "5",
doi = "10.1109/MASCOTS.2014.16",
language = "English",
series = "Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS",
publisher = "IEEE Computer Society",
number = "February",
pages = "61--70",
booktitle = "Proceedings - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014",
address = "United States",
edition = "February",

}

RIS

TY - GEN

T1 - Optimizing job scheduling on multicore computers

AU - Zhu, Huanzhou

AU - He, Ligang

AU - Jarvis, Stephen A.

N1 - Publisher Copyright: © 2014 IEEE.

PY - 2015/2/5

Y1 - 2015/2/5

N2 - It is common nowadays that multiple cores reside on the same chip and share the on-chip cache. Resource sharing may cause performance degradation of the co-running jobs. Job co-scheduling is a technique that can effectively alleviate the contention. Many co-schedulers have been developed in the literature, but most of them do not aim to find the optimal co-scheduling solution. Being able to determine the optimal solution is critical for evaluating co-scheduling systems. Moreover, most co-schedulers only consider serial jobs. However, there often exist both parallel and serial jobs in some situations. This paper aims to tackle these issues. In this paper, a graph-based method is developed to find the optimal co-scheduling solution for serial jobs, and then the method is extended to incorporate parallel jobs. The extensive experiments have been conducted to evaluate the effectiveness and efficiency of the proposed co-scheduling algorithms. The results show that the proposed algorithms can find the optimal co-scheduling solution for both serial and parallel jobs.

AB - It is common nowadays that multiple cores reside on the same chip and share the on-chip cache. Resource sharing may cause performance degradation of the co-running jobs. Job co-scheduling is a technique that can effectively alleviate the contention. Many co-schedulers have been developed in the literature, but most of them do not aim to find the optimal co-scheduling solution. Being able to determine the optimal solution is critical for evaluating co-scheduling systems. Moreover, most co-schedulers only consider serial jobs. However, there often exist both parallel and serial jobs in some situations. This paper aims to tackle these issues. In this paper, a graph-based method is developed to find the optimal co-scheduling solution for serial jobs, and then the method is extended to incorporate parallel jobs. The extensive experiments have been conducted to evaluate the effectiveness and efficiency of the proposed co-scheduling algorithms. The results show that the proposed algorithms can find the optimal co-scheduling solution for both serial and parallel jobs.

KW - Co-scheduling

KW - Multicore

KW - Parallel application

UR - http://www.scopus.com/inward/record.url?scp=84937933682&partnerID=8YFLogxK

U2 - 10.1109/MASCOTS.2014.16

DO - 10.1109/MASCOTS.2014.16

M3 - Conference contribution

AN - SCOPUS:84937933682

T3 - Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

SP - 61

EP - 70

BT - Proceedings - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014

PB - IEEE Computer Society

T2 - 2014 22nd Annual IEEE International Symposium on Modeling, Analysis and Simulation of Computer, and Telecommunication Systems, MASCOTS 2014

Y2 - 9 September 2014 through 11 September 2014

ER -