Abstract—As a low-cost high-performance master-worker-model-based computing platform for group members, we have studied the User-PC computing system (UPC). The UPC master assigns queuing jobs from users to UPC workers that use idling computing resources of members’ personal computers (PCs). In this paper, we propose a job-worker assignment algorithm to minimize the makespan, considering the number of job threads and the number of CPU cores. For evaluation of the algorithm, we conducted experiments running 72 jobs on the UPC system with six workers that have various numbers of threads and CPU cores. The schedules by the algorithm could significantly reduce the makespan compared to other algorithms.
Index Terms—UPC, distributed computing, CPU core, thread, job scheduling, local search, optimization.
The authors are with Department of Information and Communication Systems, Okayama University, Japan (e-mail: funabiki@okayama-u.ac.jp).
Cite: Ariel Kamoyedji, Nobuo Funabiki, Hein Htet, and Minoru Kuribayashi, "A Proposal of Job-Worker Assignment Algorithm Considering CPU Core Utilization for User-PC Computing System," International Journal of Future Computer and Communication vol. 11, no. 2, pp. 40-46, 2022.
Copyright © 2022 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Copyright © 2008-2024. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net