Hint-based cooperative caching
| dc.contributor.advisor | Hartman, John | en_US |
| dc.contributor.author | Sarkar, Prasenjit, 1970- | |
| dc.creator | Sarkar, Prasenjit, 1970- | en_US |
| dc.date.accessioned | 2013-05-09T09:15:46Z | |
| dc.date.available | 2013-05-09T09:15:46Z | |
| dc.date.issued | 1998 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/288892 | |
| dc.description.abstract | This dissertation focuses on caching in distributed file systems, where the performance is constrained by expensive server accesses. This has led to the evolution of cooperative caching, an innovative technique which effectively utilizes the client memories in a distributed file system to reduce the impact of server accesses. This is achieved by adding another layer to the storage hierarchy called the cooperative cache, allowing clients to access and store file blocks in the caches of other clients. The major contribution of this dissertation is to show that a cooperative caching system that relies on local hints to manage the cooperative cache performs better than a more tightly coordinated fact-based system. To evaluate the performance of hint-based cooperative caching, trace-driven simulations are used to show that the hit ratios to the different layers of the storage hierarchy are as good as those of the existing tightly-coordinated algorithms, but with significantly reduced overhead. Following this, a prototype was implemented on a cluster of Linux machines, where the use of hints reduced the average block access time to almost half that of NFS, and incurred minimal overhead. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Engineering, Electronics and Electrical. | en_US |
| dc.subject | Computer Science. | en_US |
| dc.title | Hint-based cooperative caching | en_US |
| dc.type | text | en_US |
| dc.type | Dissertation-Reproduction (electronic) | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | doctoral | en_US |
| dc.identifier.proquest | 9901771 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.discipline | Computer Science | en_US |
| thesis.degree.name | Ph.D. | en_US |
| dc.identifier.bibrecord | .b38838229 | en_US |
| refterms.dateFOA | 2018-08-16T16:09:37Z | |
| html.description.abstract | This dissertation focuses on caching in distributed file systems, where the performance is constrained by expensive server accesses. This has led to the evolution of cooperative caching, an innovative technique which effectively utilizes the client memories in a distributed file system to reduce the impact of server accesses. This is achieved by adding another layer to the storage hierarchy called the cooperative cache, allowing clients to access and store file blocks in the caches of other clients. The major contribution of this dissertation is to show that a cooperative caching system that relies on local hints to manage the cooperative cache performs better than a more tightly coordinated fact-based system. To evaluate the performance of hint-based cooperative caching, trace-driven simulations are used to show that the hit ratios to the different layers of the storage hierarchy are as good as those of the existing tightly-coordinated algorithms, but with significantly reduced overhead. Following this, a prototype was implemented on a cluster of Linux machines, where the use of hints reduced the average block access time to almost half that of NFS, and incurred minimal overhead. |
