Please Login To Continue

Translation look-aside buffer (TLB) in paging.

Lesson 36 of 43 • 9 upvotes • 14:29mins

Avatar

Ansha P

This lesson explains the memory cache TLB (Translation Look aside Buffer).

Continue on app
1

Introduction, Process and Thread

15:00mins

2

Process Layout, Context switching, PCB

12:52mins

3

Process Scheduling, Different types of Schedulers

13:09mins

4

Terms related to processes, FCFS Algorithm

13:28mins

5

Shortest Job First, Shortest Remaining Time First

14:09mins

6

Priority Scheduling (Preemptive and Non Preemptive)

13:05mins

7

Round Robin Scheduling.

14:34mins

8

Multilevel Queue Scheduling, Multilevel Feedback Queue Scheduling.

10:48mins

9

Convoy Effect in FCFS.

9:26mins

10

SJF with prediction of Burst time.

14:37mins

11

Comparison of Scheduling Algorithms.

14:28mins

12

Introduction to Process Sychronization, Race condition

11:22mins

13

Critical section.

9:33mins

14

Hardware solutions for Critical section, Disable interrupt, Test and set instruction.

13:05mins

15

Compare and swap instruction.

11:19mins

16

Test and set instruction with bounded waiting.

14:14mins

17

Peterson's solution for Critical section problem.

8:30mins

18

Mutex and semaphore for solving Critical section problem.

11:29mins

19

Producer- Consumer problem / Bounded buffer problem.

13:51mins

20

Readers- Writers problem.

14:55mins

21

Dining philosophers problem.

12:31mins

22

Interprocess Communication.

13:19mins

23

Deadlocks

12:11mins

24

Handling deadlocks - Deadlock prevention

11:42mins

25

Deadlock avoidance- Resource allocation graph algorithm.

9:42mins

26

Banker's Algorithm.

15:00mins

27

Banker's Algorithm - Resource Request algorithm

14:39mins

28

Deadlock prevention and recovery.

10:53mins

29

Memory management - Introduction.

13:40mins

30

Logical & Physical address, Address binding, Dynamic loading & linking.

9:34mins

31

Contiguous memory allocation.

9:56mins

32

Memory allocation algorithms - First fit, Best fit and Worst fit.

10:45mins

33

Non contiguous memory allocation - Segmentation

11:26mins

34

Non contiguous memory allocation- Paging

12:54mins

35

Hierarchical paging, Hashed page tables, Inverted page tables.

10:56mins

36

Translation look-aside buffer (TLB) in paging.

14:29mins

37

Virtual memory

8:50mins

38

Demand paging, Page faults & Page replacement.

11:37mins

39

Optimal Page replacement algorithm.

9:55mins

40

Least Recently Used (LRU) Page replacement algorithm

10:25mins

41

First In First Out (FIFO) Page replacement algorithm.

13:52mins

42

Counting Based Page replacement algorithms.

14:01mins

43

An interesting question on Semaphore

15:00mins

Crack GATE - Iconic Pro with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Structured syllabus
Daily live classes
Daily live classes
Ask doubts
Ask doubts
Tests & practice
Tests & practice

More from Ansha P

thumbnail
EnglishCS & IT

An Overview of Minimum Spanning Trees

Ansha P

Similar Plus Courses

Unacademy is India’s largest online learning platform. Download our apps to start learning


Starting your preparation?

Call us and we will answer all your questions about learning on Unacademy

Call +91 8585858585
Company
About usShikshodayaCareersBlogsPrivacy PolicyTerms and Conditions
Products
Learner appLearner appEducator appEducator appParent appParent app