The Experts below are selected from a list of 9120 Experts worldwide ranked by ideXlab platform
Azer Bestavros - One of the best experts on this subject based on the ideXlab platform.
-
GreedyDual* Web caching algorithm: exploiting the two sources of Temporal Locality in Web request streams
Computer Communications, 2001Co-Authors: S Jin, Azer BestavrosAbstract:The relative importance of long-term popularity and short-term Temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of Temporal Locality that enables the identification of the relative strengths of these two sources of Temporal Locality in a reference stream. In [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University], we have proposed such a metric and have shown that Web reference streams differ significantly in the prevalence of these two sources of Temporal Locality. These findings underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevalence of these two sources of Temporal Locality. In this paper, we propose a novel cache replacement algorithm, GreedyDual^*, which is a generalization of GreedyDual-Size. GreedyDual^* uses the metrics proposed in [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University] to adjust the relative worth of long-term popularity versus short-term Temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual^* when compared to other Web cache replacement policies proposed in the literature.
-
sources and characteristics of web Temporal Locality
Modeling Analysis and Simulation On Computer and Telecommunication Systems, 2000Co-Authors: S Jin, Azer BestavrosAbstract:Temporal Locality of reference in Web request streams emerges from two distinct phenomena: the long-term popularity of Web documents and the short-term Temporal correlations of references. We show that the commonly-used distribution of inter-request times is predominantly determined by the power law governing the long-term popularity of documents. This inherent relationship tends to disguise the existence of short-term Temporal correlations. We propose a new and robust metric that enables accurate characterization of that aspect of Temporal Locality. Using this metric, we characterize the Locality of reference in a number of representative proxy cache traces. Our findings show that there are measurable differences between the degrees (and sources) of Temporal Locality across these traces.
-
Temporal Locality in Web Request Streams
2000Co-Authors: S Jin, Azer BestavrosAbstract:1. INTRODUCTION OQP7R S3T7T7P7UVU-W9SHXVXYP7ZV[ U-P]\D^ _`R _`XaS [5b c RdP7Z-e f b [ _hgEb PiW ZVe W0P]ZjXY_hP7U XY^9SHXM^9S?k P RdP7P7[._hl P7[ XY_`m9P7lnS3[ l.To^9S3ZYS TpXYP7ZV_hq7P7l r st^ P-W ZVPpk S3uhP][ T7P e fvUVe c.P#e f XY^ P7UYPiW ZVe W0P7ZjXY_`P7Uw^9S U-c.e3XY_`k3SHXYP7lxXY^ P l PpkEP]uhe W c.P7[ X e fvcyS3[ z!W ZVe3XYe5T7e uhU|{}S3[ l e WDXY_hc._`q?SHXY_he [ U XY^ P7ZVP7e fo~tXY^9SHXaP]\5W uhe _`X UYb To^W ZVe W0P7ZjXY_`P7U?rM-[ P UVb Tp^W ZVe WdP7ZjXz_`UtXY^ PwXYP7c.Wde ZYS3u u`e5T?S3uh_`Xz e fwZVP7fP7ZVP7[ T]P+P]\D^ _hR _XYP7l_h[ OQP7RZVP7gEb P7UVXyUjXYZVP?S3c.U7rs P7c.Wde ZYS3u uhe5T7S u`_`X,z _h[OQP]RZVP]g5b P7UjXiUVXYZVP7S c UaP7c.P]ZV P]U#fZVe cXtel _hUVXY_`[ T]X W ^ P7[ e c.P][9S XY^ P `3E ,pp Dpd5`3p}y d5d3 e f OQP7R!l eET7bD c.P][EXYU S3[ laXY^ P iV¢D3p}]p£]-D3V3D¤o3pY]`3}K3 i0e f5ZVP7fP7ZVP7[ T7P7U7r ¥wP7uh_h[ P?SHXY_h[ #RdP]X,¦P7P][yXY^ P]UYP§X,¦e#UYe b ZVT7P7UM_hU _hc.Wde ZjXoS3[EX R0P7T7S b UVP XY^ P]z!^9S7kEP#l _`©aP]ZVP7[EXw_hc W uh_hT7S3XY_`e [ U§f«e Z T?S3Tp^ _`[ S3[ l+ZVP7W u`_hT?SHXY_he [ W ZVe3XYe5T7e uhU7r st^ P-^ _h ^ u`zyUV¬ P]¦P7lyW0e W b uS3ZV_`Xz.e f OQP7Ryl e5T7b c P7[EXYU UYb P7UVXYU XY^ P¦b UYP¦e fduhe [ 3 }XYP7ZVc®f«ZVP]g5b P7[ T]z _h[ T?S3To^ _h[ S3[ l|ZVP]W uh_` T?SHXY_he [S3uh e ZV_`XY^ c U?d ^ _huhPiXY^ PiXYP7c W0e ZYS3u T]e ZVZVP]uSHXY_he [ Uae fvZVP7fP7Zj P7[ T7P7U-UYb P7UVXYU§XY^ Pib UVPie f UY^ e ZjXV }XYP7ZVc ZVP7UY_hl P][ T]z!_h[ fe ZVc.S3XY_`e [ r °[XY^ _`U W9S WdP7Zi¦PyUY^ e ±XY^9SHX XYP]c.Wde ZYS u uhe5T7S u`_`X,z2c.PpXYZV_hT7UiW ZVe3 W0e UVP7l|_h[ XY^ Ptuh_XYP7ZYSHXYb ZVP§S3ZVP¦b [9S R u`P¦XYeal P7uh_h[ P7S3XYPtRdP]XtP]P7[ XY^ P7UYP X,¦eaUYe b ZVT7P7U7r °[.W9S3ZjXY_hT7b uS3Z7 XY^ P§T7e c.c e [ u`z5 }b UYP7l|_h[ XYP7Zj
-
Temporal Locality in web request streams
2000Co-Authors: S Jin, Azer BestavrosAbstract:1. INTRODUCTION OQP7R S3T7T7P7UVU-W9SHXVXYP7ZV[ U-P]\D^ _`R _`XaS [5b c RdP7Z-e f b [ _hgEb PiW ZVe W0P]ZjXY_hP7U XY^9SHXM^9S?k P RdP7P7[._hl P7[ XY_`m9P7lnS3[ l.To^9S3ZYS TpXYP7ZV_hq7P7l r st^ P-W ZVPpk S3uhP][ T7P e fvUVe c.P#e f XY^ P7UYPiW ZVe W0P7ZjXY_`P7Uw^9S U-c.e3XY_`k3SHXYP7lxXY^ P l PpkEP]uhe W c.P7[ X e fvcyS3[ z!W ZVe3XYe5T7e uhU|{}S3[ l e WDXY_hc._`q?SHXY_he [ U XY^ P7ZVP7e fo~tXY^9SHXaP]\5W uhe _`X UYb To^W ZVe W0P7ZjXY_`P7U?rM-[ P UVb Tp^W ZVe WdP7ZjXz_`UtXY^ PwXYP7c.Wde ZYS3u u`e5T?S3uh_`Xz e fwZVP7fP7ZVP7[ T]P+P]\D^ _hR _XYP7l_h[ OQP7RZVP7gEb P7UVXyUjXYZVP?S3c.U7rs P7c.Wde ZYS3u uhe5T7S u`_`X,z _h[OQP]RZVP]g5b P7UjXiUVXYZVP7S c UaP7c.P]ZV P]U#fZVe cXtel _hUVXY_`[ T]X W ^ P7[ e c.P][9S XY^ P `3E ,pp Dpd5`3p}y d5d3 e f OQP7R!l eET7bD c.P][EXYU S3[ laXY^ P iV¢D3p}]p£]-D3V3D¤o3pY]`3}K3 i0e f5ZVP7fP7ZVP7[ T7P7U7r ¥wP7uh_h[ P?SHXY_h[ #RdP]X,¦P7P][yXY^ P]UYP§X,¦e#UYe b ZVT7P7UM_hU _hc.Wde ZjXoS3[EX R0P7T7S b UVP XY^ P]z!^9S7kEP#l _`©aP]ZVP7[EXw_hc W uh_hT7S3XY_`e [ U§f«e Z T?S3Tp^ _`[ S3[ l+ZVP7W u`_hT?SHXY_he [ W ZVe3XYe5T7e uhU7r st^ P-^ _h ^ u`zyUV¬ P]¦P7lyW0e W b uS3ZV_`Xz.e f OQP7Ryl e5T7b c P7[EXYU UYb P7UVXYU XY^ P¦b UYP¦e fduhe [ 3 }XYP7ZVc®f«ZVP]g5b P7[ T]z _h[ T?S3To^ _h[ S3[ l|ZVP]W uh_` T?SHXY_he [S3uh e ZV_`XY^ c U?d ^ _huhPiXY^ PiXYP7c W0e ZYS3u T]e ZVZVP]uSHXY_he [ Uae fvZVP7fP7Zj P7[ T7P7U-UYb P7UVXYU§XY^ Pib UVPie f UY^ e ZjXV }XYP7ZVc ZVP7UY_hl P][ T]z!_h[ fe ZVc.S3XY_`e [ r °[XY^ _`U W9S WdP7Zi¦PyUY^ e ±XY^9SHX XYP]c.Wde ZYS u uhe5T7S u`_`X,z2c.PpXYZV_hT7UiW ZVe3 W0e UVP7l|_h[ XY^ Ptuh_XYP7ZYSHXYb ZVP§S3ZVP¦b [9S R u`P¦XYeal P7uh_h[ P7S3XYPtRdP]XtP]P7[ XY^ P7UYP X,¦eaUYe b ZVT7P7U7r °[.W9S3ZjXY_hT7b uS3Z7 XY^ P§T7e c.c e [ u`z5 }b UYP7l|_h[ XYP7Zj
-
Temporal Locality in web request streams sources characteristics and caching implications
Measurement and Modeling of Computer Systems, 1999Co-Authors: S Jin, Azer BestavrosAbstract:Abstract Temporal Locality of reference in Web request streams emerges from two distinct phenomena: the popularity of Web objects and the {\em Temporal correlation} of requests. Capturing these two elements of Temporal Locality is important because it enables cache replacement policies to adjust how they capitalize on Temporal Locality based on the relative prevalence of these phenomena. In this paper, we show that Temporal Locality metrics proposed in the literature are unable to delineate between these two sources of Temporal Locality. In particular, we show that the commonly-used distribution of reference interarrival times is predominantly determined by the power law governing the popularity of documents in a request stream. To capture (and more importantly quantify) both sources of Temporal Locality in a request stream, we propose a new and robust metric that enables accurate delineation between Locality due to popularity and that due to Temporal correlation. Using this metric, we characterize the Locality of reference in a number of representative proxy cache traces. Our findings show that there are measurable differences between the degrees (and sources) of Temporal Locality across these traces, and that these differences are effectively captured using our proposed metric. We illustrate the significance of our findings by summarizing the performance of a novel Web cache replacement policy---called GreedyDual*---which exploits both long-term popularity and short-term Temporal correlation in an adaptive fashion. Our trace-driven simulation experiments (which are detailed in an accompanying Technical Report) show the superior performance of GreedyDual* when compared to other Web cache replacement policies.
John Lillis - One of the best experts on this subject based on the ideXlab platform.
-
Buffer tree synthesis with consideration of Temporal Locality, sink polarity requirements, solution cost, congestion, and blockages
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003Co-Authors: Miloš Hrkić, John LillisAbstract:We give an overview of a buffer tree synthesis package which pays particular attention to the following issues: routing and buffer blockages, minimization of interconnect and buffer costs, congestion, exploitation of Temporal Locality among the sinks, and addressing sink polarity requirements. Experimental results demonstrate the effectiveness of the tool in comparison with previously proposed techniques.
-
buffer tree synthesis with consideration of Temporal Locality sink polarity requirements solution cost and blockages
International Symposium on Physical Design, 2002Co-Authors: Milos Hrkic, John LillisAbstract:We give an overview of a buffer tree synthesis package which pays particular attention to the following issues: routing and buffer blockages, minimization of interconnect and buffer costs, exploitation of Temporal Locality among the sinks and addressing sink polarity requirements. Experimental results demonstrate the effectiveness of the tool in comparison with previously proposed techniques.
-
ISPD - Buffer tree synthesis with consideration of Temporal Locality, sink polarity requirements, solution cost and blockages
Proceedings of the 2002 international symposium on Physical design - ISPD '02, 2002Co-Authors: Miloš Hrkić, John LillisAbstract:We give an overview of a buffer tree synthesis package which pays particular attention to the following issues: routing and buffer blockages, minimization of interconnect and buffer costs, exploitation of Temporal Locality among the sinks and addressing sink polarity requirements. Experimental results demonstrate the effectiveness of the tool in comparison with previously proposed techniques.
S Jin - One of the best experts on this subject based on the ideXlab platform.
-
GreedyDual* Web caching algorithm: exploiting the two sources of Temporal Locality in Web request streams
Computer Communications, 2001Co-Authors: S Jin, Azer BestavrosAbstract:The relative importance of long-term popularity and short-term Temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of Temporal Locality that enables the identification of the relative strengths of these two sources of Temporal Locality in a reference stream. In [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University], we have proposed such a metric and have shown that Web reference streams differ significantly in the prevalence of these two sources of Temporal Locality. These findings underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevalence of these two sources of Temporal Locality. In this paper, we propose a novel cache replacement algorithm, GreedyDual^*, which is a generalization of GreedyDual-Size. GreedyDual^* uses the metrics proposed in [ACM Sigmetrics'00, June, 2000 (to appear), Computer Science Technical Report BUCS1999-014, Boston University] to adjust the relative worth of long-term popularity versus short-term Temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual^* when compared to other Web cache replacement policies proposed in the literature.
-
sources and characteristics of web Temporal Locality
Modeling Analysis and Simulation On Computer and Telecommunication Systems, 2000Co-Authors: S Jin, Azer BestavrosAbstract:Temporal Locality of reference in Web request streams emerges from two distinct phenomena: the long-term popularity of Web documents and the short-term Temporal correlations of references. We show that the commonly-used distribution of inter-request times is predominantly determined by the power law governing the long-term popularity of documents. This inherent relationship tends to disguise the existence of short-term Temporal correlations. We propose a new and robust metric that enables accurate characterization of that aspect of Temporal Locality. Using this metric, we characterize the Locality of reference in a number of representative proxy cache traces. Our findings show that there are measurable differences between the degrees (and sources) of Temporal Locality across these traces.
-
Temporal Locality in Web Request Streams
2000Co-Authors: S Jin, Azer BestavrosAbstract:1. INTRODUCTION OQP7R S3T7T7P7UVU-W9SHXVXYP7ZV[ U-P]\D^ _`R _`XaS [5b c RdP7Z-e f b [ _hgEb PiW ZVe W0P]ZjXY_hP7U XY^9SHXM^9S?k P RdP7P7[._hl P7[ XY_`m9P7lnS3[ l.To^9S3ZYS TpXYP7ZV_hq7P7l r st^ P-W ZVPpk S3uhP][ T7P e fvUVe c.P#e f XY^ P7UYPiW ZVe W0P7ZjXY_`P7Uw^9S U-c.e3XY_`k3SHXYP7lxXY^ P l PpkEP]uhe W c.P7[ X e fvcyS3[ z!W ZVe3XYe5T7e uhU|{}S3[ l e WDXY_hc._`q?SHXY_he [ U XY^ P7ZVP7e fo~tXY^9SHXaP]\5W uhe _`X UYb To^W ZVe W0P7ZjXY_`P7U?rM-[ P UVb Tp^W ZVe WdP7ZjXz_`UtXY^ PwXYP7c.Wde ZYS3u u`e5T?S3uh_`Xz e fwZVP7fP7ZVP7[ T]P+P]\D^ _hR _XYP7l_h[ OQP7RZVP7gEb P7UVXyUjXYZVP?S3c.U7rs P7c.Wde ZYS3u uhe5T7S u`_`X,z _h[OQP]RZVP]g5b P7UjXiUVXYZVP7S c UaP7c.P]ZV P]U#fZVe cXtel _hUVXY_`[ T]X W ^ P7[ e c.P][9S XY^ P `3E ,pp Dpd5`3p}y d5d3 e f OQP7R!l eET7bD c.P][EXYU S3[ laXY^ P iV¢D3p}]p£]-D3V3D¤o3pY]`3}K3 i0e f5ZVP7fP7ZVP7[ T7P7U7r ¥wP7uh_h[ P?SHXY_h[ #RdP]X,¦P7P][yXY^ P]UYP§X,¦e#UYe b ZVT7P7UM_hU _hc.Wde ZjXoS3[EX R0P7T7S b UVP XY^ P]z!^9S7kEP#l _`©aP]ZVP7[EXw_hc W uh_hT7S3XY_`e [ U§f«e Z T?S3Tp^ _`[ S3[ l+ZVP7W u`_hT?SHXY_he [ W ZVe3XYe5T7e uhU7r st^ P-^ _h ^ u`zyUV¬ P]¦P7lyW0e W b uS3ZV_`Xz.e f OQP7Ryl e5T7b c P7[EXYU UYb P7UVXYU XY^ P¦b UYP¦e fduhe [ 3 }XYP7ZVc®f«ZVP]g5b P7[ T]z _h[ T?S3To^ _h[ S3[ l|ZVP]W uh_` T?SHXY_he [S3uh e ZV_`XY^ c U?d ^ _huhPiXY^ PiXYP7c W0e ZYS3u T]e ZVZVP]uSHXY_he [ Uae fvZVP7fP7Zj P7[ T7P7U-UYb P7UVXYU§XY^ Pib UVPie f UY^ e ZjXV }XYP7ZVc ZVP7UY_hl P][ T]z!_h[ fe ZVc.S3XY_`e [ r °[XY^ _`U W9S WdP7Zi¦PyUY^ e ±XY^9SHX XYP]c.Wde ZYS u uhe5T7S u`_`X,z2c.PpXYZV_hT7UiW ZVe3 W0e UVP7l|_h[ XY^ Ptuh_XYP7ZYSHXYb ZVP§S3ZVP¦b [9S R u`P¦XYeal P7uh_h[ P7S3XYPtRdP]XtP]P7[ XY^ P7UYP X,¦eaUYe b ZVT7P7U7r °[.W9S3ZjXY_hT7b uS3Z7 XY^ P§T7e c.c e [ u`z5 }b UYP7l|_h[ XYP7Zj
-
Temporal Locality in web request streams
2000Co-Authors: S Jin, Azer BestavrosAbstract:1. INTRODUCTION OQP7R S3T7T7P7UVU-W9SHXVXYP7ZV[ U-P]\D^ _`R _`XaS [5b c RdP7Z-e f b [ _hgEb PiW ZVe W0P]ZjXY_hP7U XY^9SHXM^9S?k P RdP7P7[._hl P7[ XY_`m9P7lnS3[ l.To^9S3ZYS TpXYP7ZV_hq7P7l r st^ P-W ZVPpk S3uhP][ T7P e fvUVe c.P#e f XY^ P7UYPiW ZVe W0P7ZjXY_`P7Uw^9S U-c.e3XY_`k3SHXYP7lxXY^ P l PpkEP]uhe W c.P7[ X e fvcyS3[ z!W ZVe3XYe5T7e uhU|{}S3[ l e WDXY_hc._`q?SHXY_he [ U XY^ P7ZVP7e fo~tXY^9SHXaP]\5W uhe _`X UYb To^W ZVe W0P7ZjXY_`P7U?rM-[ P UVb Tp^W ZVe WdP7ZjXz_`UtXY^ PwXYP7c.Wde ZYS3u u`e5T?S3uh_`Xz e fwZVP7fP7ZVP7[ T]P+P]\D^ _hR _XYP7l_h[ OQP7RZVP7gEb P7UVXyUjXYZVP?S3c.U7rs P7c.Wde ZYS3u uhe5T7S u`_`X,z _h[OQP]RZVP]g5b P7UjXiUVXYZVP7S c UaP7c.P]ZV P]U#fZVe cXtel _hUVXY_`[ T]X W ^ P7[ e c.P][9S XY^ P `3E ,pp Dpd5`3p}y d5d3 e f OQP7R!l eET7bD c.P][EXYU S3[ laXY^ P iV¢D3p}]p£]-D3V3D¤o3pY]`3}K3 i0e f5ZVP7fP7ZVP7[ T7P7U7r ¥wP7uh_h[ P?SHXY_h[ #RdP]X,¦P7P][yXY^ P]UYP§X,¦e#UYe b ZVT7P7UM_hU _hc.Wde ZjXoS3[EX R0P7T7S b UVP XY^ P]z!^9S7kEP#l _`©aP]ZVP7[EXw_hc W uh_hT7S3XY_`e [ U§f«e Z T?S3Tp^ _`[ S3[ l+ZVP7W u`_hT?SHXY_he [ W ZVe3XYe5T7e uhU7r st^ P-^ _h ^ u`zyUV¬ P]¦P7lyW0e W b uS3ZV_`Xz.e f OQP7Ryl e5T7b c P7[EXYU UYb P7UVXYU XY^ P¦b UYP¦e fduhe [ 3 }XYP7ZVc®f«ZVP]g5b P7[ T]z _h[ T?S3To^ _h[ S3[ l|ZVP]W uh_` T?SHXY_he [S3uh e ZV_`XY^ c U?d ^ _huhPiXY^ PiXYP7c W0e ZYS3u T]e ZVZVP]uSHXY_he [ Uae fvZVP7fP7Zj P7[ T7P7U-UYb P7UVXYU§XY^ Pib UVPie f UY^ e ZjXV }XYP7ZVc ZVP7UY_hl P][ T]z!_h[ fe ZVc.S3XY_`e [ r °[XY^ _`U W9S WdP7Zi¦PyUY^ e ±XY^9SHX XYP]c.Wde ZYS u uhe5T7S u`_`X,z2c.PpXYZV_hT7UiW ZVe3 W0e UVP7l|_h[ XY^ Ptuh_XYP7ZYSHXYb ZVP§S3ZVP¦b [9S R u`P¦XYeal P7uh_h[ P7S3XYPtRdP]XtP]P7[ XY^ P7UYP X,¦eaUYe b ZVT7P7U7r °[.W9S3ZjXY_hT7b uS3Z7 XY^ P§T7e c.c e [ u`z5 }b UYP7l|_h[ XYP7Zj
-
Temporal Locality in web request streams sources characteristics and caching implications
Measurement and Modeling of Computer Systems, 1999Co-Authors: S Jin, Azer BestavrosAbstract:Abstract Temporal Locality of reference in Web request streams emerges from two distinct phenomena: the popularity of Web objects and the {\em Temporal correlation} of requests. Capturing these two elements of Temporal Locality is important because it enables cache replacement policies to adjust how they capitalize on Temporal Locality based on the relative prevalence of these phenomena. In this paper, we show that Temporal Locality metrics proposed in the literature are unable to delineate between these two sources of Temporal Locality. In particular, we show that the commonly-used distribution of reference interarrival times is predominantly determined by the power law governing the popularity of documents in a request stream. To capture (and more importantly quantify) both sources of Temporal Locality in a request stream, we propose a new and robust metric that enables accurate delineation between Locality due to popularity and that due to Temporal correlation. Using this metric, we characterize the Locality of reference in a number of representative proxy cache traces. Our findings show that there are measurable differences between the degrees (and sources) of Temporal Locality across these traces, and that these differences are effectively captured using our proposed metric. We illustrate the significance of our findings by summarizing the performance of a novel Web cache replacement policy---called GreedyDual*---which exploits both long-term popularity and short-term Temporal correlation in an adaptive fashion. Our trace-driven simulation experiments (which are detailed in an accompanying Technical Report) show the superior performance of GreedyDual* when compared to other Web cache replacement policies.
Milos Hrkic - One of the best experts on this subject based on the ideXlab platform.
-
buffer tree synthesis with consideration of Temporal Locality sink polarity requirements solution cost and blockages
International Symposium on Physical Design, 2002Co-Authors: Milos Hrkic, John LillisAbstract:We give an overview of a buffer tree synthesis package which pays particular attention to the following issues: routing and buffer blockages, minimization of interconnect and buffer costs, exploitation of Temporal Locality among the sinks and addressing sink polarity requirements. Experimental results demonstrate the effectiveness of the tool in comparison with previously proposed techniques.
Sam H. Noh - One of the best experts on this subject based on the ideXlab platform.
-
Characterization of Web reference behavior revisited: Evidence for Dichotomized Cache management
Lecture Notes in Computer Science, 2003Co-Authors: Hyokyung Bahnl, Sam H. NohAbstract:In this paper, we present the Dichotomized Cache Management (DCM) scheme for Web caches. The motivation of the DCM scheme is discovered by observing the Web reference behavior from the viewpoint of Belady's optimal replacement algorithm. The observation shows that 1) separate allocation of cache space for Temporal Locality and reference popularity better approximates the optimal algorithm, and 2) the contribution of Temporal Locality and reference popularity on the performance of caching is dependent on the cache size. With these observations, we devise the DCM scheme that provides a robust framework for on-line detection and allocation of cache space based on the marginal contribution of Temporal Locality and reference popularity. Trace-driven simulations with actual Web cache logs show that DCM outperforms existing schemes for various performance measures for a wide range of cache configurations.
-
ICOIN - Characterization of Web Reference Behavior Revisited: Evidence for Dichotomized Cache Management
Information Networking, 2003Co-Authors: Hyokyung Bahn, Sam H. NohAbstract:In this paper, we present the Dichotomized Cache Management (DCM) scheme for Web caches. The motivation of the DCM scheme is discovered by observing the Web reference behavior from the viewpoint of Belady’s optimal replacement algorithm. The observation shows that 1) separate allocation of cache space for Temporal Locality and reference popularity better approximates the optimal algorithm, and 2) the contribution of Temporal Locality and reference popularity on the performance of caching is dependent on the cache size. With these observations, we devise the DCM scheme that provides a robust framework for on-line detection and allocation of cache space based on the marginal contribution of Temporal Locality and reference popularity. Trace-driven simulations with actual Web cache logs show that DCM outperforms existing schemes for various performance measures for a wide range of cache configurations.
