Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of feasibility analysis of asynchronous periodic task sets, where tasks can have an initial offset, is known to be co-NP-complete in the strong sense. A sufficient pseudo-polynomial test has been proposed by Baruah, Holl and Rosier, which consists in analyzing the feasibility of the corresponding synchronous task set (i.e. all offsets are set equal to 0). If the test gives a positive result, then the original asynchronous task set is feasible; else, no definitive ansr can be given. In many cases, this sufficient test is too pessimistic, i.e. it gives no response for many feasible task sets.#R##N##R##N#,  present a new sufficient pseudo-polynomial test for asynchronous periodic task sets. Our test reduces the pessimism by explicitely considering the offsets in deriving a small set of critical arrival patterns.  show, trough a set of extensive simulations, that our test outperforms the previous sufficient test.
['Rodolfo Pellizzoni', 'Giuseppe Lipari']
I am writing a research paper on a idea Feasibility Analysis of Real-Time Periodic Tasks with Offsets
[{"from": "human", "value": "I am writing a research paper on a idea Feasibility Analysis of Real-Time Periodic Tasks with Offsets"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of feasibility analysis of asynchronous periodic task sets, where tasks can have an initial offset, is known to be co-NP-complete in the strong sense. A sufficient pseudo-polynomial test has been proposed by Baruah, Holl and Rosier, which consists in analyzing the feasibility of the corresponding synchronous task set (i.e. all offsets are set equal to 0). If the test gives a positive result, then the original asynchronous task set is feasible; else, no definitive ansr can be given. In many cases, this sufficient test is too pessimistic, i.e. it gives no response for many feasible task sets.#R##N##R##N#,  present a new sufficient pseudo-polynomial test for asynchronous periodic task sets. Our test reduces the pessimism by explicitely considering the offsets in deriving a small set of critical arrival patterns.  show, trough a set of extensive simulations, that our test outperforms the previous sufficient test."}]