Dynamic load balancing on web-server systems

Valeria Cardellini; Michele Colajanni; Philip S. Yu

doi:10.1109/4236.769420

IEEE Internet Computing

Review

01 Dec 1999

Dynamic load balancing on web-server systems

View publication

Abstract

Distributed architectures support increased loads on popular Web sites by dispatching client requests transparently among multiple server nodes. This article evaluates several possible approaches. ©1999 IEEE.

Conference paper

Effective estimation of posterior probabilities: Explaining the accuracy of randomized decision tree approaches

Wei Fan, Ed Greengrass, et al.

ICDM 2005

Paper

On optimal processor allocation to support pipelined hash joins

Ming-Ling Lo, Ming-Syan Syan Chen, et al.

SIGMOD Record

Conference paper

SPADE: The system S declarative stream processing engine

Buǧra Gedik, Henrique Andrade, et al.

SIGMOD 2008

Conference paper

Scheduling parallelizable tasks to minimize average response time

John Turek, Walter Ludwig, et al.

SPAA 1994

View all publications

Abstract

Related

Effective estimation of posterior probabilities: Explaining the accuracy of randomized decision tree approaches

On optimal processor allocation to support pipelined hash joins

SPADE: The system S declarative stream processing engine

Scheduling parallelizable tasks to minimize average response time