[NEW ALGORITHM] Dynamic Priority Scheduling with Aging and Resource Awareness

[surbhisharma004]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name:

[NEW ALGORITHM] Dynamic Priority Scheduling with Aging and Resource Awareness

About:

Propose a new algorithm to be added to the repository
Dynamic Priority Scheduling with Aging and Resource Awareness is a scheduling algorithm that adjusts process priorities dynamically to optimize resource use and reduce process starvation. Each process is assigned a base priority, which is adjusted by adding an aging factor (to increase priority for long-waiting processes) and a resource factor (to give a slight boost to processes needing fewer resources). The scheduler selects the process with the highest effective priority, balancing responsiveness, fairness, and resource efficiency. This approach is well-suited for systems with diverse tasks and varying resource demands.

[surbhisharma004]

@pankaj-bind please assign this issue to me.