Explain the stack storage allocation model, Computer Engineering

Assignment Help:

Explain the stack storage allocation model.

In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subroutine parameters. A stack storage allocation model:

a. Grow and shrink on procedure calls and returns.

b. Register allocation works best for stack-allocated objects.

c. Memory allocation and freeing are partially predictable.

d. Restricted but easy and efficient.

e. Allocation is hierarchical: Memory freed in opposite sequence of allocation. It is If alloc (A) then alloc (B) then alloc (C), then this should be free(C) then free(B) then free(A).

1266_stack storage allocation model.png


Related Discussions:- Explain the stack storage allocation model

Approaches for development of information systems, Q. Approaches for develo...

Q. Approaches for development of information systems? Numerous approaches are available for development of Information Systems. They are as below: • Model Driven: It put e

Design a 32:1 multiplexer, Design a 32:1 multiplexer using two 16:1 multipl...

Design a 32:1 multiplexer using two 16:1 multiplexers and a 2:1 multiplexer Ans. Design a 32 X 1 MUX by using two 16 X 1 MUX and one 2 X 1. Now here total 32 input lines

What are advantages and drawbacks of flip-flop, What are advantages and dra...

What are advantages and drawbacks of flip-flop? Usually area of a Flip-flop for features in more than a latch. Power consumption is normally higher, because of the area and

Explain bernstein conditions for detection of parallelism, Bernstein Condit...

Bernstein Conditions for Detection of Parallelism For execution of a number of instructions or a block of instructions in parallel, it must be made certain that instructions ar

Jewel polishing, Byteland county is very famous for luminous jewels. Lumino...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Delete the leaves of a binary tree, Write a recursive algorithm to delete t...

Write a recursive algorithm to delete the leaves of a binary tree. Programming Requirements You must use the binary search tree code provided.  Each algorithm must be impleme

ANS, Smugglers are becoming very smart day by day. Now they have developed ...

Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new technology, they are send

Two "next screen "attributes, Of the two "next screen "attributes the attri...

Of the two "next screen "attributes the attributes that has more priority is?? Dynamic.

Steps uesd in quine mckluskey method, Q. Steps uesd in quine mckluskey meth...

Q. Steps uesd in quine mckluskey method? Step I: Build a table in that every term of expression is represented in row (Expression must be in SOP form). Terms can be expres

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd