Computer Science > PROJECT FINAL > California State University, Long Beach - CECS 326CECS 326 - Group Project 4 Report (All)

California State University, Long Beach - CECS 326CECS 326 - Group Project 4 Report

Document Content and Description Below

Abstract This project focuses on the topic of CPU scheduling and involves the implementation of several process scheduling algorithms. The scheduler is assigned a predefined set of tasks and will s... chedule the tasks based on the selected scheduling algorithms. Each task is assigned a priority and a CPU burst. The priorities range from 1 to 10, where the higher number would indicate a higher priority. We were required to implement the scheduling algorithms: First-come, first-serve (FCFS), Priority scheduling and Round-robin (RR). Sample code was provided in the C files (schedule_fcfs.c, schedule_priority.c, schedule_rr.c). These files along with header files and a driver class read the schedule of tasks, insert the tasks into a list and invoke the scheduler. When printed, the schedule of tasks is displayed in the format [task name] [priority] [CPU burst]. Purpose The purpose of this project was to implement the three CPU scheduling algorithms and to help us see what goes on in the scheduler when it is invoked. This assignment lets us see the difference between the ordering of the tasks, given the scheduling algorithm. First come first serve is the easiest CPU scheduling algorithm to implement and use. In this scheduling method, the process that requests the CPU first gets the allocation first. Priority based scheduling helps the OS involve priority assignments. Round robin scheduling helps for starvation free execution of processes. [Show More]

Last updated: 2 years ago

Preview 1 out of 4 pages

Buy Now

Instant download

We Accept: