Sciweavers

388 search results - page 71 / 78
» Providing Memory QoS Guarantees for Real-Time Applications
Sort
View
SIGOPSE
1996
ACM
15 years 1 months ago
How to scale transactional storage systems
Applications of the future will need to support large numbers of clients and will require scalable storage systems that allow state to be shared reliably. Recent research in distr...
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul ...
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
15 years 9 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
CGF
2010
153views more  CGF 2010»
14 years 9 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
CCR
2008
94views more  CCR 2008»
14 years 9 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
SIGCOMM
2012
ACM
13 years 2 days ago
Multi-resource fair queueing for packet processing
Middleboxes are ubiquitous in today’s networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastl...
Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica