From: "Brien L. Christesen" <blchrist@rac1.wam.umd.edu>
Subject: Re: sorting large numbers of large records
Date: Thu, 31 Jul 2003 15:22:44 +0000 (UTC)
Date: 2003-07-31T15:22:44+00:00 [thread overview]
Message-ID: <bgbc84$bjq$1@grapevine.wam.umd.edu> (raw)
In-Reply-To: bg3g08$k90nf$1@ID-175126.news.uni-berlin.de
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.
next prev parent reply other threads:[~2003-07-31 15:22 UTC|newest]
Thread overview: 18+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-07-28 15:29 sorting large numbers of large records Brien L. Christesen
2003-07-28 15:35 ` Vinzent Hoefler
2003-07-31 15:22 ` Brien L. Christesen [this message]
2003-07-28 16:25 ` Hyman Rosen
2003-07-28 20:30 ` John R. Strohm
2003-07-28 20:52 ` Hyman Rosen
2003-07-28 23:47 ` Matthew Heaney
2003-07-28 23:33 ` Matthew Heaney
2003-07-28 23:43 ` Matthew Heaney
2003-07-29 0:42 ` John Cupak
2003-07-29 3:38 ` Matthew Heaney
2003-07-29 8:32 ` Preben Randhol
-- strict thread matches above, loose matches on Subject: below --
2003-07-29 13:10 Brien L. Christesen
2003-07-29 14:30 ` Larry Kilgallen
2003-07-30 0:32 ` Keith Thompson
2003-07-30 1:53 ` Hyman Rosen
2003-07-30 14:55 ` Matthew Heaney
2003-07-30 16:41 ` Chad R. Meiners
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox