Paging

Known as: Memory swapping, Swapping, Swap volume 
In computer operating systems, paging is a memory management scheme by which a computer stores and retrieves data from secondary storage for use in… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1953-2018
020040019532017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
As the number of Mobile IP users grows, so will the signalling overhead associated with Internet mobility management in the core… (More)
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In contemporary operating systems, continuous media (CM) applications are sensitive to the behaviour of other tasks in the system… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
We construct an online algorithm for paging that achieves an O(r + log k) competitive ratio when compared to an offline strategy… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
In the area of scientific visualization, input data sets are often very large. In visualization of computational fluid dynamics… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract. We consider the paging problem where the pages have varying size. This problem has applications to page replacement… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper introduces a mobility tracking mechanism that combines a movement-based location update policy with a selective paging… (More)
  • figure 2
  • figure 3
  • figure 8
Is this relevant?
Highly Cited
1991
Highly Cited
1991
*Department of Computer Science, Tel Aviv University, Tel Aviv, Israel 69978; ‘Department of Electrical Engineetig and Computer… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Thepaging problem is that of deciding which pages to keep in a memory ofk pages in order to minimize the number of page faults… (More)
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… (More)
  • 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 nonstat ionary assumptions about program behavior. When… (More)
Is this relevant?