Browsing by Author "Busch, Costas"
Now showing items 115 of 15

Article
A combinatorial characterization of properties preserved by antitokens
Busch, Costas; Demetriou, Neophytos; Herlihy, M.; Mavronicolas, Marios (2000)Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distribution of the tokens on the network’s ...

Article
A combinatorial treatment of balancing networks
Busch, Costas; Mavronicolas, Marios (1996)Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348358, May 1991), represent a new class of distributed, lowcontention data structures ...

Article
The cost of concurrent, lowcontention Read&Modify&Write
Busch, Costas; Mavronicolas, Marios; Spirakis, Paul G. (2005)The possibility or impossibility and the corresponding costs of devising concurrent, lowcontention implementations of atomic Read&Modify&Write (or RMW) operations in a distributed system were addressed. A natural class ...

Article
Direct routing: Algorithms and complexity
Busch, Costas; MagdonIsmail, M.; Mavronicolas, Marios; Spirakis, Paul G. (2006)Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct ...

Article
Direct routing: Algorithms and complexity
Busch, Costas; MagdonIsmail, M.; Mavronicolas, Marios; Spirakis, Paul G. (2004)Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...

Article
Efficient bufferless packet switching on trees and leveled networks
Busch, Costas; MagdonIsmail, M.; Mavronicolas, Marios (2007)In bufferless networks the packets cannot be buffered while they are in transit

Conference Object
Efficient counting network
Busch, Costas; Mavronicolas, Marios (1998)Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. Highperformance ...

Article
An efficient counting network
Busch, Costas; Mavronicolas, Marios (2010)We present a novel counting network construction, where the number of input wires w is smaller than or equal to the number of output wires t. The depth of our network is Θ(lg2w), which depends only on w. In contrast, the ...

Article
Impossibility results for weak threshold networks
Busch, Costas; Mavronicolas, Marios (1997)It is shown that a weak threshold network (in particular, threshold network) of width w and depth d cannot be constructed from balancers of width p0, p1, . . . , pm1, if w does not divide Pd, where P is the least common ...

Article
Nearoptimal hotpotato routing on trees
Busch, Costas; MagdonIsmail, M.; Mavronicolas, Marios; Wattenhofer, R. (2004)In hotpotato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study onetomany batch routing problems ...

Conference Object
Strength of counting networks
Busch, Costas; Mavronicolas, Marios (1996)This paper shows that any counting network, made up of balancers whose fanin and fanout vary arbitrarily, is, indeed, strong enough to simultaneously support both Fetch&Increment and Fetch&Decrement operations, once each ...

Article
Supporting increment and decrement operations in balancing networks
Aiello, W.; Busch, Costas; Herlihy, M.; Mavronicolas, Marios; Shavit, N.; Touitou, D. (1999)Counting networks are a class of distributed data structures that support highly concurrent implementations of shared Fetch&Increment counters. Applications of these counters include shared pools and stacks, load balancing, ...

Article
Threshold counters with increments and decrements
Busch, Costas; Demetriou, Neophytos; Herlihy, M.; Mavronicolas, Marios (2002)A threshold counter is a shared data structure that assumes integer values. It provides two operations: Increment changes the current counter value from v to v+1, while Read returns the value [v/w], where v is the current ...

Article
Universal bufferless packet switching
Busch, Costas; MagdonIsmail, M.; Mavronicolas, Marios (2007)A packetswitching algorithm specifies the actions of the nodes in order to deliver packets in the network. A packetswitching algorithm is universal if it applies to any network topology and for any batch communication ...

Conference Object
Universal bufferless routing
Busch, Costas; MagdonIsmail, M.; Mavronicolas, Marios (2005)Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...