TY - GEN
T1 - A Proposal of Dynamic Job Scheduling Algorithm Considering CPU Core Utilization for User-PC Computing System
AU - Kamoyedji, Ariel
AU - Funabiki, Nobuo
AU - Htet, Hein
AU - Kuribayashi, Minoru
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - The User-PC computing system (UPC) has been studied as a very low cost distributed computing platform that leverages idling resources of users' personal computers (PCs). Designed according to the master-worker model, the master PC accepts jobs from users and assigns them to available worker PCs. An efficient static job assignment algorithm considering CPU core utilization has already been devised for the UPC system. It finds an optimal assignment that minimizes the makespan in a static scenario, i.e. jobs are all available in the beginning and all worker PCs are idle. However, in reality, jobs dynamically join and leave the system and as such, some workers may be busy when new jobs arrive. In this paper, we propose a dynamic job scheduling algorithm for the UPC system by extending the static job assignment algorithm. It finds assigned workers to all queuing jobs either on new job arrival, or on job completion by a worker PC. For evaluation, we conducted experiments using six worker PCs and up to 42 jobs. Our algorithm could significantly reduce the makespan compared to other scheduling algorithms.
AB - The User-PC computing system (UPC) has been studied as a very low cost distributed computing platform that leverages idling resources of users' personal computers (PCs). Designed according to the master-worker model, the master PC accepts jobs from users and assigns them to available worker PCs. An efficient static job assignment algorithm considering CPU core utilization has already been devised for the UPC system. It finds an optimal assignment that minimizes the makespan in a static scenario, i.e. jobs are all available in the beginning and all worker PCs are idle. However, in reality, jobs dynamically join and leave the system and as such, some workers may be busy when new jobs arrive. In this paper, we propose a dynamic job scheduling algorithm for the UPC system by extending the static job assignment algorithm. It finds assigned workers to all queuing jobs either on new job arrival, or on job completion by a worker PC. For evaluation, we conducted experiments using six worker PCs and up to 42 jobs. Our algorithm could significantly reduce the makespan compared to other scheduling algorithms.
KW - CPU core
KW - distributed computing
KW - job scheduling
KW - local search
KW - optimization
KW - thread
KW - UPC
UR - http://www.scopus.com/inward/record.url?scp=85124159215&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85124159215&partnerID=8YFLogxK
U2 - 10.1109/CANDARW53999.2021.00051
DO - 10.1109/CANDARW53999.2021.00051
M3 - Conference contribution
AN - SCOPUS:85124159215
T3 - Proceedings - 2021 9th International Symposium on Computing and Networking Workshops, CANDARW 2021
SP - 268
EP - 271
BT - Proceedings - 2021 9th International Symposium on Computing and Networking Workshops, CANDARW 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 9th International Symposium on Computing and Networking Workshops, CANDARW 2021
Y2 - 23 November 2021 through 26 November 2021
ER -