Showing papers by "Derek L. Eager published in 1993"
25 May 1993
TL;DR: It is shown that locality based approaches, such as the common least recently used (LRU) policy, which are known to work well on stand-alone disked workst stations and at client workstations in distributed systems, are inappropriate at a fileserver.
Abstract: Trace driven simulations were used to study the performance of several disk cache replacement policies for network file servers. It is shown that locality based approaches, such as the common least recently used (LRU) policy, which are known to work well on stand-alone disked workstations and at client workstations in distributed systems, are inappropriate at a fileserver. Quite simple frequency based approaches do better. More sophisticated frequency based policies (eg., that take into account the file type) may offer additional improvements. >
95 citations
TL;DR: This paper proposes a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors, and argues that chore systems attain both the high efficiency of compiler approaches for the common case of data parallelism, and the flexibility and performance of user-level thread approaches for functional parallelism.
Abstract: Parallel computing is increasingly important in the solution of large-scale numerical problems. The difficulty of efficiently hand-coding parallelism, and the limitations of parallelizing compilers, have nonetheless restricted its use by scientific programmers.In this paper we propose a new paradigm, chores, for the run-time support of parallel computing on shared-memory multiprocessors. We consider specifically uniform memory access shared-memory environments, although the chore paradigm should also be appropriate for use within the clusters of a large-scale nonuniform memory access machine.We argue that chore systems attain both the high efficiency of compiler approaches for the common case of data parallelism, and the flexibility and performance of user-level thread approaches for functional parallelism. These benefits are achieved within a single, simple conceptual model that almost entirely relieves the programmer and compiler from concerns of granularity, scheduling, and enforcement of synchronization constraints. Measurements of a prototype implementation demonstrate that the chore model can be supported more efficiently than can traditional approaches to either data or functional parallelism alone.
48 citations