• Corpus ID: 17461887

A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing

@inproceedings{Zhu1998ASF,
  title={A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing},
  author={Huican Zhu and Ben Smith and Tao Yang},
  booktitle={SIGMETRICS 1998},
  year={1998}
}
Clustering support with a single-system image view for large-scale Web servers is important to improve the system scalability in processing a large number of concurrent requests from Internet, especially when dynamic content generation using CGI or other protocols becomes increasingly popular. This paper studies a two-level scheduling framework with a master/slave architecture for clustering Web servers. Such an architecture has advantages in dynamic resource recruitment, fail-over management… 

Figures from this paper

Scheduling optimization for resource-intensive Web requests on server clusters

This paper proposes scheduling optimization for a Web server cluster with a master/slave architecture which separates tatic and dynamic content processing, showing that the proposed optimization using reservation-based scheduling can produce up to a 68% performance improvement.

Hierarchical resource management for Web server clusters with dynamic content

A resource management scheme for clustering Web servers with a master/slave (M/S) architecture and necessary scheduling optimization which considers the characteristics of Web workloads is developed and experimental results show that the proposed optimization can lead to a 68% performance improvement.

Efficient Support for Content-based Routing in Web Server Clusters

It is argued that the request routing mechanism in a cluster-based server should factor in the content of a request in making decisions, and a new mechanism to efficiently support content-aware routing in Web server clusters is designed and implemented.

Adaptive load sharing for clustered digital library servers

An optimization scheme is proposed in this paper to dynamically monitor the resource availability, use a low-cost communication strategy for updating load information among nodes, and schedule requests based on both I/O and computation load indices.

Adaptive load sharing for clustered digital library servers

An optimization scheme is proposed in this paper to dynamically monitor the resource availability, use a low-cost communication strategy for updating load information among nodes, and schedule requests based on both I/O and computation load indices.

Achieving Load Balance and Efiective Caching in Clustered Web Servers

This paper considers policies for distributing requests in clustered Web servers, wherein multiple server machines are configured to function as a single high(er) performance Web server, and finds that it is possible to achieve both good cache behaviour and good load balance.

Achieving Load Balance and E ective Cachingin Clustered Web

It is shown that use of current state information is necessary in achieving good load balance only when the achievable per-request bandwidth is not strongly network or client limited, and that it is possible to achieve both good cache behaviour and good load Balance.

Building an adaptable, fault tolerant, and highly manageable web server on clusters of non-dedicated workstations

  • Chu-Sing YangM. Luo
  • Computer Science
    Proceedings 2000 International Conference on Parallel Processing
  • 2000
This paper designs and implements an innovative approach that enables an ongoing request to be smoothly migrated to another node either in response to a node failure or overload, and designed and implemented a management system that enables the Web site manager to manage and maintain the distributed server as a single large system.

The Measurement of an Optimum Load Balancing Algorithm in a Master/Slave Architecture

This paper examines a number of simulated algorithms based on a master/slave architecture that uses the round robin algorithm combined with a reverse proxy of requests and shows some interesting findings useful for very heavily loaded web sites with a constant high umber of requests.

Scheduling to minimize average stretch without migration

The result shows that migration is not necessary to be competitive for minimizing average stretch; in contrast, it is proved that preemption is essential, even if randomization is allowed, and establishes a constant-factor lower bound on the competitive ratio of any online algorithm that minimizes average stretch without migration.

References

SHOWING 1-10 OF 36 REFERENCES

Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems

Traditional scheduling algorithms to the DNS are adapted, new policies are proposed, and their impact under different scenarios are examined.

Adaptive load sharing for clustered digital library servers

An optimization scheme is proposed in this paper to dynamically monitor the resource availability, use a low-cost communication strategy for updating load information among nodes, and schedule requests based on both I/O and computation load indices.

An analysis of Web server performance

Examination of the performance of Web servers under high CPU loads found that Web servers should reject enough requests so that the average load on the system is 95% or less of the maximum capacity in order to prevent latencies from becoming too large.

Cooperative caching of dynamic content on a distributed Web server

  • Vegard HolmedahlBen SmithTao Yang
  • Computer Science
    Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244)
  • 1998
This work has developed a distributed Web server called Swala, in which the nodes cooperatively cache the results of CGI requests, and the cache meta-data is stored in a replicated global cache directory.

Improving Web Server Performance by Caching Dynamic Data

The DynamicWeb cache is analyzed, which resulted in near-optimal performance for many cases and 58% of optimal performance in the worst case on systems which invoke server programs via CGI.

Task assignment in a distributed system (extended abstract): improving performance by unbalancing load

A new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V), is introduced, which provably decreases the mean task slowdown by significant factors where the more heavy-tailed the workload, the greater the improvement factor.

A Scalable HTTP Server: The NCSA Prototype

Locality-aware request distribution in cluster-based network servers

A simple, practical strategy for locality-aware request distribution (LARD), in which the front-end distributes incoming requests in a manner that achieves high locality in the back-ends' main memory caches as well as load balancing.

Cluster-based scalable network services

A general, layered architecture for building cluster-based scalable network services that encapsulates the above requirements for reuse, and a service-programming model based on composable workers that perform transformation, aggregation, caching, and customization (TACC) of Internet content is proposed.