loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1997 Workshop on Engineering of Computer-Based Systems (ECBS '97)
Fault tolerant computing in computational field model
Monterey, CA
March 24-March 28
ISBN: 0-8186-7889-5
M. Uehara, Dept. of Inf. & Comput. Sci., Toyo Univ., Saitama, Japan
In large scale distributed systems, fault tolerant computing is important because each module may not be always reliable. Fault tolerant computing is not essentially needed to solve a problem. However, it is useful to execute a computing correctly. In this paper, we propose the usage of computational field model (CFM) as a framework to reuse such computing. Computational field is shared virtual space which abstracts distributed systems. It is possible to construct portable applications by applying algorithms to CFM. At first, we employ Triple Module Redundancy (TMR) as basic technique for fault tolerant computing in order to support real-time applications. Next, we assume the locality of fault occasion. For an example, physical crash causes faults locally. In such a case, each module should be distributed to increase system reliability. However, when they are distributed, system performance may be decreased because communication cost is increased. Thus, fault tolerance is related to system performance. In our approach, it is possible to accomplish both resource allocation and fault tolerant computing at the same time.
Index Terms:
fault tolerant computing; fault tolerant computing; computational field model; large scale distributed systems; shared virtual space; triple module redundancy; system performance; resource allocation
Citation:
M. Uehara, "Fault tolerant computing in computational field model," ecbs, pp.34, 1997 Workshop on Engineering of Computer-Based Systems (ECBS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.