Filters








4,017 Hits in 4.7 sec

Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract) [article]

Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita and Koichi Wada
2019 arXiv   pre-print
One is for implementing a move-atomic property and the other is for implementing FSYNC scheduler, where robots possess an independent clock that is advanced in the same speed.  ...  Of course, we can use a globally synchronized clock to achieve the task but it is very expensive to realize it in a distributed system in general.  ...  However, unlike our setting, this simulation algorithm is performed asynchronously on the same LCM robot system as the simulated semi-synchronous algorithm works.  ... 
arXiv:1903.02843v1 fatcat:5i2mk2f2dfbpfgjmewif3nmy5a

Reflective HCI

Paul Dourish, Janet Finlay, Phoebe Sengers, Peter Wright
2004 Extended abstracts of the 2004 conference on Human factors and computing systems - CHI '04  
ABSTRACT FIASCO is a location-based game that takes place on a website and on street corners.  ...  By agent-free we mean an approach that does not presume the subject.  ...  The aim, then, must be to present a usable reflexivity. ACKNOWLEDGEMENTS This work is sponsored in part by NSF Award #0238132.  ... 
doi:10.1145/985921.986203 dblp:conf/chi/DourishFSW04 fatcat:2riaoweryzhnza25n4hwbghwha

Obtaining consistent global state dumps to interactively debug systems on chip with multiple clocks

Bart Vermeulen, Kees Goossens
2010 2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)  
Our experimental results show that it is possible to ensure a globally consistent state is observed when the system is stopped on a breakpoint event.  ...  To debug an embedded system when the states that are extracted are irreproducible and inconsistent is nearly impossible.  ...  that a consistent global state is observed, when the system is stopped on a breakpoint event.  ... 
doi:10.1109/hldvt.2010.5496668 dblp:conf/hldvt/VermeulenG10 fatcat:hkaj67cg2be4fo36vota2gy7pm

On Composition and Implementation of Sequential Consistency [article]

Matthieu Perrin, Matoula Petrolia, Achour Mostefaoui, Claude Jard
2016 arXiv   pre-print
This paper extends this result to crash-prone asynchronous systems, proposing a distributed algorithm building a sequentially consistent shared snapshot memory on top of an asynchronous message-passing  ...  To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations  ...  Then A also implements an SC(Y )-consistent object when it is executed in an asynchronous system providing an SC(X)-consistent object.  ... 
arXiv:1607.06258v2 fatcat:56a7faw7vbgrhpkocfc4rdnalm

On Composition and Implementation of Sequential Consistency [chapter]

Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard
2016 Lecture Notes in Computer Science  
This paper extends this result to crash-prone asynchronous systems, proposing a distributed algorithm that builds a sequentially consistent shared snapshot memory on top of an asynchronous message-passing  ...  To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations  ...  Then A also implements an SC(Y )-consistent object when it is executed in an asynchronous system providing an SC(X)-consistent object.  ... 
doi:10.1007/978-3-662-53426-7_21 fatcat:lpqjenqyabazpgr6nary36lyvq

The failure detector abstraction

Felix C. Freiling, Rachid Guerraoui, Petr Kuznetsov
2011 ACM Computing Surveys  
A failure detector is a fundamental abstraction in distributed computing. This paper surveys this abstraction through two dimensions.  ...  That is, we survey the weakest failure detector question and illustrate how failure detectors can be used to classify problems.  ...  Acknowledgments We wish to thank Martin Hutle for comments on a previous version of this paper and the anonymous reviewers for the constructive feedback.  ... 
doi:10.1145/1883612.1883616 fatcat:ltz65nnmrrhvfh7qnbkz4ylone

On Composition and Implementation of Sequential Consistency (Extended Version) [article]

Matthieu Perrin, Matoula Petrolia, Achour Mostefaoui, Claude Jard
2016 arXiv   pre-print
We propose a distributed algorithm that builds a sequentially consistent shared memory abstraction with snapshot on top of an asynchronous message-passing system where less than half of the processes may  ...  This paper extends this result to crash-prone asynchronous systems.  ...  This extends the result of Attiya and Welch (that only concerns synchronous failure-free systems) to asynchronous systems with crashes.  ... 
arXiv:1607.05596v4 fatcat:zuopfjd3qng2dnajn6nqdcnflu

Verification of device drivers and intelligent controllers

David Monniaux
2007 Proceedings of the 7th ACM & IEEE international conference on Embedded software - EMSOFT '07  
Some newer systems use "intelligent" controllers that handle dynamic worklists in shared memory and perform direct memory accesses, all asynchronously from the main processor.  ...  We have successfully verified a device driver extracted from a critical industrial system, asynchronously combined with a model for a USB OHCI controller.  ...  It chooses an ascending sequence of abstract sets and test if these are invariants, using the analysis as feedback (and stops once an invariant is obtained).  ... 
doi:10.1145/1289927.1289937 dblp:conf/emsoft/Monniaux07 fatcat:3emhpn74lralzit4hzuzj5rlwe

Deadlock-Guided Testing

Miguel Gomez-Zamalloa, Miguel Isabel
2021 IEEE Access  
This paper proposes a testing methodology that combines static analysis and symbolic execution for effective deadlock detection in asynchronous programs.  ...  Moreover, when a potential deadlock is detected, they provide little (and often no) information that can help the user in finding the source of the anomalous behaviour.  ...  Consider an abstract deadlock cycle c and an extended initial state (S 0 , IT 0 ).  ... 
doi:10.1109/access.2021.3065421 fatcat:nft2xvxwpjhe3mxsd7w3ojaqfa

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui, Eric Ruppert
2007 Distributed computing  
We consider asynchronous shared-memory systems that are anonymous. The shared memory contains only the most common type of shared objects, read/write registers.  ...  We also show that a shared object has an obstruction-free implementation if and only if it satisfies a simple property called idempotence.  ...  (See Sect. 2 for a discussion of this work. ) We explore in this paper the types of shared objects that can be implemented deterministically in an anonymous, asynchronous shared-memory system.  ... 
doi:10.1007/s00446-007-0042-0 fatcat:eegkkqe55ncodflw2ghhamnk2e

JANE-The Java Ad Hoc Network Development Environment

Daniel Gorgen, Hannes Frey, Christian Hiedels
2007 40th Annual Simulation Symposium (ANSS'07)  
Reusability of components in different execution contexts by providing an appropriate machine abstraction is a further important design decision which drove the platform development.  ...  Code written once can be executed in a pure simulation mode, in a hybrid setting with real devices being attached to a running simulation and, finally, in a setting using real devices only.  ...  Acknowledgements This work is funded in part by DFG, priority programme SPP1140 "Selforganized infrastructures for networked mobile systems".  ... 
doi:10.1109/anss.2007.24 dblp:conf/anss/GorgenFH07 fatcat:m43uk6ye7neenfw56xisbll7ea

Synthesizing operating system based device drivers in embedded systems

Shaojie Wang, Sharad Malik
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
Existing driver development is largely manual using an ad-hoc design methodology. Consequently, this task is error prone and becomes a bottleneck in embedded system design methodology.  ...  Finally, we synthesize an operating system (OS) based event processing mechanism, which is the core of the device driver, using a disciplined methodology that assures the correctness of the resulting driver  ...  Sticky events are simulated by registering a timer handler simulating the occurrence of the event repeatedly, that is, we poll for the consumption of the event.  ... 
doi:10.1145/944654.944655 fatcat:eu3nzsbekbbatky77tisocg2h4

Synthesizing operating system based device drivers in embedded systems

Shaojie Wang, Sharad Malik
2003 Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign & system synthesis - CODES+ISSS '03  
Existing driver development is largely manual using an ad-hoc design methodology. Consequently, this task is error prone and becomes a bottleneck in embedded system design methodology.  ...  Finally, we synthesize an operating system (OS) based event processing mechanism, which is the core of the device driver, using a disciplined methodology that assures the correctness of the resulting driver  ...  Sticky events are simulated by registering a timer handler simulating the occurrence of the event repeatedly, that is, we poll for the consumption of the event.  ... 
doi:10.1145/944645.944655 dblp:conf/codes/WangM03 fatcat:lk755sqvovdpje2k3xp2pvahfq

Elasticity and Petri Nets [chapter]

Jordi Cortadella, Michael Kishinevsky, Dmitry Bufistov, Josep Carmona, Jorge Júlvez
2008 Lecture Notes in Computer Science  
Time elastic systems can tolerate static and dynamic changes in delays (asynchronous case) or latencies (synchronous case) of operations that can be used for modularity, ease of reuse and better power-delay  ...  Time elastic systems can be constructed either by replacing the clock with communication handshakes (asynchronous version) or by augmenting the clock with a synchronous version of a handshake (synchronous  ...  The selected guard of a transition t is persistent, i.e., it never changes between the firings of t.  ... 
doi:10.1007/978-3-540-89287-8_13 fatcat:72dwdfeh4vbmtdz3tp5jdraaj4

Distributed Agreement in Tile Self-Assembly [article]

Aaron Sterling
2010 arXiv   pre-print
We construct tile assembly systems that are able to simulate the solution of the wait-free consensus problem in some distributed systems.  ...  its solution in a distributed system with any number of processes.  ...  Simulating a two-processor message-passing system in tile self-assembly In practice, asynchronous shared memory systems are usually built on top of distributed systems in which processors interact physically  ... 
arXiv:0902.3631v3 fatcat:3busshmhgbez3a2whaisgef36y
« Previous Showing results 1 — 15 out of 4,017 results