If the input data is seriously random, then a sparse matrix/array would certainly cut way down on the paging load that might result from my previous suggestion, but at the cost of having to do many more small-length GETMAINs instead of one huge GETMAIN for 1/2 gigabyte of pageable, virtual storage.
Bill Fairchild Rocket Software -----Original Message----- From: IBM Mainframe Assembler List [mailto:[email protected]] On Behalf Of Bob Flanders Sent: Monday, August 23, 2010 2:04 PM To: [email protected] Subject: Re: Efficient Memory List If you are simply looking for existence, you could use a bit string, but that would be .5GB of memory if you did a single level. Perhaps you could build a sparse array using each byte as one of a four-level index. On Mon, Aug 23, 2010 at 10:45 AM, Patrick Roehl <[email protected]>wrote: > I’m looking for advice on how to handle a potentially large list of data. > The list is comprised of 4-byte entries... >
