Document Details

Document Type : Article In Conference 
Document Title :
Hardware Fault-Tolerant Scheduling Algorithms
خوارزميات مستامحة مع الأخطاء لجدولة المكونات المادية
 
Document Language : English 
Abstract : In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient hardware fault-tolerant technique called the Hardware Fault-Tolerant (HFT) technique, where processors and communication channels are subject to failures. Also, we have studied the effect of the HFT technique on the reliability of a task.In this work, we propose three hardware fault-tolerant scheduling algorithms called the Hardware Fault-Tolerant (FCFS + Smallest Fits First) (FCFSSFF) scheduling algorithm, Hardware Fault-Tolerant (FCFS + Largest Fits First) (FCFSLFF) scheduling algorithm, and Hardware Fault-Tolerant (FCFS + First Fits First) (FCFSFFF) scheduling algorithm. These algorithms are based on the dynamic group maximum matching concept and the HFT technique 
Conference Name : Proc. 15th National Computer Conference 
Duration : From : 16/7/1418 AH - To : 18/7/1418 AH
From : 17/11/1997 AD - To : 19/11/1997 AD 
Publishing Year : 1418 AH
1997 AD 
Number Of Pages : 00 
Article Type : Article 
Conference Place : Dhahran, Saudi Arabia 
Added Date : Sunday, June 24, 2012 

Researchers

Researcher Name (Arabic)Researcher Name (English)Researcher TypeDr GradeEmail
اسامه احمد ابوالنجاAbulnaja, Osama AhmadInvestigator abulnaja@kau.edu.sa
Hosseini VairavanVairavan, Hosseini Researcher  

Files

File NameTypeDescription
 33744.pdf pdf 

Back To Researches Page