1,821 Hits in 5.8 sec

EPaxos Revisited

Sarah Tollman, Seo Jin Park, John K. Ousterhout
2021 Symposium on Networked Systems Design and Implementation  
The benchmarking approach used for the original EPaxos evaluation does not trigger or measure the full impact of conflict behavior on system performance.  ...  This paper re-evaluates the performance of the EPaxos consensus protocol for geo-replication and proposes an enhancement that uses synchronized clocks to reduce operation latency.  ...  This work was supported by the industrial affiliates of the Stanford Platform Lab. Our experiments were run on Google Cloud with the support of a Google Cloud Platform Education Grant.  ... 
dblp:conf/nsdi/TollmanPO21 fatcat:vtcoanamxjhltoop4d6lxu5h6y

Design and evaluation of a conit-based continuous consistency model for replicated services

Haifeng Yu, Amin Vahdat
2002 ACM Transactions on Computer Systems  
We then present the design and implementation of TACT, a middleware layer that enforces arbitrary consistency bounds among replicas using these metrics.  ...  We argue that an important class of applications can tolerate relaxed consistency, but benefit from bounding the maximum rate of inconsistent access in an application-specific manner.  ...  Jeff Chase and Doug Terry provided a number of insightful comments on the TACT design. Special thanks to Phil Bernstein for helpful discussion on the presentation of our work and future directions.  ... 
doi:10.1145/566340.566342 fatcat:q3phn7bnhbcsflq74zmz42f3bi

AFDA: Asynchronous Flipped Diversity ALOHA for Emerging Wireless Networks With Long and Heterogeneous Delay

Lei Zheng, Lin Cai
2015 IEEE Transactions on Emerging Topics in Computing  
The design of random media access control (MAC) protocol renews great attention for emerging challenged wireless environments, where the propagation delay is long, heterogeneous, and/or varying, such as  ...  In this paper, we propose the asynchronous flipped diversity ALOHA (AFDA) to tackle the challenges based on a new diversity transmission scheme.  ...  In the next section, simulation results are used to evaluate the tightness of the bound. EMERGING TOPICS IN COMPUTING A.  ... 
doi:10.1109/tetc.2014.2373052 fatcat:7eqrkqup3rd5bhoqvfxvjopyvy

Error Recovery in the Time-Triggered Paradigm with FTT-CAN

Luis Marques, Verónica Vasconcelos, Paulo Pedreiras, Luís Almeida
2018 Sensors  
Transient errors, which are a couple of orders of magnitude more frequent than permanent ones, can be mitigated with temporal redundancy, i.e., sending message replicas in different time instants, using  ...  Moreover, as message retransmissions are explicitly scheduled, it becomes possible to control the impact of such events on the remaining traffic and so maintaining the determinism of the TT approach.  ...  Regional Development Fund (FEDER) through a grant of the Operational Programme of Competitivity and Internationalization of Portugal 2020 (PRODUTECH II SIF, POCI-01-0247-FEDER-024541).  ... 
doi:10.3390/s18010188 pmid:29324723 pmcid:PMC5795361 fatcat:3tz26lwl5fbnpejqrm33c7xqie

Modern Random Access for Satellite Communications [article]

Federico Clazzer
2017 arXiv   pre-print
The present PhD dissertation focuses on modern random access (RA) techniques.  ...  The comparison of both slot-synchronous and asynchronous RA at higher layer, follows.  ...  While orthogonal schemes are efficient when the scenario is static, i.e. the number of transmitters and their datarate requirements are constant, RA is particularly indicated for very dynamic situations  ... 
arXiv:1706.10198v1 fatcat:m2n7tezg6fd6daexrr5u3bl2la

A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs [article]

Thaddeus Dryja, Quanquan C. Liu, Neha Narula
2020 arXiv   pre-print
All of these protocols use multicast: every honest replica multicasts messages to all other replicas.  ...  The new work aims to achieve communication-efficiency—given such a large n, not everyone can speak during the protocol.  ...  Attiya and Censor-Hillel [AC08] extended the results of [CMS89, KY84] on guaranteed termination of randomized BA protocols to the asynchronous setting, and provided a tight lower bound.  ... 
arXiv:2004.01939v1 fatcat:e242xknijfhnfff4ansndwlbme

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks [article]

Lewis Tseng
2016 arXiv   pre-print
Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice.  ...  This paper surveys important results on fault-tolerant consensus in message-passing networks, and the focus is on results from the past decade.  ...  References [1] Apache zookeeper on windows azure.  ... 
arXiv:1608.07923v1 fatcat:6cqh3mlijrb3vgcbio2j2j3sju

Enhancing Contention Resolution ALOHA Using Combining Techniques

Federico Clazzer, Christian Kissling, Mario Marchese
2018 IEEE Transactions on Communications  
A tight approximation of the packet loss rate for asynchronous random access, including ECRA, well suited for the low channel load region is derived.  ...  Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields like Internet of Things and machine-to-machine  ...  We can write a lower bound of equation (11) as E(E) > AA 2 · P 2|A (2|A) · P A (A). (12) The lower bound identified in equation (12) , can be upper bounded with the help of the computed average number  ... 
doi:10.1109/tcomm.2017.2759264 fatcat:bh7q77kggzdo7gn5icf2s4zjm4

Replica control in distributed systems

Calton Pu, Avraham Leff
1991 Proceedings of the 1991 ACM SIGMOD international conference on Management of data - SIGMOD '91  
Because the system maintains ESR correctness (1) replicas always converges to global sel'ializability and (2) the systenl permits re;ld access to object replicas before the system reaches a quiescent state  ...  This a.pproach applies an extension of serializahility called epsilon-se7'ializability (ESR). it correctness criterion which allows temporary and bounded inconsistency in replicas to be seen by queries  ...  The o\'erlap is an upper bound of error on the amount of inconsistency that a query ET may accumulate. If a query ET's overlap is empty, then it is SR.  ... 
doi:10.1145/115790.115856 dblp:conf/sigmod/PuL91 fatcat:62dmge2mwjemfaohwxxwdwi3q4

Efficient lookup on unstructured topologies

Ruggero Morselli, Bobby Bhattacharjee, Aravind Srinivasan, Michael A. Marsh
2005 Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '05  
We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations, we show that the actual performance on realistic topologies is significantly better.  ...  We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies.  ...  Our analysis derived tight bounds for worst-case performance of LMS.  ... 
doi:10.1145/1073814.1073828 dblp:conf/podc/MorselliBSM05 fatcat:676qfjyuwbfblkgg3r6mzrhhua

Shared Memory in the Many-Core Age [chapter]

Stefan Nürnberger, Gabor Drescher, Randolf Rotta, Jörg Nolte, Wolfgang Schröder-Preikschat
2014 Lecture Notes in Computer Science  
This paper discusses implications of the many-core evolution and derives a set of reusable elementary operations for future software DSMs.  ...  With the evolution toward fast networks of many-core processors, the design assumptions at the basis of software-level distributed shared memory (DSM) systems change considerably.  ...  These can be efficient even with a large number of threads, but most rely on a fixed upper bound of participating threads [21] .  ... 
doi:10.1007/978-3-319-14313-2_30 fatcat:ah6h3rubebh4zj52w4wfnhaz2m

Efficient lookup on unstructured topologies

R. Morselli, B. Bhattacharjee, M.A. Marsh, A. Srinivasan
2007 IEEE Journal on Selected Areas in Communications  
We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations, we show that the actual performance on realistic topologies is significantly better.  ...  We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies.  ...  Our analysis derived tight bounds for worst-case performance of LMS.  ... 
doi:10.1109/jsac.2007.07007 fatcat:a2mljzecl5cljgxh7dwg3gzz6m

The OMLP family of optimal multiprocessor real-time locking protocols

Björn B. Brandenburg, James H. Anderson
2012 Design automation for embedded systems  
This bound is shown to be asymptotically tight with the introduction of the O(m) multiprocessor locking protocol (OMLP) family presented herein, which includes protocols that ensure an upper bound on maximum  ...  pi-blocking that is approximately within a factor of two of the lower bound.  ...  The first author was supported in part by a UNC Dissertation Completion Fellowship.  ... 
doi:10.1007/s10617-012-9090-1 fatcat:fvli2uh6pbfcrpr7eyz3mpapa4

SLO-Aware Deployment of Web Applications Requiring Strong Consistency Using Multiple Clouds

Chenhao Qu, Rodrigo N. Calheiros, Rajkumar Buyya
2015 2015 IEEE 8th International Conference on Cloud Computing  
Then it continuously optimizes the deployment in a certain time interval according to the changing workload and the current deployment plan.  ...  For applications using these database systems, it is essential to take both the network latencies to the end users and the communication overhead of the databases into account when selecting the hosting  ...  the number of required migrations t Redeployment interval U Upper bound of AV P R L Lower bound of AV P R W Unit AVPR gain threshold for migration if AV P R of the current deployment is below  ... 
doi:10.1109/cloud.2015.118 dblp:conf/IEEEcloud/QuCB15 fatcat:xszztouv6bcfrcfnmx27h3hpw4

Energy-Constrained Uncoordinated Multiple Access for Next-Generation Networks

F. Babich, G. Buttazzoni, F. Vatta, M. Comisso
2020 IEEE Open Journal of the Communications Society  
of a scheme, be it a pure NOMA, PR or combined NOMA/PR one.  ...  This paper analyzes the performance of a distributed joint power/packet diversity random access scheme in the presence of energy requirements.  ...  One may immediately notice that each bound is very tight to the corresponding actual success probability.  ... 
doi:10.1109/ojcoms.2020.3034747 fatcat:mo6om4ls4vhjvpozff266znn5m
« Previous Showing results 1 — 15 out of 1,821 results