skip to main content
10.1145/379539.379589acmconferencesArticle/Chapter ViewAbstractPublication PagesppoppConference Proceedingsconference-collections
Article

Efficiency vs. portability in cluster-based network servers

Published: 18 June 2001 Publication History

Abstract

Efficiency and portability are conflicting objectives for cluster-based network servers that distribute the clients' requests across the cluster based on the actual content requested. Our work is based on the observation that this efficiency vs. portability tradeoff has not been fully evaluated in the literature. To fill this gap, in this paper we use modeling and experimentation to study this tradeoff in the context of an interesting class of content-based network servers, the locality-conscious servers, under different inter-node communication subsystems. Based on our results, our main conclusion is that portability should be promoted in cluster-based network servers with low processor overhead, given its relatively low cost ($\leq$ 16%) in terms of throughput performance. For clusters with high processor overhead communication, efficiency should be the overriding concern, as the cost of portability can be very high (as high as 107% on 96 nodes). We also conclude that user-level communication can be useful even for non-scientific applications such as network servers.

References

[1]
M. Arlit and C. Williamson. Web Server Workload Characterization: The Search for Invariants. In Proceedings of the International Conference on Measurement and Modeling of Computer Systems, May 1996.]]
[2]
M. Aron, P. Druschel, and W. Zwaenepoel. Efficient Suppor for P-HTTP in Clus er-Based Web Servers. In Proceedings of USENIX '99 Technical Conference, June 1999.]]
[3]
M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable Content-Aware Request Distribution in Cluster-Based Network Servers. In Proceedings on USENIX '2000 Technical Conference, June 2000.]]
[4]
A. Beslavros, M. Crovella, J. Liu, and D. Martin. Distributed Packe Rewriting and its Application to Scalable Server Architectures. In Proceedings of the International Conference on Network Protocols, October 1998.]]
[5]
R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web journal, 2000. Earlier version published as TR 718, Department of Computer Science, University of Rochester, August 1999, Revised April 2000.]]
[6]
L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence and Implications. In Proceedings of IEEE InfoCom'99, pages 126-134, March 1999.]]
[7]
E. V. Carrera and R. Bianchini. Evaluating Cluster-Based Network Servers. In Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing, pages 63-70, August 2000.]]
[8]
F. Chong, R. Barua, F. Dahlgren, J. Kubiatowicz, and A. Agarwal. The Sensitivity of Communication Mechanisms of Bandwidth and Latency.In Proceedings of the 4th International Symposium on High-Performance Computer Architecture, January 1998.]]
[9]
Cisco LocalDirector. http://www.cisco.com/, 2000.]]
[10]
M. Dahlin, R. Yang, T. Anderson, and D. Paterson. Cooperative Caching: Using Remote Clien Memory of Improve File System Performance. In Proceedings of USENIX Symposium on Operating Systems Design and Implementation, November 1994.]]
[11]
D. M. Dias, W. Kish, R. Mukherjee, and R. Tewari. A Scalable and Highly Available Web Server. In Proceedings of COMPCON'96, pages 85-92, 1996.]]
[12]
L. Fan, P. Cao, J. Almeida, and A. Broder. Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. In Proceedings of ACM SIGCOMM '98, pages 254-265, 1998.]]
[13]
V. Holmedahl, B. Smith, and T. Yang. Cooperative Caching of Dynamic Content on a Distributed Web Server. In Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing, pages 243-250, July 1998.]]
[14]
IBM SecureWay Network Dispatcher. http://www.software.ibm.com/network/dispatcher, 2000.]]
[15]
R. Martin, A. Vahdat, D. Culler, and T. Anderson. Effects of Communication Latency, Overhead, and Bandwidth in a Cluster Architecture. In Proceedings of the 24th International Symposium on Computer Architecture, June 1997.]]
[16]
V. Pai, M. Aron, G. Banga, M. Svendsen, P. Druschel, W. Zwaenepoel, and E. Nahum. Locality-Aware Reques Distribution in Cluster-based Network Servers. In Proceedings of the 8th ACM Conference on Architectural Support for Programming Languages and Operating Systems, pages 205-216, October 1998.]]
[17]
V. Pai, P. Druschel, and W. Zwaenepoel. Flash: An Efficient and Portable Web Server. In Proceedings of USENIX '99 Technical Conference, June 1999.]]
[18]
M. Rangarajan and L. Ifode. Software Distributed Shared Memory over Virtual Interface Architecture: Implementation and Performance. In Proceedings of the 3rd Extreme Linux Workshop, October 2000.]]
[19]
Piranha Load-Balanced Web and FTP Clusters. http://www.redhat.com/support/wpapers/piranha/, 2000.]]
[20]
Resonate Cen ral Dispatch. http://www.resonateinc.com/,1999.]]
[21]
Y. Saito, B. Bershad, and H. Levy. Manageability, Availability and Performance in Porcupine: A Highly Scalable, Cluster-Based Mail Service. In Proceedings of 17th ACM Symposium on Operating Systems Principles, December 1999.]]
[22]
R. Steffs, S. Dwarkadas, L. Kontothanassis, U. Rencuzogullari, and M. Scott. The Effiecient of Network Total Order, Broadcast, and Remote-Write Capability on Network-Based Shared Memory Computing. In Proceedings of the 6th International Symposium on High-Performance Computer Architecture, January 2000.]]
[23]
H. Zhu, B. Smith, and T. Yang. A Scheduling Optimization for Resource-Intensive Web Requests on Server Clusters. In Proceedings of the 11th Annual Symposium on Parallel Algorithms and Architectures, pages 13-22, June 1999.]]

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
June 2001
142 pages
ISBN:1581133464
DOI:10.1145/379539
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 June 2001

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

PPoPP01
Sponsor:

Acceptance Rates

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media