Replicated distributed programs

Cooper, Eric C.

doi:10.1145/323647.323635

Cited by 100 publications

(34 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To achieve fault masking of permanent hardware faults, redundant concurrent tasks may be used to carry out the computations (synchronously or asynchronously) [12], [33]. Some approaches use groups of processes executing sequentially [15], [27], while others have the replicas execute in parallel [3], [11], [12].…”

Section: Related Workmentioning

confidence: 99%

“…Such a scheduling policy is equivalent to maintaining a task queue, Q, to which arriving tasks are appended. Given that n -1 tasks can be scheduled on each time slot, 3 then the position of a task in Q indicates its scheduled execution time. If at the beginning of time slot t, a task T i is the kth task in Q, then T i is scheduled to execute at time slot t k n + -1 .…”

Section: Scheduling Uniform Tasksmentioning

confidence: 99%

“…We show that it depends on the parameter w of the algorithm. We base our example on (3). The results of the tasks and their corresponding Fs are shown in Table 1.…”

Section: An Examplementioning

confidence: 99%

See 2 more Smart Citations

Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

Ghosh

Melhem

Mossé

1997

IEEE Trans. Parallel Distrib. Syst.

163

166

View full text Add to dashboard Cite

Real-time systems are being increasingly used in several applications which are time critical in nature. Fault-tolerance is an important requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study a scheme that provides fault-tolerance through scheduling in real-time multiprocessor systems. We schedule multiple copies of dynamic, aperiodic, nonpreemptive tasks in the system, and use two techniques that we call deallocation and overloading to achieve high acceptance ratio (percentage of arriving tasks scheduled by the system). This paper compares the performance of our scheme with that of other fault-tolerant scheduling schemes, and determines how much each of deallocation and overloading affects the acceptance ratio of tasks. The paper also provides a technique that can help real-time system designers determine the number of processors required to provide fault-tolerance in dynamic systems. Lastly, a formal model is developed for the analysis of systems with uniform tasks.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Scheduling Uniform Tasksmentioning

confidence: 99%

See 1 more Smart Citation

Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

Ghosh

Melhem

Mossé

1997

IEEE Trans. Parallel Distrib. Syst.

163

166

View full text Add to dashboard Cite

show abstract

“…A recent topic of research has been the incorporation of many-to-many communication semantics into various transport protocols [1,8,9]. New protocols in each of the above classes will likely be extended with many-to-many semantics.…”

Section: Transport Protocolsmentioning

confidence: 99%

“…The results are then compared, and if at least two agree, that value is used. In the Circus system, replication was integrated with remote procedure call in order to support modular redundancy at the program module level [9].…”

Section: Replication For Availabilitymentioning

confidence: 99%

Distributed Systems Technology Survey.

Cooper¹

1987

Self Cite

View full text Add to dashboard Cite

A review of experiences with reliable multicast

Briman

1999

Softw: Pract. Exper.

View full text Add to dashboard Cite

By understanding how real users have employed reliable multicast in real distributed systems, we can develop insight concerning the degree to which this technology has matched expectations. This paper reviews a number of applications with that goal in mind. Our findings point to trade-offs between the form of reliability used by a system and its scalability and performance. We also find that to reach a broad user community (and a commercially interesting market) the technology must be better integrated with component and object-oriented systems architectures. Looking closely at these architectures, however, we identify some assumptions about failure handling which make reliable multicast difficult to exploit. Indeed, the major failures of reliable multicast are associated with attempts to position it within objectoriented systems in ways that focus on transparent recovery from server failures. The broader opportunity appears to involve relatively visible embeddings of these tools into object-oriented architectures enabling knowledgeable users to make trade-offs. Fault-tolerance through transparent server replication may be better viewed as an unachievable holy grail. stock markets into sophisticated networks. The maturing of reliable multicast technology is a critical gating factor in enabling such a path. The Swiss ExchangeThe Swiss Exchange [5] is an ambitious all-electronic stock exchange: the physical trading floor has been supplanted by a collection of workstations running exchange-developed software situated in member bank and brokerage trading rooms. The old physical trading floor now houses the development and management teams which run the electronic system. The benefits to exchange members are several: rather than calling in orders to traders on the floor, order processing occurs in the same room where institutional trading strategy is developed. Trading support tools can thus be exploited without revealing proprietary methods, and the floor representative of the bank can participate directly in strategy discussions without being observed by competitors.The task of the software implementing the Swiss Exchange is to distribute to each participating trader every trade and every quoted price in the identical order, fault-tolerantly, throughout the full set of perhaps 1000 active traders at 60 member banks and institutions. The latency of the architecture must be low (at worst, a few seconds), and data rates peak at approximately 45 events per second, each represented by a message in the 512-1024 byte range. The exchange guarantees fairness to its customers by giving each exactly the same information, in exactly the same order, and at nearly the same time. The basic architecture of the exchange system is hierarchical: a server at the core sees all trades and all quotes; the latter dominate by about 20:1. It broadcasts these to hubs located at each of the participating institutions; they, in turn, relay the information to the workstations of the traders. Reliable multicast enters this picture in two ways. It...

show abstract

Replicated distributed programs

Cited by 100 publications

References 11 publications

Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

Distributed Systems Technology Survey.

A review of experiences with reliable multicast

Contact Info

Product

Resources

About