A novel task scheduling for heterogeneous systems

Authors:
XuePing Ren;Jian Wan;GuangHuan Hu
Affiliations:
Software School, Hangzhou Dianzi University, Hanghzhou, China;Software School, Hangzhou Dianzi University, Hanghzhou, China;College of Computer Science, Zhejiang University, Hanghzhou, China
Venue:
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
Year:
2004

Citing 5
Cited 0

Task Allocation for Maximizing Reliability of Distributed Computer Systems

IEEE Transactions on Computers
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Task Scheduling Algorithms for Heterogeneous Processors

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop

Quantified Score

Hi-index	0.01

Visualization

Abstract

Heterogeneous computing environments have been widely used in real-time embedded systems. Efficient task scheduling is essential for achieving reliability in embedded systems. In this paper, an algorithm called the Real and Reliable Scheduling (RRTS) has been proposed to improve the system reliability. The RRTS algorithm is achieved by applying a reliability model to a List Scheduling algorithm. The algorithm firstly calculates Earliest-Finish-Times (EFTs) and reliability costs of a task in every processor. Then the minimum EFT is selected. Finally, the task is scheduled to a processor according to the EFT and reliability costs. The experimental results and examples show that the algorithm can improve system reliability significantly while maintaining high performance.