Adaptive distributed caching with minimal memory usage

Markus J. Kaiser, Kwok Ching Tsui, Jiming Liu

Research output: Chapter in book/report/conference proceedingConference proceeding

Abstract

We have shown previously that our Adaptive Distributed Caching (ADC) algorithm is able to compete with typical hashing based approaches in the realm of distributed proxy systems. In our first approach, we allowed the algorithm to run with the assumption of unlimited system resources (e.g. physical RAM). In this paper we introduce an extension to ADC, which gives the algorithm the capability to perform in more realistic environments with limited memory. We will discuss the arising problem, introduce the new ADC and provide experimental results, which will show that our algorithm is able to achieve the performance characteristic of our previous work even with limited resources.
Original languageEnglish
Title of host publicationSEAL'02 : proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning
Subtitle of host publicationComputational Intelligence for the E-Age
EditorsLipo Wang, Kay Chen Tan, Takeshi Furuhashi, Jong-Hwan Kim, Xin Yao
Place of PublicationSingapore
PublisherSchool of Electrical & Electronic Engineering, Nanyang Technological University
Pages360-364
Number of pages5
Volume1
ISBN (Print)9810475225, 9789810475222
Publication statusPublished - Nov 2002
Event4th Asia-Pacific Conference on Simulated Evolution and Learning, SEAL'02 - Orchid Country Club, Singapore
Duration: 18 Nov 200222 Nov 2002

Conference

Conference4th Asia-Pacific Conference on Simulated Evolution and Learning, SEAL'02
Country/TerritorySingapore
Period18/11/0222/11/02

Fingerprint

Dive into the research topics of 'Adaptive distributed caching with minimal memory usage'. Together they form a unique fingerprint.

Cite this