Pub Date : 1993-05-25DOI: 10.1109/ICDCS.1993.287717
J. Bolot, H. Afifi
The OSI (Open Systems Interconnection) X.500 directory system and other distributed naming systems use name caching to minimize the cost of name lookups for nonlocal names. The authors evaluate the impact of name caching on the performance of the OSI directory system. They consider the issues of cache sizing and cache replacement policies. It was found that a locality of reference property holds in name resolution requests, and hence name caching does increase performance significantly. Using trace-driven simulation, it is shown that small caches (smaller than 30 items) yield hit ratios up to 60% and decrease the average name resolution time by 60%. For small caches, the LRU (least recently used) replacement policy is better than other implementable policies. Large caches yield predictably larger hit ratios. For large caches, however, the LRU policy is not better than a random replacement policy. It was also found that partitioning the cache buffer into a small number of independent caches, each one associated with a different kind of name request, further decreases the average name resolution time.<>
{"title":"Evaluating caching schemes for the X.500 directory","authors":"J. Bolot, H. Afifi","doi":"10.1109/ICDCS.1993.287717","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287717","url":null,"abstract":"The OSI (Open Systems Interconnection) X.500 directory system and other distributed naming systems use name caching to minimize the cost of name lookups for nonlocal names. The authors evaluate the impact of name caching on the performance of the OSI directory system. They consider the issues of cache sizing and cache replacement policies. It was found that a locality of reference property holds in name resolution requests, and hence name caching does increase performance significantly. Using trace-driven simulation, it is shown that small caches (smaller than 30 items) yield hit ratios up to 60% and decrease the average name resolution time by 60%. For small caches, the LRU (least recently used) replacement policy is better than other implementable policies. Large caches yield predictably larger hit ratios. For large caches, however, the LRU policy is not better than a random replacement policy. It was also found that partitioning the cache buffer into a small number of independent caches, each one associated with a different kind of name request, further decreases the average name resolution time.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115194666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-01DOI: 10.1109/ICDCS.1993.287675
M. Little, D. McCue, S. Shrivastava
Presents a general model for persistent replicated object management and identify what metainformation about objects needs to be maintained by a naming and binding service to ensure that objects named by application programs are bound to only those object replicas which are in a mutually consistent state. These ideas are developed within the framework of a distributed system in which application programs are composed of atomic actions (atomic transactions) manipulating persistent (long-lived) objects.<>
{"title":"Maintaining information about persistent replicated objects in a distributed system","authors":"M. Little, D. McCue, S. Shrivastava","doi":"10.1109/ICDCS.1993.287675","DOIUrl":"https://doi.org/10.1109/ICDCS.1993.287675","url":null,"abstract":"Presents a general model for persistent replicated object management and identify what metainformation about objects needs to be maintained by a naming and binding service to ensure that objects named by application programs are bound to only those object replicas which are in a mutually consistent state. These ideas are developed within the framework of a distributed system in which application programs are composed of atomic actions (atomic transactions) manipulating persistent (long-lived) objects.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124656905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：