Reliable Cache Architectures and Task Scheduling for Multiprocessor Systems
نویسندگان
چکیده
منابع مشابه
Reliable Cache Architectures and Task Scheduling for Multiprocessor Systems
This paper proposes a task scheduling approach for reliable cache architectures (RCAs) of multiprocessor systems. The RCAs dynamically switch their operation modes for reducing the usage of vulnerable SRAMs under real-time constraints. A mixed integer programming model has been built for minimizing vulnerability under real-time constraints. Experimental results have shown that our task scheduli...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملEfficient Task Scheduling Heuristic for Multiprocessor Systems
The problem of assigning and scheduling parallel job tasks onto multiple processing elements is a complex one and has resulted in numerous heuristics aimed at approximating an optimal solution. A heuristic based on the well known list scheduling is proposed here. Dubbed Rule-List Scheduling (RLS), it compares well against other heuristics when using program total completion time as a metric. In...
متن کاملpre-scheduling and scheduling of task graph on homogeneous multiprocessor systems
task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Electronics
سال: 2008
ISSN: 0916-8524,1745-1353
DOI: 10.1093/ietele/e91-c.4.410