| A.S. Tanenbaum, Modern Operating Systems. Prentice-Hall: Upper Saddle River, NJ, USA (1992). |
....are more strongly veriable. 3.4 Managing data All information storage systems must deal with the problem of nite storage capacity. Individual Freenet node operators can congure the amount of storage to dedicate to their datastores. Node storage is managed as an LRU (Least Recently Used) cache[29] in which data items are kept sorted in decreasing order by time of most recent request (or time of insert, if an item has never been requested) When a new le arrives (from either a new insert or a successful request) which would cause the datastore to exceed the designated size, the least ....
A.S. Tanenbaum, Modern Operating Systems. Prentice-Hall: Upper Saddle River, NJ, USA (1992).
....infeasible altogether. 6 3.3 Managing data All information storage systems must deal with the problem of finite storage capacity. Individual Freenet node operators can configure the amount of storage to dedicate to their datastores. Node storage is managed as an LRU (Least Recently Used) cache[25], with data items kept sorted in decreasing order by time of most recent request (or time of insert, if an item has never been requested) When a new file arrives (from either a new insert or a successful request) which would cause the datastore to exceed the designated size, the least recently ....
A.S. Tanenbaum, Modern Operating Systems. Prentice-Hall: Upper Saddle River, NJ, USA (1992).
No context found.
A.S. Tanenbaum, Modern Operating Systems. Prentice-Hall: Upper Saddle River, NJ, USA (1992).
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