Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Sequence Step Algorithm in Operating System
Scheduling algorithms are designed for serving the processes by providing the maximum utilization of the resources. The resources that are allocated to execute the given input, should not remain idle and repetitive projects has to be handled by the resources simultaneously without any break. Considering all these factors, a few simulation approaches have been developed to improve the repetitive activities by analyzing the nature of the process but none of the approaches delivered maximum resource utilization. Later, the sequence step algorithm has been initiated to minimize the processing and execution time of the process by determining the probability of process durations and producing maximum resource utilization.
Sequence step algorithm
This algorithm works on the principle of discrete event simulation which aims in producing maximum utilization of resources. The discrete event simulation (DES) method represents the process of the system that functions opposite to the continuous one.
It resembles the digital signal whether it has one starting and the ending points which occur only at some sort of time. The event occurrence is calculated using simulation time and is mentioned as the next event to occur. Another approach can also be followed for discrete events and that technique is called incremental time progression. The first approach of the next event simulation executes faster than the incremental time method as every time need not be simulated in the next event simulation method.
Consider a simple example to understand how to simulate the discrete events for modeling a queuing system. In the banking environment, the system objects here are the customer and teller and events can be stated as customer-arrival in queue, start-service, and end-service
The user or client can take the queue on their issue to get resolved and soon after the user enters the queue it increments the length by 1. The service can be provided when the status is available without any waiting time.
When Start- service event starts then the teller status is assigned to busy and the end service is scheduled with some delay.
When the service ends the queue length is decremented by 1 stating the customer has completed his/her activities.
Resource utilization can be achieved using two loops such as a sequence step and replication loop in a nested way. In each of the sequence steps of the outer loop, the inner loop processes the replication loop which collects crew idle time for all the activities. After this collection process, crew idle times are used to determine arrival dates for the user-specified events. This process of gathering the arrival time of the crew for repetitive activities on the corresponding sequence step has to be repeated from the initial to the end phase of the sequence step.
In simple steps, two nested loops have to be maintained for each iteration of the event sequence such as an outer sequence step loop and an inner replication loop. Both loops have to be processed from the first to the last sequence of discrete events in any real-time application where this simulation algorithm is used.
The initial step is to stimulate the network and gather crew idle time information for each project that has similar activities to be carried out by team members. Based on the number of replications, these crew idle time samples are plotted in a histogram or any chart plotting the relative frequencies
Then determine the cumulative probability for the crew collect time collected in the above step and assign a time slot for the Crewlead_time which will be set to 0 at the initial phase of the simulation
The simulation model is reset by clearing all the collected crew time statistics for all the activities. Crewlead_time value which is derived from the previous sequence step is used for the upcoming sequence step activities. Repeat steps 1 and 2 until the last sequence step is reached.
This sequence step algorithm which uses a simulation model can be used in applications where repetitive projects are implemented and this algorithm can make effective usage of available resources and eliminate the crew's idle time.
Few of the environments where sequence step algorithm can be induced are in hospital background where operation rooms are shared for performing repetitive operations but for different patients, lab analysis where the sequence algorithm can be made to a few patient samples to detect and improve the analysis report. In manufacturing industries where equipment or devices are to be simulated and tested before launching them to the customer and company may perform several sequence steps to ensure the working of the model. It can be applied to network-simulating devices which have distributed protocols before it is deployed in the networking area.
Conclusion
The sequence step algorithm determines the activity idle time and Lead time buffers in each of its sequence steps and replication step. The cumulative frequency and lead time buffer values are used for moving from one sequence step to another step in the next activities till reaching the end phase of the network.
99 Views
