Load scheduling using Divisible Load Theory with Non-Linear Loads
Document Type : Original Article
Abstract
Limiting the speed of processors is an obstacle to processing data-intensive loads. The only way to increase the processing speed and reduce the finish time is to use parallel or distributed systems. In this paper, Scheduling is discussed. A new type of scheduling has been presented since 1988 based on "divisible load theory" and research in this field has been carried out in different computing environments except fog computing for non-linear loads. This article proposes optimal scheduling for non-linear loads using divisible load theory (DLT) in the fog environment by presenting equations and solving them and the corresponding algorithm. Experimental tests have shown that this method reduces the finish time about eighty-five times compared to common methods such as equal division.