TY - JOUR

T1 - Contention-Free Complexity of Shared Memory Algorithms

AU - Alur, Rajeev

AU - Taubenfeld, Gadi

N1 - Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.

PY - 1996/4/10

Y1 - 1996/4/10

N2 - Worst-case time complexity is a measure of the maximum time needed to solve a problem over all runs. Contention-free time complexity indicates the maximum time needed when a process executes by itself, without competition from other processes. Since contention is rare in well-designed systems, it is important to design algorithms which perform well in the absence of contention. We study the contention-free time complexity of shared memory algorithms using two measures: step complexity, which counts the number of accesses to shared registers; and register complexity, which measures the number of different registers accessed. Depending on the system architecture, one of the two measures more accurately reflects the elapsed time. We provide lower and upper bounds for the contention-free step and register complexity of solving the mutual exclusion problem as a function of the number of processes and the size of the largest register that can be accessed in one atomic step. We also present bounds on the worst-case and contention-free step and register complexities of solving the naming problem. These bounds illustrate that the proposed complexity measures are useful in differentiating among the computational powers of different primitives.

AB - Worst-case time complexity is a measure of the maximum time needed to solve a problem over all runs. Contention-free time complexity indicates the maximum time needed when a process executes by itself, without competition from other processes. Since contention is rare in well-designed systems, it is important to design algorithms which perform well in the absence of contention. We study the contention-free time complexity of shared memory algorithms using two measures: step complexity, which counts the number of accesses to shared registers; and register complexity, which measures the number of different registers accessed. Depending on the system architecture, one of the two measures more accurately reflects the elapsed time. We provide lower and upper bounds for the contention-free step and register complexity of solving the mutual exclusion problem as a function of the number of processes and the size of the largest register that can be accessed in one atomic step. We also present bounds on the worst-case and contention-free step and register complexities of solving the naming problem. These bounds illustrate that the proposed complexity measures are useful in differentiating among the computational powers of different primitives.

UR - http://www.scopus.com/inward/record.url?scp=0012720257&partnerID=8YFLogxK

U2 - 10.1006/inco.1996.0034

DO - 10.1006/inco.1996.0034

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0012720257

SN - 0890-5401

VL - 126

SP - 62

EP - 73

JO - Information and Computation

JF - Information and Computation

IS - 1

ER -