GitHub - alaaalagami/OS-Schedulers-and-Memory-Allocation: This is a C simulation of the Highest Priority First, Shortest Job First, Round Robin, and Shortest Remaining Time Next scheduling algorithm and a Buddy Memory Allocation algorithm.

alaaalagami / OS-Schedulers-and-Memory-Allocation Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This is a C simulation of the Highest Priority First, Shortest Job First, Round Robin, and Shortest Remaining Time Next scheduling algorithm and a Buddy Memory Allocation algorithm.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 9 Commits
Makefile		Makefile
README		README
clk.c		clk.c
data_structures.h		data_structures.h
headers.h		headers.h
my.txt		my.txt
process.c		process.c
process_generator.c		process_generator.c
processes.txt		processes.txt
scheduler.c		scheduler.c
test_generator.c		test_generator.c

Repository files navigation

## headers.h contains clk functions, it should be included anywhere the clock functions are used.

## To get time call:

getClk();

## You can use Makefile to build and run your project

# To compile your project, use the command:
make

# To run your project, use the command:
make run

# If you added a file to your project add it to the build section in the Makefile

# Always start the line with a tab in Makefile, it is its syntax

About

This is a C simulation of the Highest Priority First, Shortest Job First, Round Robin, and Shortest Remaining Time Next scheduling algorithm and a Buddy Memory Allocation algorithm.

Readme

Activity

0 stars

1 watching

0 forks

Report repository