Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3m/4=0.75m for m processors. ,  disprove this conjecture and show that the utilization bound of EDZL is no greater than m(1-1/e)~0.6321m, where e~2.718 is the Euler's number.
['Y. H. Chao', 'Shun Shii Lin', 'Kwei Jay Lin']
I am writing a research paper on a idea Schedulability issues for EDZL scheduling on real-time multiprocessor systems
[{"from": "human", "value": "I am writing a research paper on a idea Schedulability issues for EDZL scheduling on real-time multiprocessor systems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3m/4=0.75m for m processors. ,  disprove this conjecture and show that the utilization bound of EDZL is no greater than m(1-1/e)~0.6321m, where e~2.718 is the Euler's number."}]