Enrique V. Carrera and Ricardo Bianchini (1999). Analytical and Experimental Evaluation of Cluster-Based Network Servers, Department of Computer Science, University of Rochester. http://citeseer.nj.nec.com/article/carrera99analytical.html  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Rd, Piscataway, NJ 08854 Abstract We consider the use of cooperative caching to manage the memories of cluster based servers. Over the last several years, a number of researchers have proposed locality conscious servers that implement content aware request distribution to address this problem [2, 17, 4, 5, 6]. During this development, it has become conventional wisdom that cooperative caching cannot match the performance of these servers [17] Unfortunately, while locality conscious servers provide very high performance, their request distribution algorithms are typically bound to specific ....

....memory architecture often makes building scalable services more difficult. In particular, if the memories of individual nodes are used as independent caches of disk content, servers perform well only when their working sets fit into the memory of a single node, limiting system scalability [17, 5]. To address this problem, a number of researchers have proposed locality conscious servers that implement contentaware request distribution [2, 17, 4, 5, 6] that is, these servers use information about the content being requested and the load at each node in the cluster to choose which node ....

[Article contains additional citation context not shown here]

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based Network Servers. World Wide Web Journal, 3(4), Dec. 2000.

....2001. Abstract We consider the use of cooperative caching to manage the memories of cluster based servers. Over the last several years, a number of researchers have proposed contentaware servers that implement locality conscious request distribution to address this memory management problem [2, 18, 4, 5, 8]. During this development, it has become conventional wisdom that cooperative caching cannot match the performance of these servers [18] Unfortunately, while content aware servers provide very high performance, their request distribution algorithms are typically bound to specific applications. ....

....memory architecture often makes building scalable services more difficult. In particular, if the memories of individual nodes are used as independent caches of disk content, servers perform well only when their working sets fit into the memory of a single node, limiting system scalability [18, 5]. To address this problem, a number of researchers have proposed content aware servers that implement localityand load conscious request distribution [2, 18, 4, 5, 8] that is, these servers use information about the content being requested and the load at each node in the cluster to choose which ....

[Article contains additional citation context not shown here]

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based Network Servers. World Wide Web Journal, 3(4), Dec. 2000.

....NJ 08854 Abstract We consider the use of cooperative caching to manage the memories of cluster based servers. Over the last several years, a number of researchers have proposed contentaware servers that implement locality conscious request distribution to address this memory management problem [2, 18, 4, 5, 8]. During this development, it has become conventional wisdom that cooperative caching cannot match the performance of these servers [18] Unfortunately, while content aware servers provide very high performance, their request distribution algorithms are typically bound to specific applications. ....

....memory architecture often makes building scalable services more difficult. In particular, if the memories of individual nodes are used as independent caches of disk content, servers perform well only when their working sets fit into the memory of a single node, limiting system scalability [18, 5]. To address this problem, a number of researchers have proposed content aware servers that implement localityand load conscious request distribution [2, 18, 4, 5, 8] that is, these servers use information about the content being requested and the load at each node in the cluster to choose which ....

[Article contains additional citation context not shown here]

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based Network Servers. World Wide Web Journal, 3(4), Dec. 2000.

....Rd, Piscataway, NJ 08854 Abstract We consider the use of cooperative caching to manage the memories of cluster based servers. Over the last several years, a number of researchers have proposed locality conscious servers that implement content aware request distribution to address this problem [2, 17, 4, 5, 6]. During this development, it has become conventional wisdom that cooperative caching cannot match the performance of these servers [17] Unfortunately, while locality conscious servers provide very high performance, their request distribution algorithms are typically bound to specific ....

....memory architecture often makes building scalable services more difficult. In particular, if the memories of individual nodes are used as independent caches of disk content, servers perform well only when their working sets fit into the memory of a single node, limiting system scalability [17, 5]. To address this problem, a number of researchers have proposed locality conscious servers that implement contentaware request distribution [2, 17, 4, 5, 6] that is, these servers use information about the content being requested and the load at each node in the cluster to choose which node ....

[Article contains additional citation context not shown here]

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based Network Servers. World Wide Web Journal, 3(4), Dec. 2000.

....is that we can approximate log(1 u) as u when u is small. 3 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious web server that has been shown to provide good performance in a wide range of scenarios [9, 10] Like other locality conscious servers [1, 4, 27], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efcient than serving it from disk, even a local disk. In PRESS, any node of the cluster can receive a client request and becomes the initial node for that request. When the ....

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215--229, December 2000.

....to spin endlessly to take over the CPU for some amount of time. 4 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious Web server that has been shown to provide good performance in a wide range of scenarios [7, 8] Like other locality conscious servers [27, 2, 4], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. In PRESS, any node of the cluster can receive a client request and becomes the initial node for that request. When ....

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215--229, December 2000.

....decision of keeping our model simple and only address single faults. 3 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious Web server that has been shown to provide good performance in a wide range of scenarios [7, 8] Like other locality conscious servers [27, 1, 4], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. In PRESS, any node of the cluster can receive a client request and becomes the initial node for that request. When ....

R. Bianchini and E. V. Carrera. Analytical and Exper- imental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215-229, December 2000.

....is that we can approximate log(1 u) as u when u is small. 3 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious web server that has been shown to provide good performance in a wide range of scenarios [9, 10] Like other locality conscious servers [1, 4, 27], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. In PRESS, any node of the cluster can receive a client request and becomes the initial node for that request. When ....

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215--229, December 2000.

....## # where # # ## ### # # ###### # . V. THE PRESS SERVER PRESS is a highly optimized yet portable cluster based locality conscious WWW server that has been shown to provide good performance in a wide range of scenarios [9] 10] Like other locality conscious servers [19] 20] 21] [22], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. In PRESS, any node of the cluster can receive a client request and becomes the initial node for that request. When ....

R. Bianchini and E. V. Carrera, "Analytical and Experimental Evaluation of Cluster-Based WWW Servers," World Wide Web Journal, vol. 3, no. 4, pp. 215--229, December 2000.

....between these assumptions is beyond the scope of this work. 3 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious WWW server that has been shown to provide good performance in a wide range of scenarios [10, 11] Like other locality conscious servers [35, 1, 9, 4], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. In PRESS, any node of the cluster can receive a client request and becomes the initial node for that request. When ....

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215--229, December 2000.

....to spin endlessly to take over the CPU for some amount of time. 4 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious Web server that has been shown to provide good performance in a wide range of scenarios [8, 9] Like other locality conscious servers [22, 2, 7, 4], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. Essentially, the server distributes HTTP requests across the cluster nodes based on cache locality and load balancing ....

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215--229, December 2000.

....to spin endlessly to take over the CPU for some amount of time. 4 The PRESS Server PRESS is a highly optimized yet portable cluster based locality conscious WWW server that has been shown to provide good performance in a wide range of scenarios [8, 9] Like other locality conscious servers [22, 2, 7, 4], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. Essentially, the server distributes HTTP requests across the cluster nodes based on cache locality and load balancing ....

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215--229, December 2000.

....on the computing resources of popular services available on the Internet. Clusters of commodity computers are currently being used to provide the scalability required by several of these services. Several researchers and companies have concerned themselves with the cluster based servers, e.g. [29, 31, 30, 24, 2, 3, 37, 11, 5, 12]. There are two main classes of servers in terms of how the clients requests are distributed across the cluster: content oblivious and content aware servers. In a content oblivious server the request distribution is based solely on a load metric, which is usually the number of open connections ....

....[12] Although WWW servers must service requests for both static and dynamic contents, in this paper we focus solely on PRESS as a server of static content (read only files) since this type of content puts the most stress on the intra cluster network. Just like other locality conscious servers [24, 3, 11, 5], PRESS is based on the observation that serving a request from any memory cache, even a remote cache, is substantially more efficient than serving it from disk, even a local disk. Essentially, the server distributes HTTP requests across the cluster nodes based on cache locality and load balancing ....

[Article contains additional citation context not shown here]

R. Bianchini and E. V. Carrera. Analytical and Experimental Evaluation of Cluster-Based WWW Servers. World Wide Web Journal, 3(4):215--229, December 2000.

....This paper evaluates this potential for a wide range of parameters. In addition, L2S seems to be the first network server to implement localityconscious distribution without involving a single point of failure or a potential bottleneck. This paper is based on an earlier technical report [10]. Most of the previous work on cluster based network servers has been focused on the load balancing issue. For instance, Katz et al. use round robin DNS for distributing the requests among their server s nodes [21] Certain commercial products, such as the Cisco Local Director [11] the IBM ....

E. V. Carrera and R. Bianchini. Analytical and Experimental Evaluation of Cluster-Based Network Servers. Technical Report 718, Department of Computer Science, University of Rochester, August 1999.

No context found.

Enrique V. Carrera and Ricardo Bianchini (1999). Analytical and Experimental Evaluation of Cluster-Based Network Servers, Department of Computer Science, University of Rochester. http://citeseer.nj.nec.com/article/carrera99analytical.html

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC