NDLI: Adaptive distributed sorting

Content Provider	IEEE Xplore Digital Library
Author	Alari, G. Bourgon, B. Chacko, J. Datta, A.K.
Copyright Year	1996
Description	Author affiliation: Unite d'Inf., Katholieke Univ., Leuven, Belgium (Alari, G.)
Abstract	The paper presents a fault tolerant distributed sorting algorithm designed to operate in a network with a tree topology subject to transient faults, crashes and joins of both links and nodes. The distributed sorting problem can be informally described as follows: nodes cooperate to reach a global configuration, where every node, depending on its id, is assigned a specific final value taken from the set of the original values across all nodes. Each node has a initial non-corruptible id and value. Fault tolerance is achieved using Dijkstra's paradigm of self-stabilization. A self-stabilizing algorithm, regardless of the initial system state, will converge in finite time to a set of safe legitimate states through embedding fault tolerance without the need to recur to explicit exception handlers or backward recovery. Our solution is based on continuous information flow to provide each node with a consistent view of the system state. It requires the knowledge of n, the number of nodes in the system, in order to correctly stabilize and it has O(d) time complexity and O(n) memory requirement where d is the diameter of the tree network. The algorithm handles transient faults by weeding out false information in the system. Nodes can start with completely false information concerning the values, ids and final values in the system, yet the intended behavior is still achieved. Also, nodes and links are allowed to crash, provided the network remains connected. Additionally, new nodes and links can join at any time.
Starting Page	1
Ending Page	7
File Size	655569
Page Count	7
File Format	PDF
ISBN	0780332555
DOI	10.1109/PCCC.1996.493605
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-03-27
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Sorting Fault tolerant systems Fault tolerance Counting circuits Algorithm design and analysis Computer crashes Intrusion detection Software algorithms Hardware Convergence
Content Type	Text
Resource Type	Article

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

On node state reconstruction for fault tolerant distributed algorithms

A fault-tolerant distributed sorting algorithm in tree networks

Crash-resilient time-free eventual leadership

Verifying fault tolerance of distributed algorithms formally-an example

Fault-tolerant distributed simulation

Synchronous Consensus for dependent process failures

Reliable distributed sorting through the application-oriented fault tolerance paradigm

Convergence rate analysis of a fault-tolerant distributed consensus algorithm

A new fault tolerant distributed algorithm for longest paths in a DAG

Adaptive distributed sorting

Similar Documents

On node state reconstruction for fault tolerant distributed algorithms

A fault-tolerant distributed sorting algorithm in tree networks

Crash-resilient time-free eventual leadership

Verifying fault tolerance of distributed algorithms formally-an example

Fault-tolerant distributed simulation

Synchronous Consensus for dependent process failures

Reliable distributed sorting through the application-oriented fault tolerance paradigm

Convergence rate analysis of a fault-tolerant distributed consensus algorithm

A new fault tolerant distributed algorithm for longest paths in a DAG

Adaptive distributed sorting