Distributed Job Scheduling in on-Demand GPU as a Service Systems

Document Type : Original Article

Authors

Faculty of Electrical Engineering, Sahand University of Technology

Abstract

Optimal scheduling of resources is essential on GPU-based servers that are suitable for parallel tasks. These resources usually have a high speed and therefore have a high cost. In order to make optimal use of these resources, service providers must be able to choose the best type of virtual machine, the best type of GPU processor, and the best number of this type of processor for each request. Such a problem is called an optimization problem. The present article, while modeling the resource allocation problem as a linear optimization problem, presents a new method for distributing requests. The proposed method uses a central queue and then distributes requests among several local queues using a new request distribution method. Then it schedules and executes the tasks in each local queue in parallel. Scheduling in each local queue determines, for each request: (1) the best type of virtual machine, (2) the best type of GPU processor, and (3) the best number of GPU processors. The comparison of the proposed method with the latest available methods shows a decrease in execution time, a decrease in response time, and a significant decrease in the cost of using resources in the proposed method.

Keywords

Main Subjects

TABRIZ JOURNAL OF ELECTRICAL ENGINEERING

Articles in Press, Corrected Proof
Available Online from 04 December 2023

Files

Share

How to cite

Statistics