System aimed to streamline the allocation of tasks across a network of nodes, optimizing resource utilization, and minimizing task execution latency.
The Distributed Task Scheduler System is a dynamic solution designed to optimize the distribution of computational tasks across a network of nodes. My primary focus with this project is to schedule and prioritizing tasks, managing resources, and resolving dependencies, ensuring a seamless and efficient computational experience.
The system serves as a robust foundation for any distributed computing environment, ensuring optimal task execution, minimized resource wastage, and maximized throughput. The modular design promises easy integration of future enhancements, catering to evolving computational needs.
- Dynamic Task Management: Uses priority queues to ensure tasks with higher priorities are executed first.
- Resource Allocation: Checks computational nodes for available CPU cores and memory before task dispatch.
- Dependency Resolution: Sophisticated system to ensure tasks are executed in the correct order based on dependencies.
- Introducing multithreading for concurrent task processing.
- Dynamic resource rebalancing.
- Support for intricate task relationship structures.
- Performance analytics dashboard.
- C++ Compiler (Recommend GCC or Clang)
- Standard Template Library (STL)
-
Clone the repository:
git clone https://github.com/san-deep-reddy/distributed-task-scheduler -
Navigate to the project directory and compile:
g++ -o scheduler main.cpp -
After successful compilation, run the binary
./scheduler --help
This project is licensed under the MIT License. See the LICENSE.md file for details.