Sciweavers

130 search results - page 8 / 26
» A Parallel Priority Queue with Constant Time Operations
Sort
View
ISCA
2002
IEEE
80views Hardware» more  ISCA 2002»
14 years 10 days ago
A Large, Fast Instruction Window for Tolerating Cache Misses
Instruction window size is an important design parameter for many modern processors. Large instruction windows offer the potential advantage of exposing large amounts of instructi...
Alvin R. Lebeck, Tong Li, Eric Rotenberg, Jinson K...
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
13 years 8 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
RSA
2006
144views more  RSA 2006»
13 years 7 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
CONEXT
2008
ACM
13 years 9 months ago
A priority-layered approach to transport for high bandwidth-delay product networks
High-speed organizational networks running over leased fiber-optic lines or VPNs suffer from the well-known limitations of TCP over long-fat pipes. High-performance protocols like...
Vidhyashankar Venkataraman, Paul Francis, Murali S...
ICDCS
1997
IEEE
13 years 11 months ago
Connection Admission Control for Hard Real-Time Communication in ATM Networks
Connection Admission Control (CAC) is needed in ATM networks to provide Quality of Service (QoS) guarantees to real-time connections. This paper presents a CAC scheme based on a b...
Qin Zheng, Tetsuya Yokotani, Tatsuki Ichihashi, Ya...