Why is memory allocation on heap MUCH slower than on stack?

by

Because the heap is a far more complicated data structure than the stack.

For many architectures, allocating memory on the stack is just a matter of changing the stack pointer, i.e. it’s one instruction. Allocating memory on the heap involves looking for a big enough block, splitting it, and managing the “book-keeping” that allows things like free() in a different order.

Memory allocated on the stack is guaranteed to be deallocated when the scope (typically the function) exits, and it’s not possible to deallocate just some of it.

Related Contents:

  1. Why is the use of alloca() not considered good practice?
  2. How to allocate aligned memory only using the standard library?
  3. Stack smashing detected
  4. What does the brk() system call do?
  5. Where in memory are my variables stored in C?
  6. In C, do braces act as a stack frame?
  7. Do threads have a distinct heap?
  8. Proper stack and heap usage in C++?
  9. Difference between static memory allocation and dynamic memory allocation
  10. When you exit a C application, is the malloc-ed memory automatically freed?
  11. malloc for struct and pointer in C
  12. Is it good practice to free a NULL pointer in C? [duplicate]
  13. When should I use malloc in C and when don’t I?
  14. Does stack grow upward or downward?
  15. Why does `free` in C not take the number of bytes to be freed?
  16. Does free(ptr) where ptr is NULL corrupt memory?
  17. Conflict between a Stanford tutorial and GCC
  18. Global memory management in C++ in stack or heap?
  19. How does a NOP sled work?
  20. How can I get the size of an array from a pointer in C?
  21. What does this GCC error “… relocation truncated to fit…” mean?
  22. Free memory allocated in a different function?
  23. Does free() set errno?
  24. How can I create a dynamically sized array of structs?
  25. Where are constant variables stored in C?
  26. Why / when to use `intptr_t` for type-casting in C?
  27. Maximum memory which malloc can allocate
  28. Size of stack and heap memory [duplicate]
  29. How to dynamically allocate memory space for a string and get that string from user?
  30. Is it ok to use “classic” malloc()/free() in Objective-C/iPhone apps?
  31. How to include a dynamic array INSIDE a struct in C?
  32. C API design: Who should allocate? [closed]
  33. Getting a stack overflow exception when declaring a large array
  34. Stack allocation, padding, and alignment
  35. What does “static” mean in C?
  36. What is the format specifier for unsigned short int?
  37. Can’t understand this way to calculate the square of a number
  38. How does this piece of code determine array size without using sizeof( )?
  39. How can I compile without warnings being treated as errors?
  40. How can I multiply and divide using only bit shifting and adding?
  41. How can I convert a binary file to the text declaring a C/C++ array with that content?
  42. Determine size of dynamically allocated memory in C
  43. What if I don’t write default in switch case?
  44. Do I need to keep a file open after calling mmap on it?
  45. Where to find “gmp.h”?
  46. what happens in the kernel during malloc?
  47. How to print variable addresses in C?
  48. Object oriented programming in C [duplicate]
  49. How to use boolean datatype in C?
  50. Use printf to format floats without decimal places if only trailing 0s

Leave a Comment