🚀 go-pugleaf

In article <1992Aug5.193559.19274@infonode.ingr.com> fisherm@infonode.ingr.com (Matthew Fisher) writes:

 >    I'm dealing with a table the is larger than 640k.  I need some code or
 > ideas on how to do effcient page swapping.  Access of the table is in no
 > particular order.  One access my be in the first 20k and the next access may
 > be up past 2mg.  The data cannot be sorted to make the access any better.

It sounds like what you really want to do is use a DOS extender and a
32-bit C compiler instead of writing a Windows program. The 32-bit C
compiler part allows you to write programs which can malloc a two
megabyte array, for instance, and crunch data objects larger than 64Kb
without giving it a second thought. You get full access to the amount of
extended memory in your PC, rather than the 1Mb you get under normal DOS
programs. The DOS extender part allows your 32-bit program code to do
I/O and otherwise call upon DOS services, because it translates your
requests into 16-bit requests that DOS can understand. Some DOS
extenders can provide virtual memory, as Windows can in 386 enhanced
mode, but the DOS extender can do so with less speed overhead and takes
up less of your memory than Windows does.

Or you could write your program for OS/2 2.0. :) You would need a 32-bit
C compiler (no DOS extender necessary, and OS/2 itself is quite capable
of providing virtual memory). GNU's C/C++ compiler has been ported and
works quite well for data crunching.

Followups either to comp.os.msdos.programmer (for DOS extender
discussions) or comp.os.os2.programmer for OS/2 2.0 discussions.

--
| Ping Huang (INTERNET: pshuang@martigny.ai.mit.edu) speaking for himself.
| "One Thing to name them all, One Thing to define them,
|  One Thing to place them in environments and bind them..."