Bill N. Schilit and D. Duchamp. Adaptive Remote Paging for Mobile Computers. Technical report CUCS-004-91, February 1991, Department of Computer Science, Columbia University. <URL: ftp://ftp.cs.columbia.edu/reports/reports-1991/cucs-004-91.ps.Z>  Home/Search   Document Not in Database   Summary   Related Articles   Check

....replacement victim. Felten and Zahorjan used a simple queueing model to predict performance. Recently, Markatos and Dramitinos built a remote paging system for Digital Unix [51] In a different environment, Schilit and Duchamp have used remote paging to enhance the performance of mobile computers [62]. Their goal is to permit small memory starved portable computers to page to the memories of larger servers nearby; pages could migrate from server to server as the portables migrate. 21 Cooperative Caching for Distributed Filesystems A distributed filesystem (e.g. NFS [59] and AFS [61] ....

....implementation, the master node is pre determined and represents a single point of failure that can prevent addition of new nodes. It is straightforward to extend our implementation to deal with master node failure through an election process to select a new master, as is done in other systems [44, 62]. Node deletions are straightforward as well. The master node checks periodically for the liveness of the other nodes. When it detects a crashed node, it redistributes the pageownership directory. As with addition, global cache directories are also redistributed at that time. 6.1.7 Inter node ....

Bill N. Schilit and Dan Duchamp. Adaptive remote paging. Technical Report CUCS004091, Department of Computer Science, Columbia University, February 1991.

....central registry to locate active memory servers, picking one at random to receive the replacement victim. Felten and Zahorjan used a simple queueing model to predict performance. In a different environment, Schilit and Duchamp have used remote paging to enhance the performance of mobile computers [18]. Their goal is to permit small memory starved portable computers to page to the memories of larger servers nearby; pages could migrate from server to server as the portables migrate. Franklin et al. examine the use of remote memory in a clientserver DBMS system [13] Their system assumes a ....

....implementation, the master node is pre determined and represents a single point of failure that can prevent addition of new nodes. It is straightforward to extend our implementation to deal with master node failure through an election process to select a new master, as is done in other systems [14, 18]. Node deletions are straightforward as well. The master node checks periodically for the liveness of the other nodes. When it detects a crashed node, it redistributes the page ownership directory. As with addition, global cache directories are also redistributed at that time. 4.5 Basic Operation ....

B. N. Schilit and D. Duchamp. Adaptive remote paging. Technical Report CUCS-004091, Department of Computer Science, Columbia University, February 1991.

....less durable. Therefore, our research agenda is to concentrate on higher level assistants that through short term interaction provide added value for mobile users. The TeleWeb system draws influence from work in a number of areas. This includes adaptive mobile systems work done at Columbia [Schilit91], Xerox PARC [Schilit93] and more recently CMU [Noble95] Our initial emphasis is on system level adaptation but we believe the architecture can also support the related notion of location and context adaption [Schilit94, Schilit95, Voelker94] Goldberg and Tso s proposal for intelligently ....

Bill N. Schilit and D. Duchamp. Adaptive Remote Paging for Mobile Computers. Technical report CUCS-004-91, February 1991, Department of Computer Science, Columbia University. <URL: ftp://ftp.cs.columbia.edu/reports/reports-1991/cucs-004-91.ps.Z>

....of network based paging systems include those of Comer and Griffioen [4] and Felten and Zahorjan [7] Comer and Griffioen use dedicated remote memory servers, while Felten and Zahorjan extend the idea to use memory on idle client machines, with a centralized registry process. Schilit and Duchamp [14] use networkbased paging for mobile computing with limited resources. Franklin et al. [8] describe a DBMS system using centralized remote memory paging at the server as a backing store. Markatos [12] extends the use of remote memory to commit transaction writes. These implementations generally ....

B. N. Schilit and D. Duchamp. Adaptive Remote Paging. Technical Report CUCS-004091, Department of Computer Science, Columbia University, February 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC