Classifications of Locality of References Principles Flashcards

1
Q

What is principality of locality

A

Principle of locality or locality of reference is the tendency of a processor to access the same set of memory locations repetively over a short period of time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Types of locality

A

Temporal locality: Here a resource that is referenced at one point in time is referenced again soon afterwards

Spatial Locality: Here the likelihood of referencing a storage location is greater if a storage location near it has been recently refereence

Sequential Locality: Here storage is accessed sequentially, in descending or ascending order. This leads to memory hierachy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is memory hierarchy

A

Memory hierarchy is a structure that uses multiple levels of memories; as the distance from the CPU increases, the size of the memories and the access time both increases.

The faster

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Main memory is implemented from?

A

It is implemented from Dynamic Random Access Memory(DRAM)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The level closer to the processor(caches) uses ?

A

SRAM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Mention the levels in memory hierachy

A

CPU Registers
Static Random Access Memory
Main Memory
Local Disk
Remote Secondary Storage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Describe CPU Registers

A

They are at the top most level of this hierarchy, the hold the most frequently used data.

The are very limited in number and are the fasters
They are often used by the CPU and the ALU for performing arithmetic and logical opertions, for temporary storage of data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are registers

A

A register is a digital circuit with two basic functions: data storage and data movement.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Types of registers

A

Parallel and serial registers

Different manner:
Serial-in/Serial-out
Parallel-in/serial-out
Serial - in / pararell-out
Universal parallel-in/ parallel out

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Describe SRAM

A

SRAM is a type of RAM that holds data in a static form, that is, as long as the memory has power.

SRAM stores a bit of data on four transistors using tow cross-coupled inverters.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is Main Memory or DRAM

A

Dynamic random access is a type of memory that is typically used for data or program code that a computer processor needs to function.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Pro of DRAM

A

Simple design, speed and low cost in comparison to other types

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Con of DRAM

A

Volatility and high power consumption

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Describe Local Disks

A

A local drive is a computer disk drive that is installed directly within the host or the local computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Describe Remote Secondary Storage

A

This includes Distrubuted File System(DFS) and online storage like cloud.

The storage area is vast with low cost but larger access time.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Differences between SRAM and DRAM

A

SRAM stores data till power is supplied while DRAM stored data only for few miliseconds irrespective of the power supply.

Uses nearly 6 transistors for each memory cell. Uses single transistor and capacitor for each memory cell.

Do not referesh the memory cell. Refereshing circuiting is need

Faster data access. Slower access
Consume more power. Low power consumption.
Cost per bit is high. Comparatively lower cost

17
Q

How does data transfer between level work

A

Through blocks

18
Q

What is block

A

The minimum unit of information that can be either present or absent

19
Q

What is a memory unit

A

It is a collection of semi-conductor storage cells with circuits to access the data stored in them.

The data stored in memory is done with words

20
Q

Why memory hierarchy

A

Fast storage techs cost more per byte and have less capacity
Gap betwen CPU and main memory speed is widening
Well written programs tend to exhibit good locality

21
Q

Elements of memory

A

Processor Memory: Present inside the CPU for high spped data access. This consist of small set of registers that act as temporary storage.

Primary Memory: Directly accessed by the CPU. All data must be brought inside the main memory before accessing them.

Secondary memory: This is the cheapest, larage and relatively slow memory component. The data from the secondary memory is accessed by the CPU only after it is loaded to main memory.

22
Q

What trade off among memory

A

Cost
Capacity
Access time

23
Q

What is hit

A

If the requested data is found in the upper levels of memory hierarchy

24
Q

What is miss

A

If the requested data is not found in the upper levels of memory hierarchy

25
Q

What is hit ration

A

It is the fraction of memory access found in the upper level.

26
Q

Formula for hit ration

A

Hit Ratio = Hit/(Hit+Miss)

27
Q

Formula Miss rate

A

1 - hit rate

28
Q

What is hit time

A

The time requried for accessing a level of memory hierarchy, including the time needed for finding whether the memory access is a hit or a miss

29
Q

What is miss penalty

A

The time required for fetching a block into a level of the memory hierarchy from the lower level, including the time to access, transmit , insert it to new level and pass the block to the requestor

30
Q

What is bandwidtg

A

The data transfer rate by the memory

31
Q

What is Latency or access time

A

Memory Latency is the length of time between the memory reciept of a read request and its release of data corresponding with the request.

32
Q
A
32
Q

What is cycle time

A

It is the minimum time betwen requests to memory