From owner-freebsd-fs Tue Apr 30 16:24:48 1996 Return-Path: owner-fs Received: (from root@localhost) by freefall.freebsd.org (8.7.3/8.7.3) id QAA22477 for fs-outgoing; Tue, 30 Apr 1996 16:24:48 -0700 (PDT) Received: from hauki.clinet.fi (root@hauki.clinet.fi [194.100.0.1]) by freefall.freebsd.org (8.7.3/8.7.3) with ESMTP id QAA22449 for ; Tue, 30 Apr 1996 16:24:13 -0700 (PDT) Received: from cantina.clinet.fi (root@cantina.clinet.fi [194.100.0.15]) by hauki.clinet.fi (8.7.5/8.6.4) with ESMTP id CAA10574; Wed, 1 May 1996 02:24:00 +0300 (EET DST) Received: (hsu@localhost) by cantina.clinet.fi (8.7.3/8.6.4) id CAA05011; Wed, 1 May 1996 02:23:59 +0300 (EET DST) Date: Wed, 1 May 1996 02:23:59 +0300 (EET DST) Message-Id: <199604302323.CAA05011@cantina.clinet.fi> From: Heikki Suonsivu To: Peter van Heusden Cc: freebsd-fs@freebsd.org In-reply-to: Peter van Heusden's message of 26 Apr 1996 04:49:56 +0300 Subject: Re: Compressing filesystem: Technical issues Organization: Clinet Ltd, Espoo, Finland References: Sender: owner-fs@freebsd.org X-Loop: FreeBSD.org Precedence: bulk In article Peter van Heusden writes: I'm slowly getting started on the issue of writing a compressing filesystem for BSD. The situation thus far: 1) I'm thinking of a model much like the Netware 4.x one, where a file is compressed if it has not been 'touched' (ie. read or written) in a certain time (e.g. a week). It is then decompressed on being 'touched'. ... You might want to have a look at @inproceedings{Burrows:92, AUTHOR="Michael Burrows and Charles Jerian and Butler Lampson and Timoth y Mann", TITLE="On-line Data Compression in a Log-structured File System", BOOKTITLE="ASPLOS V Proceedings", ORGANIZATION="ACM", YEAR=1992, MONTH="October", PAGES="2--9", ABSTRACT = "{We have incorporated on-line data compression into the low levels of a log-structured file system (Rosenblum's {\it Sprite LFS}). Each block of data or meta-data is compressed as it is written to the disk and decompressed as it is read. The log-strucuring overcomes the problems of allocation and fragmentation for variable-sized blocks. We observe compression factors ranging from 1.6 to 2.2, using algorithms running from 1.7 to 0.4 MBytes per second in software on a DECstation 5000/200. System performance is degraded by a few percent for normal activities (such as compiling or editing), and as much as a factor of 1.6 for file system intensive operations (such as copying multi-megabyte files). Hardware compression devices mesh well with this design. Chips are already available that operate at speeds exceeding disk transfer rates, which indicates that hardware compression would not only remove the performance degradation we observed, but might well increase the effective disk transfer rate beyond that obtainable from a system without compression.}" } It looks like implementing this on BSD LFS would not be too hard, as the idea is trivial and BSD LFS is based on the same idea. I do not know how stable BSD LFS is, anyone tried it lately ? -- Heikki Suonsivu, T{ysikuu 10 C 83/02210 Espoo/FINLAND, hsu@clinet.fi mobile +358-40-5519679 work +358-0-4375360 fax -4555276 home -8031121