Fault Tolerance in Real Time Multiprocessors - Embedded Systems

Details Fault Tolerance in Real Time Multiprocessors - Embedded Systems Fault Tolerance in Real Time Multiprocessors - Embedded Systems

2010-01-21

arxiv.org/abs/1001.3727v1

Fourth Innovative Conference on Embedded Systems, Mobile Communication and Computing, 2009

Computer Science

Operating Systems

4 pages

Scientific paper

All real time tasks which are termed as critical tasks by nature have to complete its execution before its deadline, even in presence of faults. The most popularly used real time task assignment algorithms are First Fit (FF), Best Fit (BF), Bin Packing (BP).The common task scheduling algorithms are Rate Monotonic (RM), Earliest Deadline First (EDF) etc.All the current approaches deal with either fault tolerance or criticality in real time. In this paper we have proposed an integrated approach with a new algorithm, called SASA (Sorting And Sequential Assignment) which maps the real time task assignment with task schedule and fault tolerance

Affiliated with

Also associated with

No associations

Rating

Fault Tolerance in Real Time Multiprocessors - Embedded Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fault Tolerance in Real Time Multiprocessors - Embedded Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fault Tolerance in Real Time Multiprocessors - Embedded Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248772