偶发实时的多处理机任务系统的可行性分析
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
摘要：
我们给出了第一个算法，用于测试一组相同处理器上的零星实时的【形】任务的系统的可行性，解决了多处理器实时的【形】调度领域的一个主要开放问题[S.K. Baruah和K. Pruhs，Journal of Scheduling，2009]。我们还调查了相关的概念，可重复性和一个概念，我们称之为在线可行性。最后，我们表明，离散时间的时间表是强大的连续时间的时间表，这回答了另一个开放的问题，在上述调查。
英文摘要：
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
