C Calling convention and stack

The formal arguments and local variables are defined inside a function are created at a place in memory called ‘stack’.When the control returns from the function the stack is cleaned up either by the ‘Calling function’ or by the ‘Called function’, which would do this is decided by the calling convention. Standard calling convention in ...

Tree Based Protocol 3

Tree Based Protocol
Only exclusive locks are allowed The first lock by Ti may be on any data item. Subsequently a data item Q can be locked by Ti only if the parent of Q is currently locked by Ti Data items may be unlocked at any time. A data item that has been locked and unlocked by ...

Graph Based Protocol

It impose partial ordering on the set D ={d1, d2, d3, …, dn} of all data items. If di -> dj , then any transaction accessing both di and dj must access di before accessing dj it implies that the set D may now be viewed as directed acyclic graph.

Lock Based Protocol 2

Lock Based Protocol
A lock is a mechanism to control concurrent access to a data item. Data items can be locked in two modes 1. Exclusive(X) mode: Data item can be both read as well as written. X-lock is requested using lock-x instruction. 2. Shared(S)-mode: Data item can only be read. S-lock is requested using lock-s instruction Lock ...

Cache Memory

A cache is a component that transparently stores data so the future requests for the data can be served faster.The data that is stored within a cache, might be values that have been computed earlier or duplicates of the original values that are stored elsewhere. Cache Hit, Cache Miss If requested data is contained in ...

Addressing Modes 1

Various Addressing modes as used in Computer Architecture: Register ADD R1,R2 ,R3 means : R1 comments : used when a value is in register Immediate ADD R1, R2 , 1 means : R1 comment : used when a constant is needed Direct ADD R1 , R2 , (100) means : R1 comment : used to ...