Efficient use of file handles in external sort 
Author Message
 Efficient use of file handles in external sort

 >The first question is do you need a lot of file handles?  An external
 >merge sort should only need three at a time.
 >Any method of pre-allocating memory is likely to be a little messy.
 >Probably the least messy would be:
 >  1.  Allocate a small (reserve) buffer.
 >  2.  Allocate all available memory into sort buffers
 >  3.  Free the reserve buffer.
 >Alternatively you might consider making the maximum memory to use a
 >variable which can be set (say with a command line argument).  You can
 >then fine-tume it without a recompile.

This is one of the best suggestions I have seen so far.  There are a
few bits to fine-tune about it, but it has some possibilities.

PGP public key and home page at http://www.*-*-*.com/

Mon, 21 Jun 1999 03:00:00 GMT  
 [ 1 post ] 

 Relevant Pages 

1. Efficient use of file handles in external sort

2. How do I sort external file for....

3. sorting and searching large external files?

4. Clarification: Efficient 2D sorting algorithms?

5. Efficient 2D sorting algorithm?

6. Consequences of using an external function without an external function declaration

7. how can i make an application using an external file

8. using an external .obj file

9. quickest way to sort an almost sorted file

10. need help on external sort/search

11. Need help with external sorting

12. Need help with external sorting


Powered by phpBB® Forum Software