Sciweavers

79 search results - page 13 / 16
» Queues, stores, and tableaux
Sort
View
DEBS
2008
ACM
14 years 12 months ago
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the dist...
Kresimir Pripuzic, Ivana Podnar Zarko, Karl Aberer
CAL
2007
14 years 10 months ago
Physical Register Reference Counting
—Several recently proposed techniques including CPR (Checkpoint Processing and Recovery) and NoSQ (No Store Queue) rely on reference counting to manage physical registers. Howeve...
A. Roth
MICRO
2003
IEEE
132views Hardware» more  MICRO 2003»
15 years 3 months ago
Checkpoint Processing and Recovery: Towards Scalable Large Instruction Window Processors
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...
Haitham Akkary, Ravi Rajwar, Srikanth T. Srinivasa...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 10 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
MOBICOM
2006
ACM
15 years 4 months ago
Status packet deprecation and store-forward routing in AUSNet
AUSNet is a functional network of autonomous undersea vehicles. We present two novel algorithms to enhance AUSNet. In live inwater testing, a packet queueing problem in which stal...
Matthew M. Haag, Emmanuel Agu, Rick Komerska, Stev...