Filters








81 Hits in 3.2 sec

Brief Announcement: Update Consistency in Partitionable Systems [article]

Matthieu Perrin, Achour Mostéfaoui, Claude Jard
2015 arXiv   pre-print
We propose a new consistency criterion, update consistency (UC), in which the convergent state must be obtained by a total ordering of the updates, that contains the sequential order of each  ...  Eventual consistency [2] guaranties that all replicas eventually converge to a common state when the participants stop updating.  ...  We can prove that update consistency is universal, in the sense that every object has an update consistent implementation in a partitionable system, where any number of crashes are allowed.  ... 
arXiv:1501.02175v1 fatcat:35i266ip6fflnehts7kwsvpp7u

Brief announcement

Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman
2012 Proceedings of the 2012 ACM symposium on Principles of distributed computing - PODC '12  
Internet supercomputing is an approach to solving partitionable, computation-intensive problems by harnessing the power of a vast number of interconnected computers.  ...  There the adversary is severely limited in its ability to crash processors that normally return correct results.  ...  The messages consist of the sender's collection of the results. Upon receiving the messages a processor updates its own local copy of the sets by taking a union (this excludes duplicated triples).  ... 
doi:10.1145/2332432.2332475 dblp:conf/podc/DavtyanKS12 fatcat:zpp5vlcdq5eivltwtr5rctazqa

The Jgroup Distributed Object Model [chapter]

Alberto Montresor
1999 Distributed Applications and Interoperable Systems II  
Aim of Jgroup is to support the development of dependable applications in partitionable distributed systems.  ...  Jgroup consists of a partitionable group communication service that simplifies the cooperation among groups of replicated server objects, and a client-side mechanism to transparently invoke methods on  ...  Examples can be found in areas such as computer-supported cooperative work (CSCW), mobile systems, weak-consistency data sharing.  ... 
doi:10.1007/978-0-387-35565-8_31 fatcat:pqxb5eaf5vdxvj6r5ieegc6kk4

Relying on safe distance to achieve strong partitionable group membership in ad hoc networks

Qingfeng Huang, C. Julien, G.-C. Roman
2004 IEEE Transactions on Mobile Computing  
A unique property of this partitionable group membership is that messages sent between group members are guaranteed to be delivered successfully, given appropriate system assumptions.  ...  We argue that preventing the occurrence of unannounced disconnection is essential to constructing and maintaining a consistent view in the ad hoc mobile environment.  ...  ACKNOWLEDGMENTS This research was supported in part by the US National Science Foundation (NSF) under Grant No. CCR-9970939.  ... 
doi:10.1109/tmc.2004.14 fatcat:ylex6ov44rbizi7oayekey6mnu

User-Level Implementations of Read-Copy Update

Mathieu Desnoyers, Paul E. McKenney, Alan S. Stern, Michel R. Dagenais, Jonathan Walpole
2012 IEEE Transactions on Parallel and Distributed Systems  
Although RCU updates are relatively heavy weight, the importance of read-side performance is increasing as computing systems become more responsive to changes in their environments.  ...  RCU is heavily used in several kernel-level environments. Unfortunately, kernel-level implementations use facilities that are often unavailable to user applications.  ...  RCU to operate correctly on systems that do not provide sequential consistency.  ... 
doi:10.1109/tpds.2011.159 fatcat:hooehzbwhrdnfczrdp7qp6sczq

Eventual Consistency Today: Limitations, Extensions, and Beyond

Unknown
2013 Queue  
running distributed systems in the wild.  ...  If the scores of system architects advocating eventual consistency are any indication, eventual consistency seems to work "well enough" in practice.  ...  In a dynamic, partitionable Internet, services requiring guaranteed low latency must often relax their expectations of data consistency. does not provide SSI semantics.  ... 
doi:10.1145/2460276.2462076 fatcat:kdvpidj73bcg5hydjxpsm2sxyy

FT-OSGi: Fault Tolerant Extensions to the OSGi Service Platform [chapter]

Carlos Torrão, Nuno A. Carvalho, Luís Rodrigues
2009 Lecture Notes in Computer Science  
Parts of this work have been performed in collaboration with Nuno Carvalho.  ...  properties (regular or uniform broadcast) and the possibility to operate in a partitionable or non-partitionable group.  ...  System Architecture and Components The FT-OSGi is composed of several building blocks to support the communication between the nodes of the system and to support the consistency between replicas.  ... 
doi:10.1007/978-3-642-05148-7_47 fatcat:ppucke7bunhsrd55yuojpoyypy

Decentralized remapping of data parallel applications in distributed memory multiprocessors

Chengzhong Xu, Francis C. M. Lau, Ralf Diekmann
1997 Concurrency Practice and Experience  
We implemented this remapping method in parallel WaTor simulations and parallel image thinning applications, and found it to be effective in reducing the computation time.  ...  The average performance gain is about 20% in the WaTor simulation of a 256 × 256 ocean grid on 16 processors, and up to 8% in the thinning of a typical image of size 128 × 128 on eight processors.  ...  Each simulation step consists of three sub-steps: 1. ExBound: exchange of contents of grid points along a strip's boundaries 2. Update: update of fishes in the strip 3.  ... 
doi:10.1002/(sici)1096-9128(199712)9:12<1351::aid-cpe283>3.0.co;2-c fatcat:fm3427f5ejdu3bipqgde2zcjoa

Decentralized remapping of data parallel applications in distributed memory multiprocessors

Chengzhong Xu, Francis C. M. Lau, Ralf Diekmann
1997 Concurrency Practice and Experience  
We implemented this remapping method in parallel WaTor simulations and parallel image thinning applications, and found it to be effective in reducing the computation time.  ...  The average performance gain is about 20% in the WaTor simulation of a 256 × 256 ocean grid on 16 processors, and up to 8% in the thinning of a typical image of size 128 × 128 on eight processors.  ...  Each simulation step consists of three sub-steps: 1. ExBound: exchange of contents of grid points along a strip's boundaries 2. Update: update of fishes in the strip 3.  ... 
doi:10.1002/(sici)1096-9128(199712)9:12<1351::aid-cpe283>3.3.co;2-3 fatcat:sygnbam4m5bwpnp675hgidx4le

ERMIA

Kangnyeon Kim, Tianzheng Wang, Ryan Johnson, Ippokratis Pandis
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
In this paper, we present ERMIA, a memory-optimized database system built from scratch to cater the need of handling heterogeneous workloads.  ...  Many modern transaction processing systems adopt a lightweight optimistic concurrency control (OCC) scheme to leverage its low overhead in low contention workloads.  ...  We first give a brief overview of SI, and then explain in detail how SSN works and how we prevent phantoms.  ... 
doi:10.1145/2882903.2882905 dblp:conf/sigmod/KimWJP16 fatcat:w2jwa4kgfbgendqmeusxwappoi

Is Parallel Programming Hard, And, If So, What Can You Do About It? (Release v2021.12.22a) [article]

Paul E. McKenney
2021 arXiv   pre-print
The purpose of this book is to help you program shared-memory parallel systems without risking your sanity.  ...  In some surprisingly common cases, these tasks can be automated.  ...  Example Usage The parent program is shown in Figure 4 .13. It invokes smp_init() to initialize the threading system on line 6, parses arguments on lines 7-14, and announces its presence on line 15.  ... 
arXiv:1701.00854v4 fatcat:pxiajyczebd5pm76htwnrczhm4

RINGOSTAR: an evolutionary performance-enhancing WDM upgrade of IEEE 802.17 resilient packet ring

M. Herzog, M. Maier
2006 IEEE Communications Magazine  
In the following subsection we provide a brief overview of RPR and outline its major limitations. We introduce a novel packet stripping technique used in RINGOSTAR.  ...  To this end, RPR is likely to be upgraded from a single-channel system to a multichannel system by means of wavelengthdivision multiplexing (WDM).  ... 
doi:10.1109/mcom.2006.1593544 fatcat:2bbbxcufvrczbnl2fdulgqwbbm

Zab: High-performance broadcast for primary-backup systems

F. P. Junqueira, B. C. Reed, M. Serafini
2011 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN)  
Our implementation of Zab can achieve tens of thousands of broadcasts per second, which is sufficient for demanding systems such as our Web-scale applications.  ...  Experiments and experience so far in production show that our design enables an implementation that meets the performance requirements of our applications.  ...  Finally, a primary has to guarantee that the state updates generated are consistent.  ... 
doi:10.1109/dsn.2011.5958223 dblp:conf/dsn/JunqueiraRS11 fatcat:slswhktydbgedfegixpdp4bydy

An Overview of the Blue Gene/L System Software Organization [chapter]

George Almási, Ralph Bellofatto, José Brunheroto, Călin Caşcaval, José G. Castaños, Luis Ceze, Paul Crumley, C. Christopher Erway, Joseph Gagliano, Derek Lieber, Xavier Martorell, José E. Moreira (+2 others)
2003 Lecture Notes in Computer Science  
With 65,536 compute nodes, Blue Gene/L represents a new level of complexity for parallel system software, with specific challenges in the areas of scalability, maintenance and usability.  ...  The Blue Gene/L supercomputer will use system-on-a-chip integration and a highly scalable cellular architecture.  ...  Section 2 presents a brief description of the Blue Gene/L supercomputer. Section 3 discusses the system software. Section 4 introduces our simulation environment and we conclude in Section 5.  ... 
doi:10.1007/978-3-540-45209-6_79 fatcat:3z2vgesyhvdkjdgqyks7gzxvke

AN OVERVIEW OF THE BLUEGENE/L SYSTEM SOFTWARE ORGANIZATION

GEORGE ALMÁSI, RALPH BELLOFATTO, JOSÉ BRUNHEROTO, CĂLIN CAŞCAVAL, JOSÉ G. CASTAÑOS, PAUL CRUMLEY, C. CHRISTOPHER ERWAY, DEREK LIEBER, XAVIER MARTORELL, JOSÉ E. MOREIRA, RAMENDRA SAHOO, ALDA SANOMIYA (+2 others)
2003 Parallel Processing Letters  
With 65,536 compute nodes, Blue Gene/L represents a new level of complexity for parallel system software, with specific challenges in the areas of scalability, maintenance and usability.  ...  The Blue Gene/L supercomputer will use system-on-a-chip integration and a highly scalable cellular architecture.  ...  Section 2 presents a brief description of the Blue Gene/L supercomputer. Section 3 discusses the system software. Section 4 introduces our simulation environment and we conclude in Section 5.  ... 
doi:10.1142/s0129626403001513 fatcat:2whcow3pfrerbogoz5icecmhpy
« Previous Showing results 1 — 15 out of 81 results