Skip to content

The **JobSchedulerProject** simulates job allocation on 128 worker nodes, each with 24 cores and 64GB memory. It reads job data from a file, applies queueing (Smallest Job First or Shortest Duration First) and allocation (First Fit, Best Fit, Worst Fit) policies, and outputs results in CSV format.

Notifications You must be signed in to change notification settings

raunak0400/Job-Scheduler-Project

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

📅 Job Scheduler Project

🔎 Overview

An efficient C++ project simulating job scheduling with various policies like Smallest Job First and Best Fit. This project demonstrates job loading from files, scheduling algorithms, and result storage for analysis.

🌟 Key Features

  • Load jobs dynamically from text files
  • Apply multiple scheduling policies
  • Save output results into CSV format
  • Modular and easily extendable design

📊 Results Highlight

  • Job distribution analysis
  • Policy-wise job scheduling performance
  • Easy CSV output for visual analysis

⚙ Technical Implementation

Core Components

  • File I/O for job loading
  • Scheduling algorithms: SmallestJobFirst, BestFit
  • CSV output handling
  • Clean, efficient C++ structure

Technology Stack

  • Language: C++
  • Data Format: CSV and TXT

🚀 Performance

  • Handles large job corpuses quickly
  • Policy simulations with reliable output

📁 Directory Structure Diagram

JobSchedulerProject/
│
├── main.cpp
├── JobArrival.txt
├── Results.csv
└── README.md

🧩 Code Snippets

Example Job Loading:

scheduler.loadJobs("JobArrival.txt");

Example Scheduling Simulation:

scheduler.simulateScheduling("SmallestJobFirst", "BestFit");

Saving Output:

scheduler.saveResultsToCSV("Results.csv");

🏁 Getting Started

  1. Clone the repository
  2. Add job data in JobArrival.txt
  3. Compile the C++ code
  4. Run the executable

📤 Output Files

  • Results.csv: Stores scheduled job outputs

🔭 Future Scope

  • Add priority-based policies
  • UI-based job scheduling simulation

📚 Acknowledgments

Special thanks to:

  • The professors and guides
  • My academic mentors and peers

___________________________________________________

Created with ❤️ By a passionate Programmer

RAUNAK KUMAR JHA

About

The **JobSchedulerProject** simulates job allocation on 128 worker nodes, each with 24 cores and 64GB memory. It reads job data from a file, applies queueing (Smallest Job First or Shortest Duration First) and allocation (First Fit, Best Fit, Worst Fit) policies, and outputs results in CSV format.

Resources

Stars

Watchers

Forks

Languages