NDLI: Decision optimal early-stopping k-set agreement in synchronous systems prone to send omission failures

Please wait, while we are loading the content...

2015 IEEE 21st Pacific Rim International Symposium on Dependable Computing (PRDC)

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing

2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing

2012 IEEE 18th Pacific Rim International Symposium on Dependable Computing

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing

2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing

2009 15th IEEE Pacific Rim International Symposium on Dependable Computing

2008 14th IEEE Pacific Rim International Symposium on Dependable Computing

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)

11th Pacific Rim International Symposium on Dependable Computing (PRDC'05)

Proceedings. 11th Pacific Rim International Symposium on Dependable Computing

11th Pacific Rim International Symposium on Dependable Computing - Copyright

Message from the General and Program Chairs

Dependable computing in the context of mobility, nomadicity, ubiquity, and pervasiveness

Why do software projects fail? Reasons and a solution using a Bayesian classifier to predict potential risk

Sigma: a fault-tolerant mutual exclusion algorithm in dynamic distributed systems subject to process crashes and memory losses

Intersecting sets: a basic abstraction for asynchronous agreement problems

Decision optimal early-stopping k-set agreement in synchronous systems prone to send omission failures

Privacy-preserving Bayesian network structure learning on distributed heterogeneous data

Simultaneous simulation of alternative system configurations

Availability assessment of SunOS/Solaris Unix systems based on syslogd and wtmpx log files: A case study

On-chip debugging-based fault emulation for robustness evaluation of embedded software components

Bayesian networks modeling for software inspection effectiveness

Application-based metrics for strategic placement of detectors

A hardware approach to concurrent error detection capability enhancement in COTS processors

Optimal fault-tolerant routing scheme for generalized hypercube

High-order syndrome testing for VLSI circuits

A new BIST solution for system-on-chip

A failure-aware model for estimating and analyzing the efficiency of Web services compositions

Code design and decoding methods for burst error locating codes

An evaluation of the virtual router redundancy protocol extension with load balancing

Formal development of software for tolerating transient faults

On the fully-informed communication-induced checkpointing protocol

Optimal choice of checkpointing interval for high availability

An improved scheme of index-based checkpointing

Compression/scan co-design for reducing test data volume, scan-in power dissipation and test application time

Partitioned cache shadowing for deep sub-micron (DSM) regime

Proxy cryptography for secure inter-domain information exchanges

Anomaly detection with high deviations for system security

A multi-faceted approach towards spam-resistible mail

A virtual modeling and a fast algorithm for grid service reliability

Research on architecture and design principles of COTS components based generic fault-tolerant computer

Bi-objective model for test-suite reduction based on modified condition/decision coverage

A reliable routing algorithm based on fuzzy applicability of F sets in MANET

An efficient approach to tolerating route errors in mobile ad hoc networks

A novel approach to kernel construction of China bridge CA

Optimizing service strategy for systems with deferred repair

Trust-enhanced alteration scenario for universal computer

Mining alarm database of telecommunication network for alarm association rules

On automating failure mode analysis and enhancing its integrity

A novel R/sup 2/-FLC dynamic buffer size tuner to support time-critical applications over the Internet by improving logical channel fault tolerance to shorten roundtrip time

Design of defect tolerant Wallace multiplier

Resilient state machine replication

Contribution of controller area networks controllers to masquerade failures

Local repair mechanisms for on-demand routing in mobile ad hoc networks

Centralized surveillance of unused address space by using virtual networks

A distributed location service for reducing query failures in geographic ad hoc routing

Server protection through dynamic patching

Detection of malicious transactions in DBMS

Dynamic window-based adaptive fault monitoring for ubiquitous computing systems

Research on control flags-based weighted authentication trustworthiness model

Towards push-of-a-button stability verification for discrete-time hybrid systems

Reliability prediction and assessment of fielded software based on multiple change-point models

A note on a simple equivalence between round-based synchronous and asynchronous models

Neural network based on dynamic tunneling technique for weather forecast

FPGA authentication header (AH) implementation for Internet appliances

Development of dependable real-time systems with Zerberus

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.

2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.

Proceedings 2001 Pacific Rim International Symposium on Dependable Computing

Proceedings. 2000 Pacific Rim International Symposium on Dependable Computing

Proceedings 1999 Pacific Rim International Symposium on Dependable Computing

Decision optimal early-stopping k-set agreement in synchronous systems prone to send omission failures

Content Provider	IEEE Xplore Digital Library
Author	Parvedy, P.R. Raynal, M. Travers, C.
Copyright Year	2005
Description	Author affiliation: IRISA, Univ. de Rennes, France (Parvedy, P.R.; Raynal, M.; Travers, C.)
Abstract	The k-set agreement problem is a generalization of the consensus problem: each process proposes a value, and each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. This paper focuses on the k-set agreement problem in the context of synchronous systems where up to t < n processes can experience crash or send omission failures (n being the total number of processes). The paper presents a k-set agreement protocol for this failure model (the first to our knowledge) which has two main outstanding features. (1) It provides the following early deciding and stopping property: no process decides or halts after the round min(/spl lfloor/f/k/spl rfloor/ + 2, /spl lfloor/t/k/spl rfloor/ + 1) where f is the number of actual crashes (0 /spl les/ f /spl les/ t). (2) It is decision-optimal. This new optimality criterion, suited to the omission failure model, concerns the number of processes that decide, namely, the protocol forces all the processes that do not crash to decide (regardless of whether they commit omission faults or not). It is noteworthy that each of these properties (early deciding/stopping vs decision-optimality) is not obtained at the detriment of the other. Last but not least, the protocol enjoys another first-class property, namely, simplicity.
File Size	174585
File Format	PDF
ISBN	0769524923
DOI	10.1109/PRDC.2005.28
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-12-12
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer crashes Protocols Detectors Time measurement
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in