Sciweavers

646 search results - page 103 / 130
» Generalized efficiency bounds in distributed resource alloca...
Sort
View
AAAI
2000
15 years 3 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
WETICE
2009
IEEE
15 years 8 months ago
Cloud Computing and the Lessons from the Past
— The skyrocketing demand for a new generation of cloud-based consumer and business applications is driving the need for next generation of datacenters that must be massively sca...
Rao Mikkilineni, Vijay Sarathy
EUROSYS
2006
ACM
15 years 11 months ago
Database replication policies for dynamic content applications
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
Gokul Soundararajan, Cristiana Amza, Ashvin Goel
IPPS
2007
IEEE
15 years 8 months ago
A Performance Prediction Framework for Grid-Based Data Mining Applications
For a grid middleware to perform resource allocation, prediction models are needed, which can determine how long an application will take for completion on a particular platform o...
Leonid Glimcher, Gagan Agrawal
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 1 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter