logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

project will allow the user to choose a scheduling algorithm from among the six presented in the textbook.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

I.  Project Organization

This project demonstrate six different scheduling algorithms. 

You should do the following pieces to complete your project.  Each piece is explained below:

  • Code 60 points

  • Output 30 points

  • Summary 10 points

 

Code

Your code should be nicely formatted with plenty of comments.  The code should be easy to read, properly indented, employ good naming standards, good structure, etc. 

Output

     Output will be graded by running your program.  Each algorithm’s output is 5 points. 

 

Summary

     The summary section should discuss your project experience.  You should discuss how you approached the project, including anything difficult or interesting, what was learned, and the end result.   This should be at least 1 page in length.          

 

II.  Project Description

 

Language/Platform/Approach

This project must target a Unix platform and execute properly on our CS1 server.

The project must be written in C, C++, or Java.

 

 

Problem Overview

This project will simulate a scheduler scheduling a set of jobs.

The project will allow the user to choose a scheduling algorithm from among the six presented in the textbook.  It will output a representation of how the jobs are executed.

Design

You may design your own implementation approach, but here are a few constraints. 

Your program should read in a list of jobs from a tab-delimited text file named jobs.txt.  The format of the text file should have one line for each job, where each line has a job name, a start time and a duration.  The job name must be a letter from A-Z.  The first job should be named A, and the remaining jobs should be named sequentially following the alphabet, so if there are five jobs, they are named A-E.  The arrival times of these jobs should be in order, with the first job arriving at time zero. 

The scheduler choice should be a command-line parameter that is one of the following:  FCFS, RR, SPN, SRT, HRRN, FB, ALL.  If ALL is input, the program should produce output for all six scheduling algorithms.  RR and FB should use a quantum of one.  FB should use three queues.  If more than one job may run next, choose the one with the lowest job name.

 

Your output should be a graph as shown in the slides.  The graph can be text or you can use a graphics package such as JavaFX to draw the graph.  For text, you may draw the graph down the page rather than across.

 

Your program should be able to reproduce the sample shown in the book as well as any similar set of jobs.

Sample Output

Below is sample text-based output.  For graphical output, you can make the graph look like the ones in the textbook and slides. 

FCFS

 

A  XXX

B           XXXXXX

C                             XXXX 

D                                        XXXXX

E                                                       XX

 

FCFS (this is another way you may print the output instead of the one above)

A B C D E

X
X
X

   X
   X
   X
   X
   X
   X

      X

      X

      X

      X

         X

         X

         X

         X

         X

            X

            X

III. Project Guidelines

Submitting

Submit your project on eLearning.  Include in your submission the following files:

 

  • txt. A readme file describing how to compile and run your project

  • doc A Word document for the summary

  • Your source files

 

Academic Honesty

All work must be your own.  If cheating is suspected, you will be referred to the Judicial Affairs Office for further discussion.  Copying may be detected in a number of ways, including by software which compares your code with all other students’ source code, by comparison with code on the Internet, or by a visual inspection of your source code.

Resources

The slides and textbook describe the six algorithms to be used. 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

919 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

826 Answers

Hire Me
expert
Husnain SaeedComputer science

759 Answers

Hire Me
expert
Atharva PatilComputer science

976 Answers

Hire Me
July
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30