{"id":25505159,"url":"https://github.com/nihalrt/responsive-queues","last_synced_at":"2025-10-28T02:15:42.149Z","repository":{"id":203144896,"uuid":"684703702","full_name":"Nihalrt/Responsive-Queues","owner":"Nihalrt","description":"Created a c program that runs different tasks in 3 different queues having distinct quantum times. The scheduling is preemptive provided that the current task's remaining burst time is less than that of the new task. Additionally, implemented a boosting mechanism which prevents tasks from waiting indefinitely (starvation).","archived":false,"fork":false,"pushed_at":"2023-12-30T13:54:27.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-20T00:11:29.598Z","etag":null,"topics":["c","cpu-scheduling"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Nihalrt.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2023-08-29T17:21:41.000Z","updated_at":"2023-12-30T13:54:00.000Z","dependencies_parsed_at":"2023-12-30T14:46:28.002Z","dependency_job_id":null,"html_url":"https://github.com/Nihalrt/Responsive-Queues","commit_stats":null,"previous_names":["nihalrt/multilevel-feedback-queue-cpu-scheduling","nihalrt/responsive-queues"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Nihalrt/Responsive-Queues","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Nihalrt%2FResponsive-Queues","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Nihalrt%2FResponsive-Queues/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Nihalrt%2FResponsive-Queues/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Nihalrt%2FResponsive-Queues/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Nihalrt","download_url":"https://codeload.github.com/Nihalrt/Responsive-Queues/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Nihalrt%2FResponsive-Queues/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":281371821,"owners_count":26489535,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-28T02:00:06.022Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c","cpu-scheduling"],"created_at":"2025-02-19T05:58:50.010Z","updated_at":"2025-10-28T02:15:42.103Z","avatar_url":"https://github.com/Nihalrt.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Responsive Queues\n\n## Overview\nThe `mlfq.c` file is an implementation of a Multi-Level Feedback Queue (MLFQ) scheduling algorithm with round-robin scheduling. This program reads a set of instructions from an input file and simulates the scheduling of tasks among multiple queues with varying priorities.\n\n## Table of Contents\n- [Introduction](#introduction)\n- [Usage](#usage)\n- [Implementation Details](#implementation-details)\n- [Compiling the Code](#compiling-the-code)\n- [Running the Program](#running-the-program)\n- [Sample Input File](#sample-input-file)\n- [Sample Output](#sample-output)\n\n## Introduction\nThe Multi-Level Feedback Queue (MLFQ) is a popular scheduling algorithm that divides tasks into multiple priority queues. Each queue has a different priority level, and tasks move between queues based on their behavior. In this implementation, we use three priority queues with different time quantum values for each queue.\n\n## Usage\nTo use this program, follow these steps:\n\n1. **Compile the Code**: Compile the `mlfq.c` code to create an executable.\n2. **Create an Input File**: Prepare an input file containing a list of instructions for task scheduling.\n3. **Run the Program**: Execute the compiled program with the input file as an argument.\n4. **View Output**: The program will display the scheduling actions and the status of tasks at each clock tick.\n5. **Round Robin Principle**:  in a scheduling algorithm that distributes work evenly among all available resources.\n\n## Implementation Details\n- The program simulates task scheduling based on the instructions in the input file.\n- Tasks are categorized into three priority queues (queues 1, 2, and 3), with decreasing priority.\n- The time quantum for each queue is defined by the `QUEUE_TIME_QUANTUMS` array.\n- A boost operation is performed periodically to move tasks from lower-priority queues to higher-priority queues.\n- The program tracks waiting time and execution time for each task to calculate turnaround time.\n- The scheduler selects the task with the highest priority for execution.\n- The code handles task arrivals, terminations, and bursts, updating task information accordingly.\n\n## Compiling the Code\nCompile the `mlfq.c` code using a C compiler (e.g., GCC) with the following command:\n```shell\ngcc -o mlfq mlfq.c\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnihalrt%2Fresponsive-queues","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnihalrt%2Fresponsive-queues","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnihalrt%2Fresponsive-queues/lists"}