<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:34:21Z</responseDate><request verb="GetRecord" identifier="oai:digital.lib.washington.edu:1773/7010" metadataPrefix="dim">https://digital.lib.washington.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:digital.lib.washington.edu:1773/7010</identifier><datestamp>2025-01-07T21:47:46Z</datestamp><setSpec>com_1773_4888</setSpec><setSpec>col_1773_4909</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US" authority="07e023dd-5813-4e2e-bcae-82eae73cbad0" confidence="-1">Voelker, Geoffrey Michael, 1970-</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-10-06T17:00:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-10-06T17:00:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2000</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">b45340183</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">46729736</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">Thesis 49544</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1773/7010</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (Ph. D.)--University of Washington, 2000</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This dissertation extends cooperative caching systems in three new directions: (1) I study the performance tradeoffs of using load balancing techniques to reduce the contention of remote page requests at memory servers, (2) I develop a novel combined prefetching and cooperative caching system to further reduce disk stall time for I/O-bound applications, and (3) I explore the effectiveness of using cooperative caching techniques among World Wide Web proxy caches at large-scale client populations. I use analytic, simulation, and measurement techniques to explore the performance of these new directions in cooperative caching systems.First, I develop an analytic queueing network model to evaluate the effectiveness of load balancing memory requests, and then use trace-driven simulation to study the potential harm of deviating from the replacement policy when balancing load. I find that deviating from the strict replacement policy does not significantly degrade overall application performance. Based upon these results, I conclude that cooperative caching systems can benefit considerably from load balancing requests with little harm from suboptimal replacement decisions.Second, I present the design of a combined cooperative prefetching and caching algorithm and its implementation in a prototype system called Prefetching Global Memory System (PGMS). I measure the performance of the PGMS implementation on a workstation cluster using both synthetic and real application benchmarks and conclude that, by using available global memory, disk, and CPU resources, cooperative prefetching and caching can obtain significant speedups for I/O-bound programs.Lastly, I introduce a novel analytic model of Web accesses to explore the effectiveness of cooperative caching among World Wide Web proxies. This model evaluates the steady-state performance of proxy caches based upon server, object popularity, and document modification distributions. I use the model to evaluate cooperative Web proxy caching at population sizes that range from a single organization to millions of clients, explore the tradeoffs among various cooperative caching schemes, and speculate on the performance implications of future trends in Web workloads. Overall, I demonstrate that the utility of cooperative Web proxy caching is most effective among groups of small organizations, and only marginally useful for very large client populations.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">ix, 151 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">Copyright is held by the individual authors.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US" />
   <dim:field mdschema="dc" element="subject" qualifier="other" lang="en_US">Theses--Computer science and engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Cooperative caching in local-area and wide-area networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>