The impact of timing on linearizability in counting networks

Counting networks form a new class of distributed, low-contention data structures made up of interconnected balancers, and are suitable for solving a variety of multiprocessor synchronization problems that can be expressed as counting problems. A linearizable counting network guarantees that the order of the values it returns respects the real-time order they were requested. Linearizability significantly raises the capabilities of the network, but at a possible price in network size or synchronization support. In this paper, we further pursue the systematic study of the impact of timing on linearizability for counting networks, along a research line initiated by Lynch et al. (1996). We consider two basic timing models: the instantaneous balancer model, in which the transition of a token from an input to an output port of a balancer is modeled as an instantaneous event, and the periodic balancer model, where balancers send out tokens at a fixed rate. We also consider lower and upper bounds on the delays incurred by wires connecting the balancers. We present necessary and sufficient conditions for linearizability in the form of precise inequalities that involve timing parameters and identify structural parameters of the counting network, which may be of more general interest. Our results significantly extend and strengthen previous impossibility and possibility results on linearizability in counting networks (Herlihy et al., 1990; Lynch et al., 1996).

[1]  Maurice Herlihy,et al.  Counting networks , 1994, JACM.

[2]  Charles U. Martel,et al.  On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[3]  Harold S. Stone.  Database Applications of the FETCH-AND-ADD Instruction , 1984, IEEE Transactions on Computers.

[4]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[5]  Nir Shavit,et al.  Elimination Trees and the Construction of Pools and Stacks , 1997, Theory of Computing Systems.

[6]  Hagit Attiya,et al.  Counting networks with arbitrary fan-out , 1992, SODA '92.

[7]  Moti Yung,et al.  Coins, weights and contention in balancing networks , 1994, PODC '94.

[8]  Nikolaos Hardavellas,et al.  Notes on Sorting and Counting Networks , 1993 .

[9]  Maurice Herlihy,et al.  Low contention load balancing on large-scale multiprocessors , 1992, SPAA '92.

[10]  Marios Mavronicolas,et al.  A combinatorial treatment of balancing networks , 1994, PODC '94.

[11]  Nancy A. Lynch,et al.  Counting networks are practically linearizable , 1996, PODC '96.

[12]  Injong Rhee,et al.  The impact of time on the session problem , 1992, PODC '92.

[13]  Nikolaos Hardavellas,et al.  Notes on Sorting and Counting Networks (Extended Abstract) , 1993, WDAG.

[14]  Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '94, Cape May, New Jersey, USA, June 27-29, 1994 , 1994, SPAA.

[15]  C. Greg Plaxton,et al.  Small-depth counting networks , 1992, STOC '92.

[16]  Larry Rudolph,et al.  Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors , 1983, TOPL.

[17]  Maurice Herlihy,et al.  A methodology for implementing highly concurrent data structures , 1990, PPOPP '90.

[18]  Nir Shavit,et al.  Diffracting trees , 1996, TOCS.

[19]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[20]  Maurice Herlihy,et al.  Contention in shared memory algorithms , 1993, JACM.

[21]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[22]  Marios Mavronicolas,et al.  A Combinatorial Treatment of Balancing Networks , 1996, J. ACM.

[23]  Maurice Herlihy,et al.  Counting networks and multi-processor coordination , 1991, STOC '91.

[24]  Nir Shavit,et al.  Diffracting trees (preliminary version) , 1994, SPAA '94.

[25]  R. Ladner,et al.  Building Counting Networks from Larger Balancers Technical Report # 93-04-09 , 1993 .

[26]  Nir Shavit,et al.  Elimination trees and the construction of pools and stacks: preliminary version , 1995, SPAA '95.