Filters








35,548 Hits in 7.4 sec

Simulating a Shared Register in a System that Never Stops Changing [article]

Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar and Jennifer L. Welch
2017 arXiv   pre-print
However, existing simulations need to assume that the system eventually stops changing for a long enough period or that the system size is bounded.  ...  This paper presents the first simulation of an atomic read/write register in a crash-prone asynchronous system that can change size and withstand nodes continually entering and leaving.  ...  Most of the work in this area has focused on simulating atomic shared registers. For example, the ABD simulation [5] replicates the value of the register in server nodes.  ... 
arXiv:1708.03274v1 fatcat:hy3jbjjmrjgbfiewa4rxwt4wyq

Simulating a Shared Register in an Asynchronous System that Never Stops Changing [chapter]

Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch
2015 Lecture Notes in Computer Science  
However, all existing simulations need to assume that the system eventually stops changing for a long enough period or that the system size is fixed.  ...  This paper presents the first simulation of an atomic read/write register in a crashprone asynchronous system that can change size and withstand nodes continually entering and leaving.  ...  However, existing simulations rely either on the assumption that churn eventually stops for a long enough period (e.g., [2, 7] ) or on the assumption that the system size never changes (e.g., [6] ).  ... 
doi:10.1007/978-3-662-48653-5_6 fatcat:2qtzk5tdwbeapa27opi43ai6ea

Partial synchrony based on set timeliness

Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
2009 Proceedings of the 28th ACM symposium on Principles of distributed computing - PODC '09  
We introduce a new model of partial synchrony for read-write shared memory systems.  ...  In particular, we use it to give a partially synchronous system that is is synchronous enough for solving (t, k, n)-agreement, but not enough for solving two incrementally stronger problems, namely, (t  ...  In each step, a process p can read or write a shared register and change state (according to p's state transition function in A p ).  ... 
doi:10.1145/1582716.1582737 dblp:conf/podc/AguileraDFT09 fatcat:v5qo4357rzhqxmu4a2fckudkf4

Partial synchrony based on set timeliness

Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
2012 Distributed computing  
We introduce a new model of partial synchrony for read-write shared memory systems.  ...  In particular, we use it to give a partially synchronous system that is is synchronous enough for solving (t, k, n)-agreement, but not enough for solving two incrementally stronger problems, namely, (t  ...  In each step, a process p can read or write a shared register and change state (according to p's state transition function in A p ).  ... 
doi:10.1007/s00446-012-0158-8 fatcat:uyehrudvmnhulh2yoy4lpq2dma

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.  ...  In non-anonymous systems, the snapshot object [1,2,6] is probably the most important example of a shared object that has a wait-free implementation from registers.  ... 
doi:10.1007/s00446-007-0042-0 fatcat:eegkkqe55ncodflw2ghhamnk2e

Interactive Debug of SoCs with Multiple Clocks

B Vermeulen, K Goossens
2011 IEEE Design & Test of Computers  
Each circle indicates a state change in a block.  ...  The values in these registers, however, are never used without a valid handshake, so their unstableness did not affect the clock domain's functional operation.  ... 
doi:10.1109/mdt.2011.42 fatcat:2yr3i5zq55gchna5jibtdmo4ym

Resilience of mutual exclusion algorithms to transient memory faults

Thomas Moscibroda, Rotem Oshman
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
We show that using only three binary registers it is possible to design an 2-process mutual exclusion algorithm which tolerates a single memory fault in this manner.  ...  In combination with our three-variable algorithm, this implies that there is a (2f + 1)-variable mutual exclusion algorithm tolerating a single fault in up to f variables without violating mutual exclusion  ...  This is achieved by having each process pi go through a sequence of writes to shared memory, leaving a unique footprint in shared memory that is never encountered elsewhere in the algorithm; in particular  ... 
doi:10.1145/1993806.1993817 dblp:conf/podc/MoscibrodaO11 fatcat:d4vk2ynctjcixkmodidp4mncf4

Wireless sensor network application programming and simulation system

Zivanov Zarko, Rakic Predrag, Hajdukovic Miroslav
2008 Computer Science and Information Systems  
We present, a wireless sensor network application programming and simulation system, suitable for wireless sensor network application development for both resource constrained and unconstrained hardware  ...  Developed programs can be tested inside simulator, or (with source unchanged) executed directly on hardware.  ...  These system calls are ignored in preemptive system, since duty cycle of preemptive system is 100% (it is never in sleep mode). The first phase during code generation is preprocessing.  ... 
doi:10.2298/csis0801110z fatcat:nbh4abv46vc4zgvbyspxfdldju

Computing with faulty shared objects

Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld
1995 Journal of the ACM  
This paper investigates the effects of the failure of shared objects on distributed systems. First the notion of a faulty shared object is introduced.  ...  Using these constructions a universal construction of any linearizable shared object from a set of either A preliminary version of the results presented in this paper appeared in  ...  Each fault of a shared object is modeled as a state change that appears to be atomic with respect to the processes' operations.  ... 
doi:10.1145/227683.227688 fatcat:ojeod36bcjb5lf2umhsjxwfdye

Shared buffer ATM switch with doubly linked lists

Yeong-Fong Lin, C. Bernard Shung
1995 International Journal of Communication Systems  
spread over all linked lists in the SBMS in a short time.  ...  However, in this paper we find that if an error occurs in the address chain memory of one linked list which stores the address of the next cell in the shared buffer memory, the erroneous situation will  ...  Note that the uniform random traffic model is a special case with p = 1 and q = p. Our simulation experiments measure the queuing delay and cell loss rate of an 8 X 8 shared buffer memory switch.  ... 
doi:10.1002/dac.4500080404 fatcat:caed73ge6fgjtjrrh7vkmzu4jq

Simulation-based HW/SW co-debugging for field-programmable systems-on-chip

Ruediger Willenberg, Paul Chow
2013 2013 23rd International Conference on Field programmable Logic and Applications  
SimXMD connects a GNU debugger instance to a full-system simulation of an embedded FPGA system.  ...  We are presenting SimXMD (Simulation-based eXperimental Microprocessor Debugger), a tool that allows developers to debug microcontroller code and custom hardware simultaneously.  ...  Acknowledgment We thank Xilinx, CMC Microsystems, Embedded Systems Canada (emSYSCAN) and NSERC for supporting our research.  ... 
doi:10.1109/fpl.2013.6645542 dblp:conf/fpl/WillenbergC13 fatcat:uwptubuia5bafneowghochz5hq

A Universal Flying Amorphous Computer [chapter]

Lukáš Petrū, Jiří Wiedermann
2011 Lecture Notes in Computer Science  
We design a distributed probabilistic communication protocol and an algorithm enabling a simulation of a RAM in finite time.  ...  Amorphous computers are systems that derive their computational capability from the operation of vast numbers of simple, identical, randomly distributed and locally communicating units.  ...  In order to start a simulation of a RAM with registers we will require that the simulating flying amorphous computer also have at least registers loaded with the same initial data as the RAM.  ... 
doi:10.1007/978-3-642-21341-0_22 fatcat:jldyp4nrq5bqjknysl2du66q2y

ANALYSIS OF AN ELEVATOR SYSTEM USING DISCRETE EVENT SIMULATION: CASE STUDY

Marcelo F.N. Henriques, University of Minho, Campus Gualtar, 4710-057, Braga, Portugal, António A.C. Vieira, Luís M.S. Dias, Guilherme A.B. Pereira, José A. Oliveira
2019 International Journal for Quality Research  
This paper documents the work conducted to simulate an elevator system, using SIMIO software. The modelled system represents a case study that was analyzed in a hospital at Braga, Portugal.  ...  A previ-ous work on the same case study concluded that the best dwell time configuration would be around 10 seconds, however it did not consider the impact of different client demand on the elevator system  ...  By simulating an elevator system, it is possible to change the system partially or entirely in a virtual way, allowing for a measurement of such changes in the system performance, without stopping the  ... 
doi:10.24874/ijqr13.04-05 fatcat:2smxmwl2ynhj7m5dl2yecs77jm

Cigarette smoking and smoking cessation in relation to risk of rheumatoid arthritis in women

Daniela Di Giuseppe, Nicola Orsini, Lars Alfredsson, Johan Askling, Alicja Wolk
2013 Arthritis Research & Therapy  
Padyukov L, Silva C, Stolt P, Alfredsson L, Klareskog L: A gene-environment interaction between smoking and shared epitope genes in HLA-DR provides a high risk of seropositive rheumatoid arthritis.  ...  Conclusions: This prospective study highlights that even light cigarette smoking is associated with increased risk of RA in women and that smoking cessation may reduce, though not remove, this risk.  ...  The Swedish Rheumatology Register (SRR) is a web-based national surveillance system started in the mid-nineties as part of standard health care.  ... 
doi:10.1186/ar4218 pmid:23607815 pmcid:PMC3672738 fatcat:je2pbtxfrvhn7j4q52kf6kkcz4

ANANAS - A Framework for Analyzing Android Applications

Thomas Eder, Michael Rodler, Dieter Vymazal, Markus Zeilinger
2013 2013 International Conference on Availability, Reliability and Security  
Android is an open software platform for mobile devices with a large market share in the smartphone sector.  ...  It allows an analyst to script the required user simulation or phone events on demand or adjust the simulation to his needs. Six plugins have been developed for ANANAS.  ...  ACKNOWLEDGEMENTS We would like to thank Christian Nösterer and Thomas Traunmüller for contributing to ANANAS during their time in Hagenberg.  ... 
doi:10.1109/ares.2013.93 dblp:conf/IEEEares/EderRVZ13 fatcat:siztod4zvvenfpfsjlbzjpqkie
« Previous Showing results 1 — 15 out of 35,548 results