Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #11095 > unrolled thread

heaps as relates to memory and stacks

Back to article view | Back to comp.programming

Contents

  heaps as relates to memory and stacks G G <gdotone@gmail.com> - 2020-07-25 01:05 -0700
    Re: heaps as relates to memory and stacks "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> - 2020-07-25 10:47 +0200
    Re: heaps as relates to memory and stacks Julio Di Egidio <julio@diegidio.name> - 2020-07-25 02:25 -0700
      Re: heaps as relates to memory and stacks G G <gdotone@gmail.com> - 2020-07-25 02:50 -0700

#11095 — heaps as relates to memory and stacks

are the heaps that are discussed in heaps and stacks
memory, relating to processes, a program running in memory,
implemented as a heap data structure, like a tree,

https://en.wikipedia.org/wiki/Heap_(data_structure)#Applications

the heap grows toward the stack, that's because the OS
in maintaining the addresses and allocating space found
in the address space of the of the process? but how is that 
implemented as a heap data structure? is it a manner 
of speed to find something on the heap?

yes i don't understand what is going on. 

[toc] | [next] | [standalone]

#11096

On 25/07/2020 10:05, G G wrote:
> are the heaps that are discussed in heaps and stacks
> memory, relating to processes, a program running in memory,
> implemented as a heap data structure, like a tree,
> 
> https://en.wikipedia.org/wiki/Heap_(data_structure)#Applications

Do you mean heap as memory pool (to dynamically allocate objects)? Like:

 
https://en.wikipedia.org/wiki/Memory_management#Dynamic_memory_allocation

Then no, I don't see how a priority queue would be useful here.

There is a huge number of memory management algorithms due to various 
factors influencing the choice, like predictability, real-time 
constraints, concurrent access, fragmentation prevention etc.

Also when a specific allocation/deallocation order is known, e.g. most 
notorious are stack (LIFO) and arena, when object sizes are known in 
advance etc.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de

[toc] | [prev] | [next] | [standalone]

#11097

On Saturday, 25 July 2020 10:06:00 UTC+2, G G  wrote:

> are the heaps that are discussed in heaps and stacks
> memory, relating to processes, a program running in memory,
> implemented as a heap data structure, like a tree,
> 
> https://en.wikipedia.org/wiki/Heap_(data_structure)#Applications

As already mentioned by Mr Kazakov upthread, a heap as in
a memory heap is not the same as a heap as in the heap data
structure.

Indeed, from the top of that page: << For the memory heap
(in low-level computer programming), see C dynamic memory
allocation >>, and there you would also find notes on
concrete implementations.

> the heap grows toward the stack, that's because the OS
> in maintaining the addresses and allocating space found
> in the address space of the of the process?

Yes, the OS is (essentially) providing the lowest-level
logic and mediating between applicative code on a side
and the underlying hardware on the other.

> but how is that 
> implemented as a heap data structure? is it a manner 
> of speed to find something on the heap?
> 
> yes i don't understand what is going on.

Notice that for computer architecture questions (e.g. what is
a "memory heap" and how is it "implemented"), as opposed to
programming questions (e.g. what is a "heap data structure"
and how is that "implemented": for a different specific meaning
of "implemented" as well!), you should be asking in comp.arch.

HTH,

Julio

[toc] | [prev] | [next] | [standalone]

#11098

Thanks Julio, Thanks Dmitry

[toc] | [prev] | [standalone]

Back to top | Article view | comp.programming

csiph-web