WSClock page replacement algorithm
E651431
The WSClock page replacement algorithm is an operating system memory management technique that combines the working set model with a clock-based mechanism to efficiently decide which pages to evict.
All labels observed (1)
| Label | Occurrences |
|---|---|
| WSClock page replacement algorithm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7252929 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: WSClock page replacement algorithm Context triple: [working set model, influenced, WSClock page replacement algorithm]
-
A.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
B.
"Time, Clocks, and the Ordering of Events in a Distributed System"
"Time, Clocks, and the Ordering of Events in a Distributed System" is a seminal 1978 paper that introduced logical clocks and the happened-before relation, fundamentally shaping the theory and practice of distributed computing.
-
C.
Automatic Storage Management
Automatic Storage Management is Oracle's integrated volume manager and file system that simplifies and optimizes the management of database storage.
-
D.
Banker's algorithm
Banker's algorithm is a classic deadlock-avoidance algorithm in operating systems that safely allocates resources to processes by simulating and verifying that the system will remain in a safe state.
-
E.
Cascade Locks
Cascade Locks is a small city in northern Oregon along the Columbia River Gorge, known as a gateway to outdoor recreation and scenic waterfalls.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: WSClock page replacement algorithm Target entity description: The WSClock page replacement algorithm is an operating system memory management technique that combines the working set model with a clock-based mechanism to efficiently decide which pages to evict.
-
A.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
B.
"Time, Clocks, and the Ordering of Events in a Distributed System"
"Time, Clocks, and the Ordering of Events in a Distributed System" is a seminal 1978 paper that introduced logical clocks and the happened-before relation, fundamentally shaping the theory and practice of distributed computing.
-
C.
Automatic Storage Management
Automatic Storage Management is Oracle's integrated volume manager and file system that simplifies and optimizes the management of database storage.
-
D.
Banker's algorithm
Banker's algorithm is a classic deadlock-avoidance algorithm in operating systems that safely allocates resources to processes by simulating and verifying that the system will remain in a safe state.
-
E.
Cascade Locks
Cascade Locks is a small city in northern Oregon along the Columbia River Gorge, known as a gateway to outdoor recreation and scenic waterfalls.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
memory management algorithm
ⓘ
operating system concept ⓘ page replacement algorithm ⓘ |
| avoidsEvicting |
dirty pages when possible
ⓘ
recently used pages ⓘ |
| basedOn |
clock page replacement algorithm
ⓘ
working set model ⓘ |
| category | operating systems memory management ⓘ |
| combines |
clock-based mechanism
ⓘ
working set model ⓘ |
| hasAdvantage |
better approximation of working set than simple clock
ⓘ
good performance under varying workloads ⓘ low overhead compared to full working set algorithm ⓘ |
| hasGoal |
approximate working set behavior
ⓘ
efficient page eviction ⓘ limit paging overhead ⓘ reduce page fault rate ⓘ |
| hasParameter | working set window size ⓘ |
| hasTradeoff | choice of working set window affects performance ⓘ |
| isComparedTo |
LRU page replacement algorithm
ⓘ
clock page replacement algorithm ⓘ working set page replacement algorithm ⓘ |
| isUsedFor |
deciding which page to evict on page fault
ⓘ
managing physical memory frames ⓘ |
| maintains |
circular list of page frames
ⓘ
per-page modify bit ⓘ per-page reference bit ⓘ per-page time stamp of last use ⓘ |
| oftenAssumes | hardware support for modify bits ⓘ |
| operatesIn |
demand paging system
ⓘ
virtual memory system ⓘ |
| prefersToEvict | clean pages ⓘ |
| relatedTo |
Belady anomaly
ⓘ
thrashing control ⓘ |
| requires | hardware support for reference bits ⓘ |
| selectsForEviction |
pages outside working set
ⓘ
unreferenced pages older than working set window ⓘ |
| usesConcept |
modify bit
ⓘ
page frame ⓘ reference bit ⓘ time of last use ⓘ virtual memory ⓘ working set ⓘ working set window ⓘ |
| usesDataStructure |
circular buffer
ⓘ
clock hand pointer ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: WSClock page replacement algorithm Description of subject: The WSClock page replacement algorithm is an operating system memory management technique that combines the working set model with a clock-based mechanism to efficiently decide which pages to evict.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.