Number of faults a system can withstand without repairs

Details Number of faults a system can withstand without repairs Number of faults a system can withstand without repairs

1994-09-19

arxiv.org/abs/math/9409220v1

Mathematics

Combinatorics

10 pages

Scientific paper

We consider the following scheduling problem. A system is composed of $n$ processors drawn from a pool of $N$. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault, but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of $n$ processors. The system operates satisfactorily as long as at most $f$ of the $n$ selected processors are faulty. We exhibit a scheduling strategy allowing the system to operate satisfactorily until approximately $(N/n)f$ faults are reported in the worst case. Our precise bound is tight.

Affiliated with

Also associated with

No associations

Rating

Number of faults a system can withstand without repairs 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 Number of faults a system can withstand without repairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Number of faults a system can withstand without repairs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-255178