Analysis of Liveline Addition as the New Time Constraint and the Earliest Deadline Earliest Liveline First (EDELF) Algorithm in Real Time System

The conventional model of real-time system cannot solve a problem when tasks come earlier than their earliest response time. Fazmah Arif Yulianto solved this problem by purposing a different model which has liveline as new time constraint. This new algorithm is called Earliest Deadline Earliest Liveline First-Fazmah (EDELF-F) which is developed based on EDF-DM algorithm. Then to determine the ability of the algorithm, the comparison between EDELF-F with conventional algorithms EDF (Earliest Deadline First) was performed with 3 scenarios: period > deadline, period = deadline and period < deadline for 10 tasks. After simulated, EDELF-F algorithm has a weakness in order to satisfy task's period. Author has modified EDELF algorithm (called EDELF-S) which is developed based on EDF-C algorithm to overcome weakness of EDELF-F algorithm. This EDELF-S has better response time and feasibility and also can solve the problem related to earliest response time. Both EDELF-F and EDELF-S can solve every case which can be solved by EDF but not vice versa. Both EDELF-F and EDELF-S also has a better feasibility than EDF.