NDLI: Robust network supercomputing without centralized control

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

Coordinated consensus in dynamic networks

Distributed graph coloring in a few rounds

The complexity of robust atomic storage

On the power of hardware transactional memory to simplify memory management

Distributed deterministic edge coloring using bounded neighborhood independence

Compact policy routing

Adaptively secure broadcast, revisited

Distributed k-core decomposition

Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions

A tight unconditional lower bound on distributed randomwalk computation

The universe of symmetry breaking tasks

Xheal: localized self-healing using expanders

Scalability versus semantics of concurrent FIFO queues

Tight bounds on information dissemination in sparse mobile networks

Error-free multi-valued consensus with byzantine failures

Resilience of mutual exclusion algorithms to transient memory faults

A complexity separation between the cache-coherent and distributed shared memory models

The space complexity of long-lived and one-shot timestamp implementations

Locally checkable proofs

Scalable rational secret sharing

Fork-consistent constructions from registers

Optimal-time adaptive strong renaming, with applications to counting

Minimum congestion mapping in a cloud

Rationality authority for provable rational behavior

Fast and compact self stabilizing verification, computation, and fault detection of an MST

Distributed computing with rules of thumb

Order optimal information spreading using algebraic gossip

Byzantine agreement with homonyms

Toward more localized local algorithms: removing assumptions concerning global knowledge

Structuring unreliable radio networks

From bounded to unbounded concurrency objects and back

Fault-tolerant spanners: better and simpler

Analyzing consistency properties for fun and profit

Unbounded contention resolution in multiple-access channels

The round complexity of distributed sorting: extended abstract

Conflict on a communication channel

Secure data structures based on multi-party computation

Stability of a peer-to-peer communication system

Incentive-compatible distributed greedy protocols

Time-efficient randomized multiple-message broadcast in radio networks

The impact of memory models on software reliability in multiprocessors

Tracking distributed aggregates over time-based sliding windows

Robust network supercomputing without centralized control

Sustaining collaboration in multicast despite rational collusion

Faster information dissemination in dynamic networks via network coding

Accurate byzantine agreement with feedback

On the hardness and approximation of minimum topic-connected overlay

Reliable end-user communication under a changing packet network protocol

B-neck: a distributed and quiescent max-min fair algorithm

A generalization of multiple choice balls-into-bins

Securing social networks

Information dissemination on multiple channels

A theory of goal-oriented communication

Parallel and distributed programming extensions for mainstream languages based on pi-calculus

Robust data sharing with key-value stores

A nonblocking set optimized for querying the minimum value

Network synchronization and localization based on stolen signals

Time bounds for shared objects in partially synchronous systems

Validity bound of regular registers with churn and byzantine processes

The inherent difficulty of timely primary-backup replication

Easy impossibility proofs for k-set agreement in message passing systems

Randomized compact routing in decomposable metrics

Solving the at-most-once problem with nearly optimal effectiveness

Partial reversal acyclicity

Robust network supercomputing without centralized control

Content Provider	ACM Digital Library
Author	Konwar, Kishori M. Shvartsman, Alexander A. Davtyan, Seda
Abstract	Traditional approaches to network supercomputing employ a master process and a large number of potentially undependable worker processes that must perform a collection of tasks on behalf of the master. In such a centralized scheme, the master process is a performance bottleneck and a single point of failure. This work develops an original approach that eliminates the master and instead uses a decentralized algorithm, where each worker is able to determine locally that all tasks have been performed, and to collect locally the results of all tasks. The failure model assumes that the average probability of a worker returning a wrong result is inferior to 1/2. A randomized synchronous algorithm for n processes and n tasks is presented. The algorithm terminates in Θ(log n) rounds, and it is proved that upon termination the workers know the results of all tasks with high probability, and that these results are correct with high probability. The message complexity of the algorithm is Θ(n log n), and the bit complexity is $O(n^{2}$ $log^{3}$ n).
Starting Page	293
Ending Page	294
Page Count	2
File Format	PDF
ISBN	9781450307192
DOI	10.1145/1993806.1993860
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-06-06
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Internet supercomputing Randomized algorithms Fault-tolerance Distributed algorithms
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