2026-09-18T19:05:27Zhttps://skemman.is/oai/request

oai:skemman.is:1946/288122019-08-30T07:49:15Zcom_1946_6870com_1946_6001col_1946_34325

Háskólinn í Reykjavík James Elías Sigurðarson 1996- Ýmir Vigfússon 1984- Caches are ubiquitous systems that support the modern web. They are crucial to cope with delays, bandwidth and high energy use of accessing ever-growing data from backend databases. Today, almost every web access passes through some level of cache, starting with the browser cache found within the computer, through a series of caching servers until the data desired is either found in memory on one of the cache servers or is served up from the backend database. In this project, we investigate the problem of cache partitioning. Cache partitioning concerns the following question: given a number of tenants (think corporate customers) on a single server, how much cache space should each tenant be allotted? Moreover, given a set of tenants and a set of servers, where should the data for each tenant be placed so as to maximize each of their hit rates. 2017-09-04T13:34:56Z 2017-09-04T13:34:56Z 2017-09-04T13:34:57Z 2017-05-16T10:07:21Z 2017-05 http://hdl.handle.net/1946/28812 en Tölvunarstærðfræði Tölvuminni Discrete mathematics and computer science Fenrir: Practical Algorithms for Cache Partitioning Thesis Bachelor's