With the explosive growth of WWW applications on the Internet, users are experiencing access delays more often than ever. Recent studies showed that pre-fetching could alleviate the WWW latency to a larger extent than caching. Existing pre-fetching methods are mostly based on URL graphs. They use the graphical nature of hypertext links to determine the possible paths through a hypertext system....

We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number of memory faults. In particular, we design an O(n log n) time sorting algorithm that can optimally tolerate up to O( √ n log n ) memory faults....

In this paper we study the ability of array-based networks to tolerate worst-case faults. We show that an N N two-dimensional array can sustain N 1? worst-case faults, for any xed > 0, and still emulate a fully functioning N N array with only constant slowdown. Previously it was known only that an array could tolerate a constant number of faults with constant slowdown. We also show that if faul...

background: deep vein thrombosis is an important cause of morbidity and mortality. however, its association with adenomatous polyposis coli is extremely rare. here we present an interesting case of deep vein thrombosis associated with adenomatous polyposis coli. case presentation: a 15 year old female who was having fever and diarrhea for 5 months developed bilateral asymmetric painful swelling...

This paper examines how software based fault tolerant computing approach through triplicate redundancy and recovery. This approach is not intended to tolerate the software design bugs. It is intended to tolerate various environmental faults during the execution time of a computercontrolled system. Application data corruption due to electrical transients is detected and recovered to control the ...

This article investigates a mechanism to tolerate omission failure in moving sequencer based atomic broadcast at distributed systems. Various mechanisms are already given for moving sequencer based atomic broadcast like RMP [1], DTP [2], Pin Wheel [3] and mechanism proposed by [4]. But none of these mechanisms are efficient to tolerate different failure. Scholarly observation is that, these alg...

Due to the difference in implementing network topologies in the optical and electronic domain, schemes to tolerate link failures in electronic implementations may not be ‘the most efficient ones for optical implementations of multiprocessor networks. Rerouting messages along alternate paths in the network topology is commonly used in electronically implemented networks to tolerate link failures...

This article investigates a mechanism to tolerate malicious nature of sequencer in moving sequencer based atomic broadcast in distributed systems. Various mechanisms are already given for moving sequencer based atomic broadcast like RMP [1], DTP [2], Pin Wheel [3] and mechanism proposed by Srivastava et al. [4]. But none of these mechanisms are efficient to tolerate different failure. Scholarly...