Author: Robert Hyatt
Date: 07:47:07 08/07/01
Go up one level in this thread
On August 07, 2001 at 02:28:57, Dan Andersson wrote: >If the compression subject is fairly regular, a simple (i.e. few computations) >compression/decompression will give a big compression ratio. And in many cases >its faster to access compressed data than uncompressed because of the speed of >the storage medium is much slower than ram. There was an experimental system >called Juice that stored a compressed representation of a program and loaded the >compressed file and managed to compile and optimize the program faster than the >system could load the precompiled native program. Hard disks are really slow >compared with most other computer subsystems. So in short, >compression/decompression might even make sense in a speed perspective (under >the right circumstances). This is already true. Except for the fastest SCSI drives around, using the compressed files actually will result in a faster search speed (for Crafty) than using the non-compressed files. Because of reduced I/O bandwidth requirements.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.