Sciweavers

2924 search results - page 196 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2006
IEEE
15 years 9 months ago
QoS-based management of multiple shared resource in dynamic real-time systems
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
Klaus H. Ecker, Frank Drews, Jens Lichtenberg
SPAA
2004
ACM
15 years 8 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
142
Voted
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 6 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ICPP
1999
IEEE
15 years 7 months ago
Performance Study of Token-Passing Protocol for Traffic Multiplicity in Optical Networks
This paper extended a mathematical technique to model the behaviour of token-passing protocol in a star-coupled wavelength-division multiplexing (WDM) optical network for traffic ...
S. Selvakennedy, Ashwani K. Ramani
ICDCN
2009
Springer
15 years 10 months ago
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The constructio...
Colette Johnen, Lisa Higham