article

Efficiency vs. portability in cluster-based network servers

Authors:

Enrique V. Carrera,

Ricardo BianchiniAuthors Info & Claims

ACM SIGPLAN Notices, Volume 36, Issue 7

Pages 113 - 122

https://doi.org/10.1145/568014.379589

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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[17]

V. Pai, P. Druschel, and W. Zwaenepoel. Flash: An Efficient and Portable Web Server. In Proceedings of USENIX '99 Technical Conference, June 1999.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

Cited By

Kaul SKumar YGhosh UAlnumay W(2021)Nature-inspired optimization algorithms for different computing systems: novel perspective and systematic reviewMultimedia Tools and Applications10.1007/s11042-021-11011-x81:19(26779-26801)Online publication date: 20-May-2021
https://doi.org/10.1007/s11042-021-11011-x
Mehta HKanungo PChandwani MMishra B(2011)Decentralized content aware load balancing algorithm for distributed computing environmentsProceedings of the International Conference & Workshop on Emerging Trends in Technology10.1145/1980022.1980102(370-375)Online publication date: 25-Feb-2011
https://dl.acm.org/doi/10.1145/1980022.1980102
Xu ZHan JBhuyan L(2007)Scalable and Decentralized Content-Aware Dispatching in Web Clusters2007 IEEE International Performance, Computing, and Communications Conference10.1109/PCCC.2007.358896(202-209)Online publication date: Apr-2007
https://doi.org/10.1109/PCCC.2007.358896
Show More Cited By

Index Terms

Recommendations

Efficiency vs. portability in cluster-based network servers
PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming

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. ...
Locality-aware request distribution in cluster-based network servers

We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information ...
Locality-aware request distribution in cluster-based network servers

We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 36, Issue 7

July 2001

143 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/568014

Issue’s Table of Contents

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
Chairmen:
Michael Heath
Univ. of Illinois, Illinois, IN
,
Andrew Lumsdaine
Indiana Univ.

Copyright © 2001 ACM.

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 June 2001

Published in SIGPLAN Volume 36, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
606
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kaul SKumar YGhosh UAlnumay W(2021)Nature-inspired optimization algorithms for different computing systems: novel perspective and systematic reviewMultimedia Tools and Applications10.1007/s11042-021-11011-x81:19(26779-26801)Online publication date: 20-May-2021
https://doi.org/10.1007/s11042-021-11011-x
Mehta HKanungo PChandwani MMishra B(2011)Decentralized content aware load balancing algorithm for distributed computing environmentsProceedings of the International Conference & Workshop on Emerging Trends in Technology10.1145/1980022.1980102(370-375)Online publication date: 25-Feb-2011
https://dl.acm.org/doi/10.1145/1980022.1980102
Xu ZHan JBhuyan L(2007)Scalable and Decentralized Content-Aware Dispatching in Web Clusters2007 IEEE International Performance, Computing, and Communications Conference10.1109/PCCC.2007.358896(202-209)Online publication date: Apr-2007
https://doi.org/10.1109/PCCC.2007.358896
Dong HSong LWang JYang J(2016)SSLSARD: A Request Distribution Technique for Distributed SSL Reverse ProxiesJournal of Communications10.12720/jcm.11.4.374-382Online publication date: 2016
https://doi.org/10.12720/jcm.11.4.374-382
Natarajan C(2014)Improving Service Performance in Cloud Computing with Network Memory VirtualizationRecent Advances in Information and Communication Technology10.1007/978-3-319-06538-0_23(233-243)Online publication date: 2014
https://doi.org/10.1007/978-3-319-06538-0_23
Gilly KJuiz CPuigjaner R(2011)An up-to-date survey in web load balancingWorld Wide Web10.1007/s11280-010-0101-514:2(105-131)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1007/s11280-010-0101-5
Chan KChu X(2008)Design of a Cluster-Based Web Server with Proportional Connection Delay Guarantee2008 IEEE International Conference on Communications10.1109/ICC.2008.1066(5692-5696)Online publication date: May-2008
https://doi.org/10.1109/ICC.2008.1066
Chae HSong HKim HLee K(2007)Efficient Cluster Server Construction and Management for Service OrientationThe KIPS Transactions:PartA10.3745/KIPSTA.2007.14-A.6.37114A:6(371-382)Online publication date: 31-Dec-2007
https://doi.org/10.3745/KIPSTA.2007.14-A.6.371
Vaidyanathan KJin HPanda D(2006)Exploiting RDMA operations for Providing Efficient Fine-Grained Resource Monitoring in Cluster-based Servers2006 IEEE International Conference on Cluster Computing10.1109/CLUSTR.2006.311916(1-10)Online publication date: Sep-2006
https://doi.org/10.1109/CLUSTR.2006.311916
Wang J(2006)A light-weight, collaborative temporary file system for clustered Web serversJournal of Parallel and Distributed Computing10.1016/j.jpdc.2005.12.00366:5(750-762)Online publication date: 1-May-2006
https://dl.acm.org/doi/10.1016/j.jpdc.2005.12.003
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents