NDLI: Adaptive and efficient mutual exclusion (extended abstract)

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

Distributed algorithms in TLA (abstract)

A middleware overview: goals, research issues, and coded examples (abstract)

Data communications vs. distributed computing (abstract)

How computer architecture trends may affect future distributed systems: from infiniBand clusters to inter-processor speculation (abstract)

Towards robust distributed systems (abstract)

Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

Optimal smoothing schedules for real-time streams (extended abstract)

Average-case analysis of greedy packet scheduling (extended astract)

Sparse communication networks and efficient routing in the plane (extended abstract)

Compact roundtrip routing in directed networks (extended abstract)

Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions

Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)

Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract)

Adaptive and efficient mutual exclusion (extended abstract)

Assigning labels in unknown anonymous networks (extended abstract)

The wakeup problem in synchronous broadcast systems (extended abstract)

Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract)

Clock synchronization with faults and recoveries (extended abstract)

k-set agreement with limited accuracy failure detectors

Garbage collection of timestamped data in Stampede

On the interconnection of causal memory systems

Distributed reconfiguration of metamorphic robot chains

1/k phase stamping for continuous shared data (extended abstract)

$Π^{2}$ -- a generic proxy platform for wireless access and mobility in CORBA

High performance adaptive middleware for CORBA-based systems

Efficient atomic broadcast using deterministic merge

Achieving scalability and expressiveness in an Internet-scale event notification service

X-ability: a theory of replication

Debugging distributed programs using controlled re-execution

Self-stabilizing token circulation on asynchronous uniform unidirectional rings

Stable and fault-tolerant object allocation

Resettable vector clocks

Efficient generation of all regular non-dominated coteries

Indulgent algorithms (preliminary version)

Fast deterministic consensus in a noisy environment

Stability of long-lived consensus (extended abstract)

Toward a theory of maximally concurrent programs (shortened version)

A verification technique for self-stabilizing algorithms based on Ljapunov's ”Second Method“ (brief announcement)

Time and message-efficient S-based consensus (brief announcement)

Self-stabilization—beyond the token ring circulation (brief announcement)

Optimal implementation of the weakest failure detector for solving consensus (brief announcement)

Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement)

Deterministic distributed resource discovery (brief announcement)

Compact routing with stretch factor of less than three (brief announcement)

Specification, implementation and application of randomized regular registers (brief announcement)

Distributed cooperation in the absence of communication (brief announcement)

Average probe complexity of non-dominated coteries (brief announcement)

Fast protocol transition in a distributed environment (brief announcement)

Adaptive and efficient mutual exclusion (extended abstract)

Content Provider	ACM Digital Library
Author	Attiya, Hagit Bortnikov, Vita
Abstract	A distributed algorithm is adaptive if its performance depends on k, the number of processes that are concurrently active during the algorithm execution (rather than on n, the total number of processes). This paper presents adaptive algorithm for mutual exclusion using only read and write operations.The worst case step complexity cannot be a measure for the performance of mutual exclusion algorithms, because it is always unbounded in the presence of contention. Therefore, a number of different parameters are used to measure the algorithm's performance: The remote step complexity is the maximal number of steps performed by a process where a wait is counted as one step. The system response time is the time interval between subsequent entries to the critical section, where one time unit is the minimal interval in which every active process performs at least one step.The algorithm presented here has O(k) remote step complexity and O(log k) system response time, where k is the point contention. The space complexity of this algorithm is O(nN), where N is the range of processes' names.The space complexity of all previously known adaptive algorithms for various long-lived problems depends on N. We present a technique that reduces the space complexity of our algorithm to be a function of n, while preserving the other performance measures of the algorithm.
Starting Page	91
Ending Page	100
Page Count	10
File Format	PDF
ISBN	1581131836
DOI	10.1145/343477.343525
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2000-07-16
Publisher Place	New York
Access Restriction	Subscribed
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