Received: (from major@localhost)
	by minnie.cs.adfa.oz.au (8.8.5/8.8.5) id PAA16168
	for pups-liszt; Fri, 3 Apr 1998 15:44:37 +1000 (EST)
X-Authentication-Warning: minnie.cs.adfa.oz.au: major set sender to owner-pups@minnie.cs.adfa.oz.au using -f
Received: from europe.std.com (europe.std.com [199.172.62.20])
	by minnie.cs.adfa.oz.au (8.8.5/8.8.5) with ESMTP id PAA16163
	for <pups@minnie.cs.adfa.oz.au>; Fri, 3 Apr 1998 15:44:29 +1000 (EST)
Received: from world.std.com by europe.std.com (8.7.6/BZS-8-1.0)
	id AAA28403; Fri, 3 Apr 1998 00:44:23 -0500 (EST)
Received: by world.std.com (TheWorld/Spike-2.0)
	id AA14598; Fri, 3 Apr 1998 00:44:23 -0500
Date: Fri, 3 Apr 1998 00:44:23 -0500
From: allisonp@world.std.com (Allison J Parent)
Message-Id: <199804030544.AA14598@world.std.com>
To: pups@minnie.cs.adfa.oz.au
Subject: Re: What's magtape good for anyway?
Sender: owner-pups@minnie.cs.adfa.oz.au
Precedence: bulk


<Was dectape an attempt to remedy some of these problems?  My 
<hazy recollection was that you could treat dectape in some ways as if 
<it were a disk.

Dectape was an attempt to achive moderate amount of storage at low cost 
with good reliability.  It's stop, turnaround time was poor but the cost 
was very low.  It was preceeded by linktape which was very much similar.

<How much data can magtape hold?  If magtape was a portable media, 

varies with the size of the reel and the density it was recorded at.

<does that mean that the manufacturers agreed on the width of 
<the tape, the density of recording, the method of recording bits, 
<etc.?

To a point.  

<I have an old 9 track tape from a computer course I took in 1980.  
<For sentimental reasons I'd love to get a copy of its contents.  Is 
<this possible do you think?

Highly likely if you can find someone with a drive.

<Is 'merge sort' an example of an application that required three tape 
<drives?

Thats a typical one.  Sometimes 4 drives were used plus maybe a disk
system.  Two for source material, one for intermediate results, one or
more for programs and the last for final results.  Some machines were
very limited in the local memory they had so programs often were broken 
into small modules and loaded (chained) as needed on the fly.  Imagine
processing 500k of data in a 16k memory where a portion was also used 
for program code.

Allison


