A reimplementation of the UNIX file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics. The new file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files. File access rates of up to ten times faster than the traditional UNIX file system are experienced. Long needed enhancements to the programmers’ interface are discussed. These include a mechanism to place advisory locks on files, extensions of the name space across file systems, the ability to use long file names, and provisions for administrative control of resource usage.

Areimplementation of the UNIX file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics. The new file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files. File access rates of up to ten times faster than the traditional UNIX file system are experienced. Long needed enhancements to the programmers’ interface are discussed. These include a mechanism to place advisory locks on files, extensions of the name space across file systems, the ability to use long file names, and provisions for administrative control of resource usage.

Abstract not found

For each n, we construct a simplicial complex whose k-dimensional faces are in one-to-one correspondence with 2-stack sortable permutations of length n having k ascents.

A reimplementation of the UNIX file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics. The new file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files. File access rates of up to ten times faster than the traditional UNIX file system are experienced. Long needed enhancements to the programmers ' interface are discussed. These include a mechanism to place advisory locks on files, extensions of the name space across file systems, the ability to use long file names, and provisions for administrative control of resource usage. Revised February 18, 1984 CR Categories and Subject Descriptors: D.4.3 [Operating Systems]: File Systems Management - file organization, directory s...

. Using earlier results we prove a formula for the number W (n;k) of 2stack sortable permutations of length n with k runs, or in other words, k \Gamma 1 descents. This formula will yield the suprising fact that there are as many 2-stack sortable permutations with k \Gamma 1 descents as with k \Gamma 1 ascents. We also prove that W (n;k) is unimodal in k, for any fixed n. 1. Introduction 1.1. Our main results. In this paper we are going to show that the number of 2-stack sortable permutations of length n with k \Gamma 1 ascents is equal to the number T (n;k) of fi(1; 0)-trees on n + 1 nodes with k leaves. (See Section 2 for the definition of fi(1; 0)-trees). This, and results from [2] and [5] will enable us to easily show that W (n;k) = (n + k \Gamma 1)!(2n \Gamma k)! k!(n + 1 \Gamma k)!(2k \Gamma 1)!(2n \Gamma 2k + 1)! ; (1) which formula is symmetric in k and n + 1 \Gamma k. 1.2. Background and Definitions. In what follows, permutations of length n will be called n-permutations...

The Dictionary Server Protocol (DICT) is a TCP transaction based query/response protocol that allows a client to access dictionary definitions from a set of natural language dictionary databases.