{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T00:40:03Z","timestamp":1736642403627,"version":"3.32.0"},"reference-count":24,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,24]],"date-time":"2006-10-24T00:00:00Z","timestamp":1161648000000},"content-version":"vor","delay-in-days":4893,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency: Pract. Exper."],"published-print":{"date-parts":[[1993,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In a distributed system, data servers (file systems and databases) can easily become bottlenecks. We propose an approach to offloading data access requests from overloaded data servers to nodes that are Idle or less busy. This approach is referred to as<jats:italic>remote caching<\/jats:italic>, and the idle or less busy nodes are called<jats:italic>mutual servers<\/jats:italic>as they help out the busy server nodes on data accesses. In addition to server and client local caches, frequently accessed data are cached in the main memory of mutual servers, thus improving the data access time in the system. We evaluate several data propagation strategics among data servers and mutual servers. These include policies in which senders are active\/passive and receivers are active\/passive in initiating data propagation. For example, an active sender takes the initiative to offload data onto a passive receiver. Simulation results show that the active\u2010sender\/passive\u2010receiver policy is the method of choice In most cases. Active\u2010Sender policies are best able to exploit the main memory of other Idle nodes in the expected normal condition where some nodes are overloaded and others are less loaded. AH active policies perform far better than the policy without remote caching even in the degenerated case where each node is equally loaded.<\/jats:p>","DOI":"10.1002\/cpe.4330050403","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T06:31:22Z","timestamp":1163831482000},"page":"239-256","source":"Crossref","is-referenced-by-count":2,"title":["Performance comparison of dynamic policies for remote caching"],"prefix":"10.1002","volume":"5","author":[{"given":"Calton","family":"Pu","sequence":"first","affiliation":[]},{"given":"Danilo","family":"Florissi","sequence":"additional","affiliation":[]},{"given":"Patricia","family":"Scares","sequence":"additional","affiliation":[]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Kun\u2010Luno","family":"Wu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,24]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/77648.77653"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/35037.35059"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(86)90008-8"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/356876.356883"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1985.232830"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"R.Mukkamala S. C.BruellandR. K.Shultz \u2018Design of partially replicated distributed database systems: An integrated methodology\u2019 inProc. of 1988 ACM SIGMETRICS May1988. pp.187\u2013196.","DOI":"10.1145\/55595.55617"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/35037.42183"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"M. J.Carey M. M.Franklin M.Livny andE. J.Shekita \u2018Data caching tradeoffs in client\/server DBMS architecture\u2019 inProc. of 1991 ACM S1GMOD 1991 pp.357\u2013366.","DOI":"10.1145\/119995.115854"},{"key":"e_1_2_1_10_2","unstructured":"M. J.Franklin M. J.CareyandM.Livny \u2018Global memory management in client\u2010server DBMS architecture\u2019 inProc. of 18th VLDB 1992 pp.596\u2013609."},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"A.DanandP. S.Yu \u2018Performance analysis of coherency control policies through lock retention\u2019 inProc. of 1992 ACM SIGMOD 1992 pp.114\u2013123.","DOI":"10.1145\/130283.130305"},{"key":"e_1_2_1_12_2","unstructured":"D.ComerandJ.Griffioen \u2018A new design for distributed systems: The remote memory model\u2019 in Proc. of the Summer 1990 Usenix Symposium 1990."},{"key":"e_1_2_1_13_2","unstructured":"E. W.FeltenandJ.Zahorjan \u2018Issues in the implementation of a remote memory paging system\u2019. Technical Report TR 91\u201003\u201009 Department of Computer Science & Engineering University of Washington March1991."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/75104.75105"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"A.Leff P. S.YuandJ. L.Wolf \u2018Policies for efficient memory utilization in a remote caching architecture\u2019 inProc. of the 1st Int. Conference on Parallel and Distributed Information Systems 1991. pp.198\u2013207.","DOI":"10.1109\/PDIS.1991.183103"},{"key":"e_1_2_1_16_2","unstructured":"A.Leff J. L.WolfandP. S.Yu \u2018Distributed object replication algorithms for a remote caching architecture\u2019 inProc. of Int. Conf. on Parallel Processing 1992 pp.II\u2010114\u2013II\u2010123."},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"A.Leff J. L.WolfandP. S.Yu \u2018LRU\u2010based replication algorithms in a LAN remote caching architecture\u2019 in Proc. of 17th Conf. on Local Computer Networks Sept.1992 pp.244\u2013253.","DOI":"10.1109\/LCN.1992.228125"},{"key":"e_1_2_1_18_2","unstructured":"A.Leff J. L.WolfandP. S.Yu \u2018Replication algorithms in a remote caching architecture\u2019 IEEE Trans. Parallel and Distributed Systems to be published."},{"volume-title":"Simulating Computer Systems","year":"1987","author":"MacDougall M. H.","key":"e_1_2_1_19_2"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3916.3988"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/1994.2207"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.42736"},{"key":"e_1_2_1_23_2","unstructured":"A.Leff C.PuandF.Korz \u2018Cache performance in server\u2010based and symmetric database architectures\u2019 inProc. of the ISMM Int. Conf. on Parallel and Distributed Computing and Systems 1990."},{"key":"e_1_2_1_24_2","unstructured":"C.Pu A.Leff F.KorzandS. W.Chen \u2018Valued redundancy\u2019 inProc. of the Workshop on Management of Replicated Data 1990."},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/6420.6423"}],"container-title":["Concurrency: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.4330050403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.4330050403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T00:06:50Z","timestamp":1736640410000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.4330050403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["10.1002\/cpe.4330050403"],"URL":"https:\/\/doi.org\/10.1002\/cpe.4330050403","archive":["Portico"],"relation":{},"ISSN":["1040-3108","1096-9128"],"issn-type":[{"type":"print","value":"1040-3108"},{"type":"electronic","value":"1096-9128"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}