https://github.com/mahdi-jamil/fcfs-scheduling-algorithm

simulating FCFS algorithm in java using multithreading
https://github.com/mahdi-jamil/fcfs-scheduling-algorithm

fcfs-process-scheduling multithreading simulation

Last synced: 7 days ago
JSON representation

simulating FCFS algorithm in java using multithreading

• Host: GitHub
• URL: https://github.com/mahdi-jamil/fcfs-scheduling-algorithm
• Owner: Mahdi-jamil
• Created: 2023-09-26T16:09:52.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2023-10-02T12:58:32.000Z (over 1 year ago)
• Last Synced: 2024-11-07T06:18:43.800Z (about 2 months ago)
• Topics: fcfs-process-scheduling, multithreading, simulation
• Language: Java
• Homepage:
• Size: 72.3 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# FCFS Scheduling Algorithm Simulator

Simulate the First-Come-First-Serve (FCFS) scheduling algorithm for process management in Java.

## Table of Contents

- [Overview](#overview)

- [Usage](#usage)

- [Example Output](#example-output)

# Overview

This Java program simulates the First-Come-First-Serve (FCFS) scheduling algorithm for process management. FCFS is a non-preemptive scheduling algorithm where processes are executed in the order they arrive in the queue. This program is designed to simulate the real-life behavior of FCFS, meaning it will not provide immediate output but will wait for all processes to finish execution.

## Usage

1. Clone this repository to your local machine.

2. Navigate to the project directory.

3. Change Path in line 36 in MainTest to any file.txt and just Run Main ( Short Method or Do 4,5,6 )

4. Modify the choosen test.txt file to your own processes ( default : Test1.txt )

5. Modify pom.xml to your choosen Test.java file (  default : Test1.java )

6. Run the program using Maven.(mvn clean test or run pom.xml as clean test)

7. Review the program's output.

###  Example Output

```markdown

process 1 arrives

process 3 arrives

process 4 arrives

process 2 arrives

process 5 arrives

terminated with

Pid AT BT   CT     TT     WT

P1  0 4 4675 4675.0 675.0

P2  3 1 10702 7702.0 6702.0

P3  1 2 6676 5676.0 3676.0

P4  2 3 9688 7688.0 4688.0

P5  5 4 14713 9713.0 5713.0

AVG Waiting Time 4290.8

```