TY - GEN
T1 - Proxy-and-hook
T2 - 2005 3rd IEEE International Conference on Industrial Informatics, INDIN
AU - Banditwattanawong, Thepparit
AU - Maruyama, Katsumi
AU - Hidaka, Soichiro
AU - Washizaki, Hironori
PY - 2005
Y1 - 2005
N2 - Scalability is a stringent requirement to every evolving information system. One of the key solutions to the scalability is caching. Most distributed object caching systems to date offer only coarse-grained mechanism in which an entire servant object graph is cached at once. Doing this minimizes cache miss frequency but imposes the long latency of cache miss resolution especially when the servant object graph is large or when the network load is high. Hence, it is preferable to compromise between this pair of performance metrics. Using fine-grained caching approach in which only necessary parts of the servant object graph are cached can satisfy both metrics at the same time. In this paper, we propose a framework that supports the incremental and automatic fine-grained caching of Java objects at run time in transparent manner to client. This goal is efficiently achieved by means of proxy and hook mechanisms. Experimental results demonstrate that our framework incurs the latency of cache miss resolution by only one third of a remote invocation latency of Java RMI. Furthermore, the proposed framework can deliver cache hit performance closely to that of Java local invocation's while outperforming Java RMI 1400 times.
AB - Scalability is a stringent requirement to every evolving information system. One of the key solutions to the scalability is caching. Most distributed object caching systems to date offer only coarse-grained mechanism in which an entire servant object graph is cached at once. Doing this minimizes cache miss frequency but imposes the long latency of cache miss resolution especially when the servant object graph is large or when the network load is high. Hence, it is preferable to compromise between this pair of performance metrics. Using fine-grained caching approach in which only necessary parts of the servant object graph are cached can satisfy both metrics at the same time. In this paper, we propose a framework that supports the incremental and automatic fine-grained caching of Java objects at run time in transparent manner to client. This goal is efficiently achieved by means of proxy and hook mechanisms. Experimental results demonstrate that our framework incurs the latency of cache miss resolution by only one third of a remote invocation latency of Java RMI. Furthermore, the proposed framework can deliver cache hit performance closely to that of Java local invocation's while outperforming Java RMI 1400 times.
KW - Distributed object caching
KW - Distributed system
KW - Java-based framework
KW - Object clustering
KW - Object graph
UR - http://www.scopus.com/inward/record.url?scp=33845321719&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845321719&partnerID=8YFLogxK
U2 - 10.1109/INDIN.2005.1560479
DO - 10.1109/INDIN.2005.1560479
M3 - Conference contribution
AN - SCOPUS:33845321719
SN - 0780390946
SN - 9780780390942
T3 - 2005 3rd IEEE International Conference on Industrial Informatics, INDIN
SP - 819
EP - 824
BT - Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006
Y2 - 10 August 2005 through 12 August 2005
ER -