Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #11096
| From | "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Re: heaps as relates to memory and stacks |
| Date | 2020-07-25 10:47 +0200 |
| Organization | Aioe.org NNTP Server |
| Message-ID | <rfgrjp$umo$1@gioia.aioe.org> (permalink) |
| References | <6502c023-8376-4be4-8d39-84011a9c0dado@googlegroups.com> |
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
Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
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
csiph-web