Main Page
About FCIT
History
Strategy
Administration>
Current Administration
Prevouis Administration
Organization Strucutre
Industrial Advisory Board
PhotoAlbum
Lab Guides
Departments
Computer Science
Information Technology
Information Systems
Academics
Bachelor Programs
Graduate Programs
Executive Programs
Academic Calendar
Admission
Bachelor Degree & Transferring
Admission from the Foundation Year
Transferring to the Faculty
Graduate Studies
Graduate Programs
Executive Programs
Scientific Research
Groups and Units
Research Groups
Research Interests
Distinguished Scientists Program
Faculty Journal
Faculty and Staff
Faculty
CS Department
IT Department
IS Department
Staff
Accreditation Integration & Management System (AIM
Development and Quality Unit
Work at FCIT
Capabilities Under the Spotlight
Code of Ethics
Students
Bachelor
ِAcademic Services
Preparatory Year Courses
Students' Guide
Academic Advising
Laboratories and Facilities
Student rights and duties
Graduate
Polices and Regulations
Students' Guide
Student's Handbook
New Student Orientation
Templates of proposals and theses for masters and
Courses
CS Program
IT Program
IS Program
Alumni Registration
Students Activities
Entrepreneurship Club
Cybersecurity Club
Data Science Club
Programming Club
Community
Industrial partnerships
Cisco Academy
Microsoft Academy
Oracle Academy
Files
Researches
Contact Us
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Faculty of Computing and Information Technology
Document Details
Document Type
:
Article In Journal
Document Title
:
EVALUATION OF HFT TECHNIQUE PERFORMANCE USING TASK-SCHEDULING ALGORITHMS
تقييم تأثير نظام الأسلوب المتسامح مع أخطاء المكونات المادية ( HFT) على أداء النظام عن طريق خوارزميات جدولة المهام
Subject
:
Networks
Document Language
:
English
Abstract
:
In earlier work we have introduced an efficient hardware fault-tolerant approach for reliable execution of tasks. The proposed approach called the Hardware Fault-Tolerant (HFT) approach. Also, we have introduced the concept of dynamic group maximum matching, which is used to group nodes of a graph into disjoint groups with different sizes dynamically. Furthermore, we have proposed the Dynamic Group Maximum Matching (DGMM) algorithm for finding the dynamic group maximum matching. In addition, we have proposed several hardware fault-tolerant scheduling algorithms, based on the HFT technique and the DGMM algorithm. In this work, we studied the effect of the HFT technique on system performance for four of the proposed scheduling algorithms. The studied algorithms are: Hardware Fault-Tolerant (FCFS + First Disagreement Graph First + First Started First), Hardware Fault-Tolerant (FCFS + First Fit First + First Disagreement Graph First + First Started First), Hardware Fault-Tolerant (FCFS + First Disagreement Graph First + Largest Group First), and Hardware Fault-Tolerant (FCFS + First Fit First + First Disagreement Graph First + Largest Group First) scheduling algorithms. Two performance metrics were evaluated. The first metric is system mean response time. The second metric is percentage of tasks of a certain type completed.
ISSN
:
0218-2157
Journal Name
:
International Journal of Intelligent Computing and Information Sciences, Faculty of Computer & Infor
Volume
:
4
Issue Number
:
1
Publishing Year
:
1424 AH
2004 AD
Article Type
:
Article
Added Date
:
Sunday, June 24, 2012
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
اسامه احمد ابوالنجا
Abulnaja, Osama Ahmad
Researcher
abulnaja@kau.edu.sa
Files
File Name
Type
Description
33748.pdf
pdf
Back To Researches Page