[A83] Re: fschk83

To: assembly-83@lists.ticalc.org
Subject: [A83] Re: fschk83
From: Gavin Olson <gtolson@snet.net>
Date: Wed, 20 Feb 2002 04:58:45 -0500
In-Reply-To: <freemail.20020120200333.83715@fm6.freemail.hu>
References: <000201c1b93a$813bb4a0$080a0a0a@ronald>
Reply-To: assembly-83@lists.ticalc.org

At 08:03 PM 2/20/02 +0100, you wrote:

> > another idea: a defragmenter. Wouldn't the calc be faster
>if you have lots
> > of programs and they are all sorted alphabetically?
>
>Probably you are going too far in the analogy. :)
>
>PG

No, because all locations of memory can be accessed at the same 
speed.  This is how that nifty SCSI drive in the latest Maximum PC hit a 
seek time of .02ms in all situations.  Contiguity is not an issue (and all 
calc files are contiguous)

Follow-Ups:

[A83] Re: fschk83

From: "Michael Vincent" <hookman@worldnet.att.net>

References:

[A83] Re: fschk83

From: "Ronald Teune" <rtwolf@gmx.net>

[A83] Re: fschk83

From: Patai Gergely <patai.ti@freemail.hu>