Over the last decade, the Petri net has gamed increased usage and acceptance as a basic
model of systems of asynchronous concurrent computation. This paper surveys the basic …

Specific aspects of cache memories that are investigated include: the cache fetch algorithm
(demand versus prefetch), the placement and replacement algorithms, line size, store …

This paper addresses two unresolved issues about Web caching. The first issue is whether
Web requests from a fixed user community are distributed according to Zipf's (1929) law. The …

Publisher Summary The problem of selecting an effective algorithm arises in a wide variety
of situations. This chapter starts with a discussion on abstract models: the basic model and …

In this article we study the amortized efficiency of the “move-to-front” and similar rules for
dynamically maintaining a linear list. Under the assumption that accessing the ith element …

This paper introduces a new approach to database disk buffering, called the LRU-K method.
The basic idea of LRU-K is to keep track of the times of the last K references to popular …

Proceedings of FAST ’03: 2nd USENIX Conference on File and Storage Technologies Page 1
USENIX Association Proceedings of FAST ’03: 2nd USENIX Conference on File and Storage …

We consider a network consisting of a file server connected through a shared link to a
number of users, each equipped with a cache. Knowing the popularity distribution of the …

Is your memory hierarchy stop** your microprocessor from performing at the high level it
should be? Memory Systems: Cache, DRAM, Disk shows you how to resolve this problem …

ABSTRACT A sequence of interleaved user transactions in a database system may not be
ser: ahzable, te, equivalent to some sequential execution of the individual transactions …