From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,14bff0642983a2a5
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-07-31 08:22:46 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!news2.wam.umd.edu!not-for-mail
From: "Brien L. Christesen" <blchrist@rac1.wam.umd.edu>
Newsgroups: comp.lang.ada
Subject: Re: sorting large numbers of large records
Date: Thu, 31 Jul 2003 15:22:44 +0000 (UTC)
Organization: University of Maryland College Park
Message-ID: <bgbc84$bjq$1@grapevine.wam.umd.edu>
References: <bg3fgg$qig$1@grapevine.wam.umd.edu>
 <bg3g08$k90nf$1@ID-175126.news.uni-berlin.de>
NNTP-Posting-Host: rac1.wam.umd.edu
X-Trace: grapevine.wam.umd.edu 1059664964 11898 128.8.10.141 (31 Jul 2003
 15:22:44 GMT)
X-Complaints-To: abuse@wam.umd.edu
NNTP-Posting-Date: Thu, 31 Jul 2003 15:22:44 +0000 (UTC)
User-Agent: tin/1.4.2-20000205 ("Possession") (UNIX) (SunOS/5.7 (sun4u))
Xref: archiver1.google.com comp.lang.ada:41081
Date: 2003-07-31T15:22:44+00:00
List-Id: <comp.lang.ada>

Thanks for the pointers to the information.  I ended up using something
like the knuth approach, with some buffering of IO built in.  Now 1M
records of 256 bytes are sorting in as little as 2.5 minutes, and the
execution time is growing almost linearly.  Thanks for all of the help
everyone!
Brien


Vinzent Hoefler <ada.rocks@jlfencey.com> wrote:
> Brien L. Christesen wrote:

>>I couldn't really find much discussion of doing external sorts in Ada (or
>>much literature on external sorts at all)

> <URL:http://opal.cs.binghamton.edu/~zzhang/ex_sort/intro.html>.
> <URL:http://www.cs.ust.hk/faculty/dimitris/COMP530/notes/l7b.pdf>?


> Vinzent.