C. Busch, N. Demetriou, M. Herlihy and M. Mavronicolas, \Threshold Counters with Increments and Decrements," Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity, C. Gavoille, J.-C. Bermond and A. Raspalid eds., pp. 47-61, Proceedings in Informatics 5, Carleton Scientic, Lacanau, France, July 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Combinatorial Characterization of Properties Preserved by.. - Busch, al. (2000) (Correct)
.... such problems, ########## have been introduced to implement the decrement operation [21] It has been shown that several kinds of networks that satisfy the #### ######### the ######### ######## and the ######### ######## for tokens alone preserve their properties when antitokens are introduced [2, 5, 21]. Thus, such networks are able to solve synchronization problems that require decrements. A fundamental question that has been left open is to formally characterize all properties of balancing networks that are preserved under the introduction of antitokens. In this work, we provide a simple, ....
....by Aspnes et al. 4]asanovel class of distributed data structures that provide highly concurrent, low contention solutions to a variety of synchronization problems. Balancing networks attract a lot of interest and attention due to their nice performance and scalability properties (see, e.g. [1, 2, 3, 5, 6, 7, 8, 14, 15, 16, 18, 19, 20, 21, 22, 23]) A balancing network is constructed from elementary switches with # input wires and # output wires, called (## #) balancers. As illustrated in Figure, a (## #) balancer accepts a stream of tokens on its # input wires. The # th token to enter the balancer leaves on output wire # mod # (where # ....
[Article contains additional citation context not shown here]
C. Busch, N. Demetriou, M. Herlihy and M. Mavronicolas, \Threshold Counters with Increments and Decrements," Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity, C. Gavoille, J.-C. Bermond and A. Raspalid eds., pp. 47-61, Proceedings in Informatics 5, Carleton Scientic, Lacanau, France, July 1999.
A Combinatorial Characterization of Properties.. - Busch, Demetriou, .. Self-citation (Busch Demetriou Herlihy Mavronicolas) (Correct)
....classes of balancing networks and properties of balancing networks. More speci cally, Aiello et al. considered boundedness properties, a generalization of the step and # smoothing properties. They showed that boundedness properties are preserved by the introduction of antitokens. Busch et al. [5] considered the threshold property and they showed that this property is also preserved by the introduction of antitokens. A fundamental question that was left open by the results in [2, 5, 16] is to formally characterize all properties of balancing networks that are preserved under the ....
....They showed that boundedness properties are preserved by the introduction of antitokens. Busch et al. 5] considered the threshold property and they showed that this property is also preserved by the introduction of antitokens. A fundamental question that was left open by the results in [2, 5, 16], is to formally characterize all properties of balancing networks that are preserved under the introduction of antitokens. In this work, we provide the rst answer to this fundamental question. We provide a simple, combinatorial characterization for all properties of balancing networks which are ....
[Article contains additional citation context not shown here]
C. Busch, N. Demetriou, M. Herlihy and M. Mavronicolas, \Threshold Counters with Increments and Decrements," ########### ## ### ### ############# ########## ## ########## ########### ### ############# ########### pp. 47-61, Lacanau, France, July 1999.
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