[NEW ALGORITHM] Earliest Deadline First (EDF):

[khwaishchawla]

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] Earliest Deadline First (EDF):

About:

Propose a new algorithm to be added to the repository
Earliest Deadline First (EDF) is a dynamic real-time scheduling algorithm used primarily in real-time operating systems to manage tasks with specific deadlines. In EDF, the process with the earliest deadline is given the highest priority and is executed first. This approach ensures that processes are completed before their deadlines, making it suitable for systems where tasks must meet strict timing constraints, such as embedded systems and real-time applications.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it