Divisible Load Framework and Close Form for Scheduling in Fog Computing Systems

Abstract

Fog computing is a possible way to reduce the latency of requests which have been sent to the cloud centres. It means the jobs can be scheduled to fog systems before being sent to the cloud centres. There is an extensive literature concerning to scheduling in fog computing systems. This paper mainly proposes a divisible load framework for scheduling in fog computing system. The divisible load theory is a suitable method for scheduling of data intensive jobs. This paper illustrates that the divisible load scheduling(DLS) method can be performed in the area of fog computing. This paper proposes a three-layer architecture for load scheduling in fog computing using divisible load theory. We formulate a close form for the proposed model. Finally we solve the close form.