{"id":26745494,"url":"https://github.com/devroopsaha744/elevate","last_synced_at":"2025-03-28T08:17:26.747Z","repository":{"id":253827788,"uuid":"844656702","full_name":"devroopsaha744/Elevate","owner":"devroopsaha744","description":"This project implements and visualizes various disk scheduling algorithms using the analogy of elevators in a building. The primary algorithms include FCFS, SSTF, SCAN, LOOK, and their circular versions.","archived":false,"fork":false,"pushed_at":"2024-09-14T10:46:33.000Z","size":7678,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-09-15T19:42:14.480Z","etag":null,"topics":["algorithms","computer-science","disk-scheduling-algorithms","low-level-programming","operating-systems"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/devroopsaha744.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-08-19T17:50:45.000Z","updated_at":"2024-09-14T10:46:36.000Z","dependencies_parsed_at":"2024-09-14T19:39:46.829Z","dependency_job_id":"665f3999-4167-4edc-8473-9d926b497182","html_url":"https://github.com/devroopsaha744/Elevate","commit_stats":null,"previous_names":["devroopsaha744/elevaate"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devroopsaha744%2FElevate","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devroopsaha744%2FElevate/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devroopsaha744%2FElevate/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devroopsaha744%2FElevate/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/devroopsaha744","download_url":"https://codeload.github.com/devroopsaha744/Elevate/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245991566,"owners_count":20706129,"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","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":["algorithms","computer-science","disk-scheduling-algorithms","low-level-programming","operating-systems"],"created_at":"2025-03-28T08:17:26.184Z","updated_at":"2025-03-28T08:17:26.736Z","avatar_url":"https://github.com/devroopsaha744.png","language":"Jupyter Notebook","readme":"# Elevate\n\nThis project implements and visualizes various disk scheduling algorithms using the analogy of elevators in a building. The primary algorithms include FCFS, SSTF, SCAN, LOOK, and their circular versions. By treating each request as a floor in a building, we demonstrate how these scheduling algorithms optimize the movement of the elevator (or disk head) to minimize the total distance traveled and improve efficiency.\n\n## Table of Contents\n\n- [Introduction](#introduction)\n- [Algorithms](#algorithms)\n  - [FCFS (First-Come, First-Served)](#fcfs-first-come-first-served)\n  - [SSTF (Shortest Seek Time First)](#sstf-shortest-seek-time-first)\n  - [SCAN](#scan)\n  - [LOOK](#look)\n  - [C-SCAN](#c-scan)\n  - [C-LOOK](#c-look)\n- [Metrics](#metrics)\n  - [Total Distance Traveled](#total-distance-traveled)\n  - [Average Seek Time](#average-seek-time)\n- [Installation](#installation)\n- [Usage](#usage)\n- [Visualization](#visualization)\n- [Read More](#read-more)\n- [Contributing](#contributing)\n- [License](#license)\n\n## Introduction\n\nElevator algorithms help us understand how disk scheduling works in operating systems. This project simplifies these concepts by using a relatable analogy: elevators in a building. The project simulates how different scheduling algorithms like FCFS, SSTF, SCAN, LOOK, and their circular counterparts behave in an elevator system when servicing requests for different floors.\n\n## Algorithms\n\n### FCFS (First-Come, First-Served)\nThe elevator handles requests in the exact order they arrive, leading to potential inefficiencies if requests are far apart.\n\n### SSTF (Shortest Seek Time First)\nThe elevator moves to the nearest floor requested from its current position, optimizing for minimal travel distance between stops.\n\n### SCAN\nThe elevator moves in one direction, servicing requests, and then reverses direction once it hits the end of its range, ensuring that all requests are handled.\n\n### LOOK\nAn optimized version of SCAN, where the elevator moves in one direction but only goes as far as the furthest request, avoiding unnecessary movement to the building's limits.\n\n### C-SCAN\nSimilar to SCAN, but after reaching the highest requested floor, the elevator jumps back to the start (lowest floor) and continues in the same direction.\n\n### C-LOOK\nAn optimized circular version of LOOK, where the elevator moves in one direction, services all requests, and jumps back to the first requested floor without traveling to extremes.\n\n## Metrics\n\n### Total Distance Traveled\nThe total number of floors traveled by the elevator while servicing all requests.\n\n### Average Seek Time\nThe average number of floors between requests, provides an efficiency metric for each algorithm.\n\n\n## Usage\n\n1. **Clone the repository**:\n    ```bash\n    git clone https://github.com/devroopsaha744/Elevate.git\n    cd Elevate\n    ```\n\n2. **Analyze the Algorithms**:\n   - Navigate to the `analysis` folder to explore detailed analysis of the algorithms.\n   - Open `analysis/analysis.ipynb` using Jupyter Notebook to examine the code and visualizations of various metrics like total distance traveled and average seek time.\n   \n3. **View Plots**:\n   - Inside the `analysis/plots` folder, you'll find visual representations of how each algorithm performs, helping you understand their efficiency in terms of distance and time.\n\n4. **Explore Algorithm Logic**:\n   - The `logic` folder contains the code for each scheduling algorithm. This is where you can dive into how FCFS, SSTF, SCAN, LOOK, and their variations are implemented.\n\n5. **Watch Simulations**:\n   - In the `animations` folder, you'll find simulation videos demonstrating how the elevator moves according to each algorithm, offering a visual representation of the algorithms in action.\n\n6. **Manim Visualizations**:\n   - The `visualization` folder contains the Manim code used to generate the elevator scheduling animations. You can run the Manim scripts to create custom visualizations or tweak them according to your needs.\n\n---\n\n\n\n## Read More\n\nFor a deeper understanding of these algorithms and their real-world implications, check out my Medium article:\n\n[From Disks to Elevators: Applying Scheduling Algorithms for Optimal Movement](https://medium.com/@datafreakai/from-disks-to-elevators-applying-scheduling-algorithms-for-optimal-movement-8784fa0ea9e8)\n\n## Contributing\n\nContributions are welcome! Please submit a pull request or open an issue if you'd like to improve the project or add new features.\n\n## License\n\nThis project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevroopsaha744%2Felevate","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdevroopsaha744%2Felevate","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevroopsaha744%2Felevate/lists"}