空间有界服务器算法的新边界

ACM-SE 33 Pub Date : 1995-03-17 DOI:10.1145/1122018.1122047

Stephen Hughes

{"title":"空间有界服务器算法的新边界","authors":"Stephen Hughes","doi":"10.1145/1122018.1122047","DOIUrl":null,"url":null,"abstract":"This paper studies the competitive factor of space bounded algorithms for the k-server problem operating in finite metric spaces. Specifically, two methods are developed for obtaining an upper bound on competitive factors of arbitrary space bounded algorithms. One of these methods is then used to show that an LRU-like algorithm is linearly-competitive on a uniform metric space.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new bound for space bounded server algorithms\",\"authors\":\"Stephen Hughes\",\"doi\":\"10.1145/1122018.1122047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the competitive factor of space bounded algorithms for the k-server problem operating in finite metric spaces. Specifically, two methods are developed for obtaining an upper bound on competitive factors of arbitrary space bounded algorithms. One of these methods is then used to show that an LRU-like algorithm is linearly-competitive on a uniform metric space.\",\"PeriodicalId\":349974,\"journal\":{\"name\":\"ACM-SE 33\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 33\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1122018.1122047\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 33","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1122018.1122047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文研究了有限度量空间k-server问题的空间有界算法的竞争因子。具体地说，给出了两种求任意空间有界算法竞争因子上界的方法。然后使用其中一种方法来证明类lru算法在一致度量空间上是线性竞争的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new bound for space bounded server algorithms

This paper studies the competitive factor of space bounded algorithms for the k-server problem operating in finite metric spaces. Specifically, two methods are developed for obtaining an upper bound on competitive factors of arbitrary space bounded algorithms. One of these methods is then used to show that an LRU-like algorithm is linearly-competitive on a uniform metric space.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM-SE 33

自引率

0.00%

发文量