Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Paging

Known as: Memory swapping, Swap volume, 386SPART.PAR 
In computer operating systems, paging is a memory management scheme by which a computer stores and retrieves data from secondary storage for use in… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Current logistics and transportation (LT and (b) strategic, planning and operational issues associated with “standard” EVs and… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2016
Highly Cited
2016
It this paper we revisit the fast stylization method introduced in Ulyanov et. al. (2016). We show how a small change in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We propose to detect abnormal events via a sparse reconstruction over the normal bases. Given an over-complete normal basis set… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We show that financial sector bailouts and sovereign credit risk are intimately linked. A bailout benefits the economy by… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 4
  • figure 8
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We present the design, implementation, and evaluation of post-copy based live migration for virtual machines (VMs) across a… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Thepaging problem is that of deciding which pages to keep in a memory ofk pages in order to minimize the number of page faults… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1971
Highly Cited
1971
ABSTP~CT. A formal model is presented for paging algorithms under /-order nonstationary assumptions about program behavior. When… Expand
Is this relevant?