Sciweavers

309 search results - page 30 / 62
» Approximation algorithms for dynamic resource allocation
Sort
View
ICAC
2005
IEEE
14 years 1 months ago
Feedback-based Scheduling for Back-end Databases in Shared Dynamic Content Server Clusters
This paper introduces a self-configuring architecture for scaling the database tier of dynamic content web servers. We use a unified approach to load and fault management based ...
Gokul Soundararajan, Kaloian Manassiev, Jin Chen, ...
IM
2003
13 years 9 months ago
Performance Management for Cluster Based Web Services
: We present an architecture and prototype implementation of a performance management system for cluster-based web services. The system supports multiple classes of web services tr...
Ronald M. Levy, Jay Nagarajarao, Giovanni Pacifici...
TMC
2011
182views more  TMC 2011»
13 years 2 months ago
Dynamic Time Slot Partitioning for Multimedia Transmission in Two-Hop Cellular Networks
—In recent years, there has been an exponential increase in the number of mobile phone users. In addition, a significant growth in the demand for high-rate multimedia services o...
Hrishikesh Venkataraman, Gabriel-Miro Muntean
NIPS
2004
13 years 9 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky
VLDB
1997
ACM
126views Database» more  VLDB 1997»
14 years 2 days ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson