Page Replacement Showdown: FIFO vs LRU

AsterQuiz

Parties jouées 0

Créer une copie

À propos de cette activité

FIFO vs LRU tricks

Créé par

Dr ARUNA S

India

Téléchargez la version pour jouer sur papier

Top 10 résultats

Il n'y a toujours pas de résultats pour ce jeu. Soyez le premier à apparaître dans le classement! Connectez-vous pour vous identifier.

Créez votre propre jeu gratuite à partir de notre créateur de jeu

Affrontez vos amis pour voir qui obtient le meilleur score dans ce jeu

Créer un défi


AsterQuiz Page Replacement Showdown: FIFO vs LRUVersion en ligne FIFO vs LRU tricks par Dr ARUNA S 1 In a 3-frame memory, the pages load in order A, B, C, D, with FIFO replacement for a page fault. Which page is evicted first when E arrives? a C b B c A 2 With LRU, current order of last use is: E, D, C, B, A where A was used long ago. If F arrives, which page should be evicted? a A b E c D 3 Which scenario favors LRU over FIFO? a Random access patterns b Programs with locality of reference c Uniform page usage 4 FIFO can suffer fromBelady’s anomaly, which means: a Misses always decrease b Adding frames may increase expected misses c FIFO becomes faster 5 LRU implementation can be approximated efficiently by using: a A queue b A stack or timestamped counter c Random replacement policy 6 In a sequence 1-2-3-4-1-2-5-1-2-3-4-5 with 3 frames, which page faults are avoided by an efficient LRU strategy? a Never any faults b All misses only c Repeating recent pages 7 Which metric is most directly impacted by FIFO vs LRU choices? a Memory bandwidth b CPU utilization c Page fault rate 8 Which condition makes FIFO particularly poor? a Very small workloads b Constant random access c Sequential access with aging pages 9 With an LRU stack model, the page most recently used is kept at the top of the stack. When a fault occurs, which page is evicted? a Least recently used b Middle recently used c Most recently used 10 Which statement is true about FIFO and LRU? a FIFO is always optimal b LRU tracks usage; FIFO does not c Both require timestamps

AsterQuiz

Page Replacement Showdown: FIFO vs LRUVersion en ligne

FIFO vs LRU tricks

par Dr ARUNA S

In a 3-frame memory, the pages load in order A, B, C, D, with FIFO replacement for a page fault. Which page is evicted first when E arrives?

With LRU, current order of last use is: E, D, C, B, A where A was used long ago. If F arrives, which page should be evicted?

Which scenario favors LRU over FIFO?

Random access patterns

Programs with locality of reference

Uniform page usage

FIFO can suffer fromBelady’s anomaly, which means:

Misses always decrease

Adding frames may increase expected misses

FIFO becomes faster

LRU implementation can be approximated efficiently by using:

A queue

A stack or timestamped counter

Random replacement policy

In a sequence 1-2-3-4-1-2-5-1-2-3-4-5 with 3 frames, which page faults are avoided by an efficient LRU strategy?

Never any faults

All misses only

Repeating recent pages

Which metric is most directly impacted by FIFO vs LRU choices?

Memory bandwidth

CPU utilization

Page fault rate

Which condition makes FIFO particularly poor?

Very small workloads

Constant random access

Sequential access with aging pages

With an LRU stack model, the page most recently used is kept at the top of the stack. When a fault occurs, which page is evicted?

Least recently used

Middle recently used

Most recently used

Which statement is true about FIFO and LRU?

FIFO is always optimal

LRU tracks usage; FIFO does not

Both require timestamps

Vous pouvez intégrer le jeu dans un LMS compatible avec LTI 1.1 ou LTI 1.3 comme Canvas, Moodle ou Blackboard. Les scores seront ainsi automatiquement enregistrés dans le carnet de notes de la plateforme.

Page Replacement Showdown: FIFO vs LRU

AsterQuiz

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

AsterQuiz

Tag Questions Review

AsterQuiz

Science Evidence Quest: Properties of Matter

AsterQuiz

Master the Steps: Geometry & Maps Quiz

AsterQuiz

US History: Pre-Civil War Quiz

AsterQuiz

How much do you know about space?

AsterQuiz

Page Replacement Showdown: FIFO vs LRUVersion en ligne

par Dr ARUNA S

In a 3-frame memory, the pages load in order A, B, C, D, with FIFO replacement for a page fault. Which page is evicted first when E arrives?

With LRU, current order of last use is: E, D, C, B, A where A was used long ago. If F arrives, which page should be evicted?

Which scenario favors LRU over FIFO?

FIFO can suffer fromBelady’s anomaly, which means:

LRU implementation can be approximated efficiently by using:

In a sequence 1-2-3-4-1-2-5-1-2-3-4-5 with 3 frames, which page faults are avoided by an efficient LRU strategy?

Which metric is most directly impacted by FIFO vs LRU choices?

Which condition makes FIFO particularly poor?

With an LRU stack model, the page most recently used is kept at the top of the stack. When a fault occurs, which page is evicted?

Which statement is true about FIFO and LRU?

		%
	Anonyme	%
		%
		%