Concurrency in Dependable Computing by Jonathan Burton, Maciej Koutny, Giuseppe Pappalardo, Marta

By Jonathan Burton, Maciej Koutny, Giuseppe Pappalardo, Marta Pietkiewicz-Koutny (auth.), Paul Ezhilchelvan, Alexander Romanovsky (eds.)

Concurrency in accountable Computing specializes in concurrency similar concerns within the zone of accountable computing. mess ups of approach elements, be devices or software program modules, should be considered as bad occasions happening at the same time with a collection of ordinary procedure occasions. attaining dependability as a result is heavily regarding, and in addition advantages from, concurrency thought and formalisms. this helpful dating seems to be to show up into 3 strands of work.
software point structuring of concurrent actions. options corresponding to atomic activities, conversations, exception dealing with, view synchrony, etc., are priceless in structuring concurrent actions in an effort to facilitate makes an attempt at dealing with the results of part disasters.
Replication brought on concurrency administration. Replication is a regular approach for reaching reliability. reproduction administration basically consists of making sure that replicas understand concurrent occasions identically.
program of concurrency formalisms for dependability insurance. Fault-tolerant algorithms are tougher to ensure than their fault-free opposite numbers when you consider that the influence of part faults at every one nation have to be thought of as well as legitimate country transitions. CSP, Petri nets, CCS are priceless instruments to specify and ensure fault-tolerant designs and protocols.
Concurrency in accountable Computing explores many major matters in all 3 strands. To this finish, it truly is composed as a suite of papers written through authors famous of their respective components of analysis. to make sure caliber, the papers are reviewed by way of a panel of at the least 3 specialists within the correct area.

Show description

Read or Download Concurrency in Dependable Computing PDF

Best computing books

The Complete Beginner's Guide to Reddit

Reddit. com is an amazingly attractive site with a various person base. In "The whole Beginner's advisor to Reddit," you'll the best way to commence shopping the positioning, create an account, join numerous subreddits, publish, edit, and delete reviews, make submissions, join and create multireddits, and various different issues.

Wired (January 2016)

Http://www. stressed out. com/magazine/never-let-go/

Distributed Computing and Networking: 13th International Conference, ICDCN 2012, Hong Kong, China, January 3-6, 2012. Proceedings

This publication constitutes the refereed complaints of the thirteenth overseas convention on dispensed Computing and Networking, ICDCN 2012, held in Hong Kong, China, in the course of January 3-6, 2012. The 36 revised complete papers and 1 brief paper awarded including four poster papers have been rigorously reviewed and chosen from a hundred submissions.

Macroscopic Quantum Coherence and Quantum Computing

This quantity is an outgrowth of the second one overseas Workshop on Macroscopic Quantum Coherence and Computing held in Napoli, Italy, in June 2000. This workshop accumulated a few specialists from the foremost Universities and examine associations of a number of international locations. the alternative of the site, which acknowledges the function and the traditions of Naples during this box, assured the members a stimulating surroundings.

Additional info for Concurrency in Dependable Computing

Sample text

The system state is therefore hidden and must be deduced indirectly, from the sequence of commands observed on the powerline. We are therefore led to formulate the state deduction task in terms of the observability of the model, a concept which is well studied in discrete-event dynamic systems. We refer the reader to [4] for details. The powerline medium is inherently unreliable and suffers from disruption due to power spikes and noise from household appliances. Its common-case faults are: the loss of a single message and the crash of a single CMllA interface.

Hooman, "Trace-based Compositional Reasoning About Fault-tolerant Systems," Proc. PARLE'93, Springer, LNCS 694, 1993. com Abstract Distributed systems are notoriously subject to complex faults, of which some are unanticipated. Towards dealing with the problem of unanticipated faults, we describe in this paper a model-based approach to the design of dependability. e. abstract descriptions of systems, our approach offers a potentially low-cost alternative to handling rare faults in a case-by-case manner, while allowing common faults to be handled individually.

As may be expected, while techniques that deal with complex faults often yield elegant designs, there are cases where the added complexity has yielded significant tradeo:ffs. ISIS is an example of a group communication services platform that dealt with complex faults but was itself so complex that maintainability suffered [6]. In other work, scenarios are reported where the virtual synchrony approach experienced scalability problems [7). In the case of the Microsoft Cluster Service [11), it is reported that the high overhead of that dependability design prevented it from scaling past 2 to 4 nodes.

Download PDF sample

Rated 4.11 of 5 – based on 17 votes