PLEASE USE PTHREADS Write a program in C using PTHREADSthat will simulate the operations of the following Batch scheduling algorithms: PLease use Pthreads First-Come, First-Served Shortest Job First Your Program will implement threads for each algorithm plus the main thread. A linked list will be used to represent the list of jobs available to run. Each node will represent a Job with the following information: int PID Process ID int time; The time needed on CPU to finish executing Main thread: Your main code will request the user to input a list of jobs, and to fill the information in each job node until a sentinel value is reached, each data item will be stored in a separate node. Starts the FCFS thread, followed by SJF thread. Wait for both threads to finish before exiting. FCFS thread: The thread will simulate the First-Come, First-Served algorithm. Displays the data in a list in the order they were inserted. SJF thread: The thread will simulate the Shortest Job First algorithm. The thread will compare which job should run depending on the value of time inside the nodes. Display nodes according to the shortest job first order. You can remove nodes from the list after your display. Here is the sample output: Enter an ID and a value for a node to add to the list, Enter -1 to stop: 1 200 Enter an ID and a value for a node to add to the list, Enter -1 to stop: 2 30 Enter an ID and a value for a node to add to the list, Enter -1 to stop: 4 300 Enter an ID and a value for a node to add to the list, Enter -1 to stop: -1 -1 FCFS Job order: FCFS Jobs will be executed in the order they arrived: Linked List Contain the following values : Node ID 1 with value 200 Node ID 2 with value 30 Node ID 4 with value 300 FCFS Done SJF Jobs Order: Shortest Job to Run next is with ID: 2 and Time 30 Shortest Job to Run next is with ID: 1 and Time 200 Shortest Job to Run next is with ID: 4 and Time 300 SJF : All Jobs Completed All Threads complete

PLEASE USE PTHREADS Write a program in C using PTHREADSthat will simulate the operations of the following Batch scheduling algorithms: PLease use Pthreads First-Come, First-Served Shortest Job First Your Program will implement threads for each algorithm plus the main thread. A linked list will be used to represent the list of jobs available to run. Each node will represent a Job with the following information: int PID Process ID int time; The time needed on CPU to finish executing Main thread: Your main code will request the user to input a list of jobs, and to fill the information in each job node until a sentinel value is reached, each data item will be stored in a separate node. Starts the FCFS thread, followed by SJF thread. Wait for both threads to finish before exiting. FCFS thread: The thread will simulate the First-Come, First-Served algorithm. Displays the data in a list in the order they were inserted. SJF thread: The thread will simulate the Shortest Job First algorithm. The thread will compare which job should run depending on the value of time inside the nodes. Display nodes according to the shortest job first order. You can remove nodes from the list after your display. Here is the sample output: Enter an ID and a value for a node to add to the list, Enter -1 to stop: 1 200 Enter an ID and a value for a node to add to the list, Enter -1 to stop: 2 30 Enter an ID and a value for a node to add to the list, Enter -1 to stop: 4 300 Enter an ID and a value for a node to add to the list, Enter -1 to stop: -1 -1 FCFS Job order: FCFS Jobs will be executed in the order they arrived: Linked List Contain the following values : Node ID 1 with value 200 Node ID 2 with value 30 Node ID 4 with value 300 FCFS Done SJF Jobs Order: Shortest Job to Run next is with ID: 2 and Time 30 Shortest Job to Run next is with ID: 1 and Time 200 Shortest Job to Run next is with ID: 4 and Time 300 SJF : All Jobs Completed All Threads complete

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Main thread:

- Your main code will request the user to input a list of jobs, and to fill the information in each job node until a sentinel value is reached, each data item will be stored in a separate node.
- Starts the FCFS thread, followed by SJF thread.
- Wait for both threads to finish before exiting.

FCFS thread:

- The thread will simulate the First-Come, First-Served algorithm.
- Displays the data in a list in the order they were inserted.

SJF thread:

- The thread will simulate the Shortest Job First algorithm.
- The thread will compare which job should run depending on the value of time inside the nodes.
- Display nodes according to the shortest job first order.
- You can remove nodes from the list after your display.

Here is the sample output:

Enter an ID and a value for a node to add to the list, Enter -1 to stop: 1 200

Enter an ID and a value for a node to add to the list, Enter -1 to stop: 2 30

Enter an ID and a value for a node to add to the list, Enter -1 to stop: 4 300

Enter an ID and a value for a node to add to the list, Enter -1 to stop: -1 -1

FCFS Job order:

FCFS Jobs will be executed in the order they arrived:

Linked List Contain the following values :

Node ID 1 with value 200

Node ID 2 with value 30

Node ID 4 with value 300

FCFS Done