Meeting Deadlines Cheaply
Real-Time Systems（2011）
摘要
We develop a computational framework for solving the problem of finding the cheapest configuration (in terms of the number of processors and their respective speeds) of a multiprocessor architecture on which a task graph can be scheduled within a given deadline. We then extend the problem in three orthogonal directions: taking communication volume into account, considering the case where a stream of instances of the task graph arrives periodically and reformulating the problem as a bi-criteria optimization for which we approximate the Pareto front.
更多查看译文
关键词
orthogonal direction,pareto front,computational framework,cheapest configuration,task graph,multiprocessor architecture,respective speed,communication volume,deadlines cheaply,bi-criteria optimization,encoding,task analysis,scheduling,schedules,graph theory,computer architecture
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要