https://github.com/joseph7814/c-oop

This Project is about Design A Scheduler Following Non-Preemptive Scheduling Approach To Schedule.
https://github.com/joseph7814/c-oop

operating-system programming schedule scheduler testcases

Last synced: 10 months ago
JSON representation

This Project is about Design A Scheduler Following Non-Preemptive Scheduling Approach To Schedule.

• Host: GitHub
• URL: https://github.com/joseph7814/c-oop
• Owner: Joseph7814
• Created: 2020-04-10T11:11:28.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2022-02-10T17:26:19.000Z (almost 4 years ago)
• Last Synced: 2025-02-25T06:22:44.350Z (10 months ago)
• Topics: operating-system, programming, schedule, scheduler, testcases
• Language: C++
• Homepage:
• Size: 160 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
Design A Scheduler Following Non-Preemptive Scheduling Approach To Schedule 

	The Processes That Arrives At Different Units And Having Burst Time Double 

	The Arrival Time.Scheduler Selects The Process With Largest Burst Time From

	The Queue For The Execution. Process Is Not Being Preempted Until It Finishes

	Its Service Time.Compute The Average Waiting Time And Average Turnaround Time. 

    What Should Be The Average Waiting Time If Processes Are Executed According

    To Shortest Job First Scheduling Approach With The Same Attribute Values.