W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit and D. Touitou, "Supporting Increment and Decrement Operations in Balancing Networks," Chicago Journal of Theoretical Computer Science, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Cost of Concurrent, Low-Contention Read-Modify-Write - Busch, Mavronicolas, Spirakis Self-citation (Busch Mavronicolas) (Correct)
No context found.
W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit and D. Touitou, "Supporting Increment and Decrement Operations in Balancing Networks," Chicago Journal of Theoretical Computer Science, 2000.
The Cost of Concurrent, Low-Contention Read&Modify&Write - Busch, Mavronicolas, Spirakis (2003) Self-citation (Busch Mavronicolas) (Correct)
No context found.
W. Aiello, C. Busch, M. Herlihy,M.Mavronicolas, N. Shavit and D. Touitou, "Supporting Increment and Decrement Operations in Balancing Networks," Chicago Journal of Theoretical Computer Science, 2000-4, December 14, 2000 (electronic).
A Survey on Counting Networks - Busch, Herlihy Self-citation (Busch Herlihy) (Correct)
....shape of a binary tree can support decrement operations, together with the increment operations. They did so by introducing a new type of token for the decrement operation named antitoken that represents the request for an increment of 1. Aiello, Busch, Herlihy, Mavronicolas, Shavit, and Touitou [2] generalized this result and showed that any counting network can support the decrement operation (including networks that use arbitrary width balancers and irregular balancers, see Sections 2.1, 2.5, and 2.6) 2.8 Contention Analysis Dwork, Herlihy, and Waarts [12] introduce a formal model for ....
AIELLO,W.,BUSCH,C.,HERLIHY,M.,MAVRONICOLAS,M.,SHAVIT, N., AND TOUITOU, D. Supporting increment and decrement operations in balancing networks. In Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS'99) (Trier, Germany, 1999). To appear.
A Survey on Counting Networks - Busch, Herlihy Self-citation (Busch Herlihy) (Correct)
....shape of a binary tree can support decrement operations, together with the increment operations. They did so by introducing a new type of token for the decrement operation named antitoken that represents the request for an increment of 1. Aiello, Busch, Herlihy, Mavronicolas, Shavit, and Touitou [2] generalized this result and showed that any counting network can support the decrement operation (including networks that use arbitrary width balancers and irregular balancers, see Sections 2.1, 2.5, and 2.6) 2.8 Contention Analysis Dwork, Herlihy, and Waarts [12] introduce a formal model for ....
AIELLO, W., BUSCH, C., HERLIHY, M., MAVRONICOLAS, M., SHAVIT, N., AND TOUITOU, D. Supporting increment and decrement operations in balancing networks. In Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS'99) (Trier, Germany, 1999). To appear.
Threshold Counters with Increments and Decrements - Busch, Demetriou, Herlihy.. (1999) (1 citation) Self-citation (Busch Herlihy Mavronicolas) (Correct)
....and exits on the preceding wire. Informally, an antitoken cancels the effect of the most recent token, and vice versa. Shavit and Touitou [10] proved that antitokens implement a Decrement operation for a restricted class of balancing networks called a counting tree. Subsequently, Aiello et al. [2] proved that antitokens are more powerful: they can be used to extend counting networks and smoothing networks to support decrements. More generally, they identified a broad class of properties, called boundedness properties, that are preserved by the introduction of antitokens; thus, if a ....
....alone, then it continues to satisfy that same property when traversed by tokens and antitokens. Being a threshold counter, however, is not a boundedness property, so different arguments are needed to reason about the behavior of threshold networks. The proof techniques employed by Aiello et al. [2] were purely combinatorial, centered around the concept of a fooling pair of inputs [2, Section 3] In this work, we adapt and extend these techniques to encompass both threshold networks and weak threshold networks (under the regularity assumption) within the structural class of balancing ....
[Article contains additional citation context not shown here]
W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, and D. Touitou, "Supporting Increment and Decrement Operations in Balancing Networks," Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, G. Meinel and S. Tison eds., pp. 377--386, Vol. 1563, Lecture Notes in Computer Science, Springer-Verlag, Trier, Germany, March 1999.
Threshold Counters with Increments and Decrements - Busch, Demetriou, Herlihy.. (1999) (1 citation) Self-citation (Busch Herlihy Mavronicolas) (Correct)
....sets the toggle b exits on the preceding wire. Informally, an antitoken cancels the effe most recent token, and vice versa. Shavit and Touitou [11] proved that antitokens implement a Decrem eration for a restricted class of balancing networks called a counting tr sequently, Aiello et al. [2] proved that antitokens are more powerful: t be used to extend counting networks and smoothing networks to suppo ments. More generally, they identified a broad class of properties, called edness properties, that are preserved by the introduction of antitokens; t balancing network satisfies any ....
....when t by tokens alone, then it continues to satisfy that same property when t by tokens and antitokens. Being a threshold counter, however, is not a b ness property, so different arguments are needed to reason about the beh threshold networks. The proof techniques employed by Aiello et al. [2] were purely combi centered around the concept of a fooling pair of inputs [2, Section 3] In th we adapt and extend these techniques to encompass both threshold netw weak threshold networks (under the regularity assumption) within the s class of balancing networks whose properties are preserved ....
[Article contains additional citation context not shown here]
W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Sha D. Touitou, "Supporting Increment and Decrement Operations in B Networks," Proceedings of the 16th International Symposium on T cal Aspects of Computer Science, G. Meinel and S. Tison eds., pp. 3 Vol. 1563, Lecture Notes in Computer Science, Springer-Verlag, Tr many, March 1999.
A Scalable Elimination-based Exchange Channel - III, Lea, Scott (2005) (Correct)
No context found.
W. Aiello, C. Busch, M. Herlihy, M. Mavronicolas, N. Shavit, and D. Touitou. Supporting Increment and Decrement Operations in Balancing Networks. In Chicago Journal of Theoretical Computer Science, Dec. 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC