Performance: memset

by

As others already pointed out, Linux uses an optimistic memory allocation strategy.

The difference between the first and the following memcpys is the initialization of DataDest.

As you have already seen, when you eliminate memset(DataSrc, 0, N), the first memcpy is even slower, because the pages for the source must be allocated as well. When you initialize both, DataSrc and DataDest, e.g. 

memset(DataSrc, 0, N);
memset(DataDest, 0, N);

all memcpys will run with roughly the same speed.

For the second question: when you initialize the allocated memory with memset all pages will be laid out consecutively. On the other side, when the memory is allocated as you copy, the source and destination pages will be allocated interleaved, which might make the difference.

More Related Contents:

  1. Why does the order of the loops affect performance when iterating over a 2D array?
  2. Where in memory are my variables stored in C?
  3. How to allocate aligned memory only using the standard library?
  4. When you exit a C application, is the malloc-ed memory automatically freed?
  5. Why is my program slow when looping over exactly 8192 elements?
  6. How to dynamically allocate memory space for a string and get that string from user?
  7. Trying to understand gcc option -fomit-frame-pointer
  8. Which ordering of nested loops for iterating over a 2D array is more efficient [duplicate]
  9. Is it faster to count down than it is to count up?
  10. How do you store an arbitrarily large integer value in memory?
  11. Loop with function call faster than an empty loop
  12. Why vectorizing the loop does not have performance improvement
  13. How to do unsigned saturating addition in C?
  14. Should I free char* initialized using string-literals?
  15. How can I create a dynamically sized array of structs?
  16. Alloca implementation
  17. Is it good practice to free a NULL pointer in C? [duplicate]
  18. malloc implementation?
  19. can size of array be determined at run time in c?
  20. Using realloc to shrink the allocated memory
  21. How do I free memory in C?
  22. Why is memcmp so much faster than a for loop check?
  23. Why / when to use `intptr_t` for type-casting in C?
  24. Force free() to return malloc memory back to OS
  25. C: pointer to array of pointers to structures (allocation/deallocation issues)
  26. Algorithm to find all the exact divisors of a given integer
  27. dynamic memory for 2D char array
  28. Which is better way to calculate nCr
  29. memory allocation in Stack and Heap
  30. /proc/[pid]/pagemaps and /proc/[pid]/maps | linux

Leave a Comment