Open In App

Linear Scheduling Method in Operating System

Linear Scheduling Method is graphical technique in which horizontal axis is used to represent length of linear project, and vertical axis represents duration of project’s activities. It is also known as distance-time scheduling. Every activity is mapped sequentially on graph, depending on sequence of activities in project section. The starting time and location of the activity are showcased as starting point of activity, and end time and location of activity are showcased as endpoint in linear schedule graph.

In Operating Systems, Linear Scheduling Method is most commonly used to schedule resources for repetitive activities in which tasks are sequentially scheduled in queue (same as in LSM implementation in highway, rail, pipeline, and other construction projects).

It schedules activities to ensure :

Elements of Linear Scheduling Method :

Implementations of Linear Scheduling Method :

Implementation of Linear Scheduling Method in Operating Systems :
Consider two activities, Activity A and Activity B, both require group of processes to be executed.

Time-Distance graph to illustrate implementation of LSM in Operating Systems

Both activities are initiated from location 0 at different intervals, both access different memory locations at particular intervals in-order to execute their processes. Hence, after the successful execution of processes (sub-activities) of both process, both activities are terminated.

Buffer :
When activities progress continuously in chain, some spacing between activities is required. This spacing serves as buffer and can be distance or time interval between activities.

Advantages of Linear Scheduling Method :

Disadvantages of Linear Scheduling Method :

Article Tags :