Sciweavers

1128 search results - page 104 / 226
» A Case for Buffer Servers
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
ICSE
2007
IEEE-ACM
16 years 6 months ago
POLUS: A POwerful Live Updating System
This paper presents POLUS, a software maintenance tool capable of iteratively evolving running software into newer versions. POLUS's primary goal is to increase the dependabi...
Haibo Chen, Jie Yu, Rong Chen, Binyu Zang, Pen-Chu...
NCA
2007
IEEE
16 years 20 days ago
Using Virtualization to Improve Software Rejuvenation
In this paper, we present an approach for software rejuvenation based on automated self-healing techniques that can be easily applied to off-the-shelf Application Servers and Inte...
Luís Moura Silva, Javier Alonso, Paulo Silv...
NCA
2005
IEEE
15 years 12 months ago
Using Residual Times to Meet Deadlines in M/G/C Queues
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...
IMC
2005
ACM
15 years 12 months ago
Predicting Short-Transfer Latency from TCP Arcana: A Trace-based Validation
In some contexts it may be useful to predict the latency for short TCP transfers. For example, a Web server could automatically tailor its content depending on the network path to...
Martin F. Arlitt, Balachander Krishnamurthy, Jeffr...