Sciweavers

1068 search results - page 11 / 214
» On Space Bounded Server Algorithms
Sort
View
JACM
2006
92views more  JACM 2006»
13 years 7 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie
SEFM
2008
IEEE
14 years 1 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
ICPP
2002
IEEE
14 years 15 days ago
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
Xiaobo Zhou, Cheng-Zhong Xu
RTSS
2003
IEEE
14 years 25 days ago
Power-aware QoS Management in Web Servers
Power management in data centers has become an increasingly important concern. Large server installations are designed to handle peak load, which may be significantly larger than...
Vivek Sharma, Arun Thomas, Tarek F. Abdelzaher, Ke...
IPPS
2003
IEEE
14 years 25 days ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...