An Availability Approached Task Scheduling Algorithm in Heterogeneous Fault-Tolerant System

被引:2
作者
Sun, Jian [1 ]
Dong, Xiaoshe [1 ]
Zhang, Xingjun [1 ]
Wang, Yinfeng [2 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Shanxi Province, Peoples R China
[2] Shenzhen Inst Informat Technol, Shenzhen, Guangdong, Peoples R China
来源
2014 9TH IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE, AND STORAGE (NAS) | 2014年
关键词
availability; scheduling; heterogeneous; fault-tolerant system; REAL-TIME TASKS;
D O I
10.1109/NAS.2014.47
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In heterogeneous fault-tolerant system, especially high performance computer system, the issue of providing system with high availability assurance for real-time applications which have availability requirements has been widespread concerned. While, few research concentrates on combining real-time application availability requirement with scheduling algorithm. In this paper, an availability approached task scheduling algorithm is proposed. On the basis of heterogeneous fault-tolerant system scheduler and scheduling algorithm designation, we can improve the system availability without increasing additional hardware costs, and shorten task average response time, in addition, schedule task with high efficiency and reliability. Experiment results show that, such availability approached task scheduling algorithm has a system performance advantage over the traditional system task scheduling algorithms, it achieves the goal of balancing availability and task response time in heterogeneous fault-tolerant system, thus improve the system availability.
引用
收藏
页码:275 / 280
页数:6
相关论文
共 24 条
[1]  
ABMOLD O A, 1978, PROBABILITY STAT QUE
[2]  
Apon A, 2003, IEEE INT PAR DISTR P, P201
[3]  
Aysan H., 2011, 2011 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, P281, DOI 10.1109/ISORCW.2011.34
[4]   Rate-monotonic scheduling on uniform multiprocessors [J].
Baruah, SK ;
Goossens, J .
IEEE TRANSACTIONS ON COMPUTERS, 2003, 52 (07) :966-970
[5]   A technique for adaptive scheduling of soft real-time tasks [J].
Beccari, G ;
Caselli, S ;
Zanichelli, F .
REAL-TIME SYSTEMS, 2005, 30 (03) :187-215
[6]   Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments [J].
Boyer, WF ;
Hura, GS .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (09) :1035-1046
[7]   A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems [J].
Braun, TD ;
Siegel, HJ ;
Beck, N ;
Bölöni, LL ;
Maheswaran, M ;
Reuther, AI ;
Robertson, JP ;
Theys, MD ;
Yao, B ;
Hensgen, D ;
Freund, RF .
(HCW '99) - EIGHTH HETEROGENEOUS COMPUTING WORKSHOP, PROCEEDINGS, 1999, :15-29
[8]  
Li Wen-jie, 2005, Acta Electronica Sinica, V33, P577
[9]   A non-preemptive scheduling algorithm for soft real-time systems [J].
Li, Wenming ;
Kavi, Krishna ;
Akl, Robert .
COMPUTERS & ELECTRICAL ENGINEERING, 2007, 33 (01) :12-29
[10]  
Luo W, 2006, LECT NOTES COMPUT SC, V4158, P571