dynamic Memory allocations for large arrays

Hi Folks,

I would appreciate some one could point to docs about efficient methods of dynamic memory allocations of large 2-d and 3d arrays of size of 3GB+ Looking ideas for efficient tranfer of memory locations using MPI function calls.

thank you
Who is Participating?

[Webinar] Streamline your web hosting managementRegister Today

avizitConnect With a Mentor Commented:
LCC http://www.cs.princeton.edu/software/lcc/ 
implements its own storage allocation

whenever there is requirement for memory

ity mallocs the required size + 10k extra and from then on whenever more memory is required it returns from the already malloced area and when memory is freed it is not freed to the system but is kept in a list of space available

the implementation is available at


but guess you woudl be better off with the book in hand too


teamAuthor Commented:
this for transfer of  matrix elements across nodes of cluster.
Jaime OlivaresConnect With a Mentor Software ArchitectCommented:
This means that you have more than 3GB RAM memory?

I think the efficient way is to construct your own specialized linked list of arrays. Will be better if you work in C++. Here are the esencials:
- Linked list provides you flexibility to grow
- Arrays allows you fast access to data
So, combining both data storage techniques, you will have a efficient and fast method to access huge information.

Start building a simple linked list system, then replace single elements in liked list nodes with arrays.
teamAuthor Commented:
ankuratvb: err i am doing this on a Linux Machine. :D Not windows
All Courses

From novice to tech pro — start learning today.