Sciweavers

234 search results - page 44 / 47
» Dynamic time sharing: a new approach for congestion manageme...
Sort
View
SOSP
2003
ACM
15 years 6 months ago
Capriccio: scalable threads for internet services
This paper presents Capriccio, a scalable thread package for use with high-concurrency servers. While recent work has advocated event-based systems, we believe that threadbased sy...
J. Robert von Behren, Jeremy Condit, Feng Zhou, Ge...
ICS
2005
Tsinghua U.
15 years 3 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
WSC
2000
14 years 11 months ago
SNOOPy Calendar Queue
Discrete event simulations often require a future event list structure to manage events according to their timestamp. The choice of an efficient data structure is vital to the per...
Kah Leong Tan, Ian Li-Jin Thng
USENIX
2007
14 years 12 months ago
MapJAX: Data Structure Abstractions for Asynchronous Web Applications
Data Structure Abstractions for Asynchronous Web Applications Daniel S. Myers MIT CSAIL Jennifer N. Carlisle MIT CSAIL James A. Cowling MIT CSAIL Barbara H. Liskov MIT CSAIL The c...
Daniel S. Myers, Jennifer N. Carlisle, James A. Co...
86
Voted
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
15 years 10 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer