Ref Video:
vid1.mov
Do check out my article: Enhancing Scalability and Efficiency in Job Scheduling - Shortest Job First Algorithm
This project implements the Shortest Job First (SJF) scheduling algorithm as a backend service using Go. It provides a complete CRUD interface for managing jobs in the queue, prioritizing them according to their execution time.
- CRUD Operations: Create, Read, Update, and Delete jobs in the scheduler.
- Priority Scheduling: Automatically prioritizes jobs based on their execution time.
- Concurrency Handling: Efficiently manages concurrent job submissions and processing.
- RESTful API: Easy to use REST API for interacting with the scheduler.
Follow these instructions to get the project up and running on your local machine for development and testing purposes.
- Go (version 1.19)
- MongoDB
- Clone the repository:
git clone [email protected]:DaZZler12/sjf-be.git# SJF-BE: Shortest Job First Scheduler in Go
This project implements the Shortest Job First (SJF) scheduling algorithm as a backend service using Go. It provides a complete CRUD interface for managing jobs in the queue, prioritizing them according to their execution time.
## Features
- **CRUD Operations**: Create, Read, Update, and Delete jobs in the scheduler.
- **Priority Scheduling**: Automatically prioritizes jobs based on their execution time.
- **Concurrency Handling**: Efficiently manages concurrent job submissions and processing.
- **RESTful API**: Easy to use REST API for interacting with the scheduler.
## Getting Started
Follow these instructions to get the project up and running on your local machine for development and testing purposes.
### Prerequisites
- Go (version 1.19)
- MongoDB
### Installation
1. Clone the repository:
```bash
git clone [email protected]:DaZZler12/sjf-be.git