Implementation of Argus

Liskov, Barbara; Curtis, D.; Johnson, P.; Scheifer, R.

doi:10.1145/41457.37514

Cited by 85 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Less chance for failures occurred in any operational interval. If any message transmitting node is identify an error by the strong error checking process, the node effectively aborts transmission and attempts to retransmit repeatedly until its message is received successfully [13]. This functionality lads the CAN bus into hogged stage, if the high priority node is failed.…”

Section: A Reliabilitymentioning

confidence: 99%

Arm Based Accident Preventive System

Krishna¹,

Roy²

2017

ijoaem

View full text Add to dashboard Cite

In this paper, a Controller Area Network (CAN) based communication system is presented for collision or accident avoidance. This system can be used in automobiles to provide more safety. CAN architecture has been proposed and implemented using MCP2515. The major advantage of CAN based smart network over the traditional point to point schemes is increased and more flexibility and expandability new features. Various parameters of the car basically speed, distance from the other cars, obstacles like persons and presences of animals detected and measures accurately. A status signal may send to the car driver if any of the desire parameter goes out of range to avoid accidents. The aim of this project is to avoid collision by detecting obstacles, vehicles using IR or ultrasonic sensors for obstacle avoidance and controlling the vehicle accordingly by using CAN protocol.

show abstract

Section: A Reliabilitymentioning

confidence: 99%

Arm Based Accident Preventive System

Krishna¹,

Roy²

2017

ijoaem

View full text Add to dashboard Cite

show abstract

“…Hoare [34] and Lomet [35] first proposed the use of atomic blocks for synchronization, and the Argus [36] and Avalon [37] projects developed language support for implementing atomic objects. Persistent languages [38], [39] augment atomicity with data persistence in order to introduce transactions into programming languages.…”

Section: Related Workmentioning

confidence: 99%

Exploiting purity for atomicity

Flanagan

Freund

Qadeer

2004

Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis

View full text Add to dashboard Cite

Abstract-Multithreaded programs often exhibit erroneous behavior because of unintended interactions between concurrent threads. This paper focuses on the noninterference property of atomicity. A procedure is atomic if, for every execution, there is an equivalent serial execution in which the actions of the atomic procedure are not interleaved with actions of other threads. This key property makes atomic procedures amenable to sequential reasoning techniques, which significantly facilitates subsequent validation activities such as code inspection and testing. Several existing tools verify atomicity by using commutativity of actions to show that every execution reduces to a corresponding serial execution. However, experiments with these tools have highlighted a number of interesting procedures that, while intuitively atomic, are not reducible. In this paper, we exploit the notion of pure code blocks to verify the atomicity of such irreducible procedures. If a pure block terminates normally, then its evaluation does not change the program state and, hence, these evaluation steps can be removed from the program trace before reduction. We develop a static typed-based analysis for atomicity based on this insight, and we illustrate this analysis on a number of interesting examples that could not be verified using earlier tools based purely on reduction.

show abstract

“…The state of guardians in the transaction-based Argus system is split into stable and volatile variables [53]. Recovery relies upon replay of a local stable log.…”

Section: Reliable Executionmentioning

confidence: 99%

Mobile computing with the Rover toolkit

Joseph¹,

Tauber

Kaashoek

1997

IEEE Trans. Comput.

165

View full text Add to dashboard Cite

Rover is one of the first architectures that supports the construction of both mobileadaptive applications and mobile-adaptive proxies for mobile-transparent applications. To excel in the harsh conditions of a mobile environment, mobile-adaptive applications are aware of and take an active part in adapting to those conditions. The mobile-transparent approach is appealing because it allows applications to be run without alteration. The contributions of this thesis include the Rover architecture and a reference implementation, the Rover Toolkit. Together, the architecture and toolkit support a set of programming and communication abstractions that enable and simplify the construction of both mobile-adaptive proxies for mobile-transparent applications and new mobile-adaptive applications. The programming abstractions include Relocatable Dynamic Objects, a form of code-and data-shipping, along with remote invocation and method logging, that allows mobile-adaptive applications to dynamically adapt to environmental changes, and programming language extensions for reliable execution of applications at servers. The communication abstractions are based upon Queued Remote Procedure Call, a form of remote invocation that provides asynchronous, reliable delivery of requests and results. Using the Rover abstractions, applications obtain increased availability, concurrency, resource allocation efficiency, code reuse, fault tolerance, data consistency, application adaptation to environmental changes, and more efficient scheduling and utilization of communication channels. Experimental evaluation of a suite of mobile applications built with the toolkit demonstrates that such application-level control can be obtained with relatively little programming overhead and allows correct operation, increases interactive performance, and reduces network utilization under intermittently connected conditions. John Guttag also deserves thanks for mentoring me over the years. I thank him for the guidance he has given me, especially when I was changing research groups and during my search for a job.I thank David Gifford for his efforts during the design stages of the Rover toolkit, in particular his ideas for the semantics of QRPC.I thank my parents for the motivation they instilled in me, for all the support they have provided, and for their faith in me.I owe a lot of thanks to the rest of the Rover project team: Joshua Tauber, George Candea, Constantine Cristakos, Alan F. deLespinasse, and Michael Shurpik. Special thanks go to Josh for all the great design arguments/discussions we shared that helped shape the Rover architecture and for his help in building and debugging applications.I thank the Parallel and Distributed Operating Systems group for reading many drafts of the papers behind this thesis (thanks Massimiliano Poletto, Eddie Kohler, and Greg Ganger) and for providing me with a fun, exciting, and sometimes loud (thanks David Mazieres and Emmett Witchel), research environment. Thanks also to Neena Lyall for making the administ...

show abstract

Implementation of Argus

Cited by 85 publications

References 16 publications

Arm Based Accident Preventive System

Arm Based Accident Preventive System

Exploiting purity for atomicity

Mobile computing with the Rover toolkit

Contact Info

Product

Resources

About