Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,379,029 papers from all fields of science
Search
Sign In
Create Free Account
Page (computer memory)
Known as:
Virtual Page
, Huge page
, Page (computing)
Expand
A page, memory page, or virtual page is a fixed-length contiguous block of virtual memory, described by a single entry in the page table. It is the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
47 relations
AN/GYK-12
ASP.NET Web Site Administration Tool
Address space
Apollo VP3
Expand
Broader (2)
Central processing unit
Memory management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
PALLOC: DRAM bank-aware memory allocator for performance isolation on multicore platforms
H. Yun
,
R. Mancuso
,
Z. Wu
,
R. Pellizzoni
IEEE Real Time Technology and Applications…
2014
Corpus ID: 12907842
DRAM consists of multiple resources called banks that can be accessed in parallel and independently maintain state information…
Expand
Highly Cited
2010
Highly Cited
2010
Tree indexing on solid state drives
Yinan Li
,
Bingsheng He
,
Jun Yang
,
Qiong Luo
,
K. Yi
Proceedings of the VLDB Endowment
2010
Corpus ID: 15450842
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high…
Expand
2010
2010
Linux kernel support to exploit phase change memory
K. Park
,
Youngwoo Park
,
S. Park
2010
Corpus ID: 15611273
Recently, phase change memory (PRAM) has been developed as a next generation memory technology. Because PRAM can be accessed as…
Expand
Highly Cited
2010
Highly Cited
2010
Understanding Performance Interference of I/O Workload in Virtualized Cloud Environments
Xing Pu
,
Ling Liu
,
Yiduo Mei
,
Sankaran Sivathanu
,
Younggyun Koh
,
C. Pu
IEEE International Conference on Cloud Computing
2010
Corpus ID: 1525566
Server virtualization offers the ability to slice large, underutilized physical servers into smaller, parallel virtual machines…
Expand
Highly Cited
2000
Highly Cited
2000
Web traffic modeling exploiting TCP connections' temporal clustering through HTML-REDUCE
M. Molina
,
P. Castelli
,
Gianluca Foddis
IEEE Network
2000
Corpus ID: 61613508
This article presents a measurement analysis methodology that, starting from packet-level traces, identifies some statistics…
Expand
Highly Cited
1995
Highly Cited
1995
Hive: fault containment for shared-memory multiprocessors
J. Chapin
,
M. Rosenblum
,
Scott Devine
,
T. Lahiri
,
D. Teodosiu
,
Anoop Gupta
Symposium on Operating Systems Principles
1995
Corpus ID: 6535178
Reliability and scalability are major concerns when designing operating systems for large-scale shared-memory multiprocessors. In…
Expand
1993
1993
Page Migration Algorithms Using Work Functions
M. Chrobak
,
L. Larmore
,
N. Reingold
,
J. Westbrook
J. Algorithms
1993
Corpus ID: 3257969
The page migration problem is the management problem for a globally addressed shared memory in a multiprocessor system. Each…
Expand
Highly Cited
1987
Highly Cited
1987
Process Migration in the Sprite Operating System
F. Douglis
,
J. Ousterhout
IEEE International Conference on Distributed…
1987
Corpus ID: 13482636
This paper describes a process migration facility for the Sprite operating system. In order to provide location-transparent…
Expand
Highly Cited
1985
Highly Cited
1985
Implementing a cache consistency protocol
R. Katz
,
S. Eggers
,
D. Wood
,
Charles L. Perkins
,
R. G. Sheldon
International Symposium on Computer Architecture
1985
Corpus ID: 15406054
We present an ownership-based multiprocessor cache consistency protocol, designed for implementation by a single chip VLSI cache…
Expand
Highly Cited
1966
Highly Cited
1966
MANSON'S TROPICAL DISEASES
G. Cook
,
Alimuddin Zumla
Ulster medical journal
1966
Corpus ID: 35556261
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE