Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,953 papers for “Paging”

Paging

John H Maloney · Bulletin of Miscellaneous Information (Royal Gardens Kew)

Cited by 0

Paging

van Stee, R. · MPG.PuRe (Max Planck Society) · 2008

Cited by 0

Paging

Rob van Stee · MPG.PuRe (Max Planck Society) · 2008

Cited by 0

paging

SpringerReference · 2011

Cited by 0

Paging

van Stee, Rob · Max Planck Institute for Plasma Physics · 2008

Cited by 0

Paging

Rahul Vaze · 2023

In this chapter, we consider a classical online problem, called paging, where a file request sequence is served from two memories – one fast, called the cache, with finite size, and the other slow, which contains all the files. On a file request, if that file is not found in the cache, then it is loaded from the large memory into the cache by ejecting one of the existing files of the cache. Each such ejection is called a fault and the goal is to minimize the total number of faults without knowing the future file request sequence.

Cited by 0

Paging doctors

Andison, Alex W. · PubMed Central · 1984

Cited by 0Open access

Skytel Paging

http://www.skytel.com · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 1999

This application allows users to send alpha-numeric messages to users on the Skytel paging system. Just enter the recipient's pin number, type your message and the message will quickly show up on the end user's pager. This program will come in handy if you aren't near a computer and need to send a text message. Note: This PQA has only been tested on a Palm VII.

Cited by 0

MARKOV PAGING

Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan · 2000

This paper considers the problemof paging under the assumption that the sequence of pages accessed is generated by a Markov chain. We use this model to study the fault-rate of paging algorithms. We first draw on the theory of Markov decision processes to characterize the paging algorithmthat achieves optimal fault-rate on any Markov chain. Next, we address the problemof devising a paging strategy with low fault-rate for a given Markov chain. We show that a number of intuitive approaches fail. Our main result is a polynomial-time procedure that, on any Markov chain, will give a paging algorithm with fault-rate at most a constant times optimal. Our techniques show also that some algorithms that do poorly in practice fail in the Markov setting, despite known (good) performance guarantees when the requests are generated independently from a probability distribution.

Cited by 0

Markov paging

Anna R. Karlin, S.J. Phillips, Prabhakar Raghavan · 1992

This paper considers the problem of paging under the assumption that the sequence of pages accessed is generated by a Markov chain. The authors use this model to study the fault-rate of paging algorithms, a quantity of interest to practitioners. They first draw on the theory of Markov decision processes to characterize the paging algorithm that achieves optimal fault-rate on any Markov chain. They address the problem of efficiently devising a paging strategy with low fault-rate for a given Markov chain. They show that a number of intuitively good approaches fail. Their main result is an efficient procedure that, on any Markov chain, will give a paging algorithm with fault-rate at most a constant times optimal. Their techniques also show that some algorithms that do poorly in practice fail in the Markov setting, despite known (good) performance guarantees when the requests are generated independently from a probability distribution.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 69

Paging forward

Dydia DeLyser, Harriet Hawkins, Anna J. Secor et al. · Cultural Geographies · 2021

Cited by 0Open access

Paging system

Fox, J · CERN Document Server (European Organization for Nuclear Research) · 1973

Cited by 0

Paging Procrustes

Dickey, Roland F. · UNM’s Digital Repository (University of New Mexico) · 2017

Cited by 0Open access

Paging Parents

Collins, Stephen · Digital Commons - Colby (Colby College) · 2014

Cited by 0Open access

Elastic paging

Enoch Peserico · ACM SIGMETRICS Performance Evaluation Review · 2013

We study a generalization of the classic paging problem where memory capacity can vary over time - a property of many modern computing realities, from cloud computing to multi-core and energy-optimized processors. We show that good performance in the "classic" case provides no performance guarantees when memory capacity fluctuates: roughly speaking, moving from static to dynamic capacity can mean the difference between optimality within a factor 2 in space, time and energy, and suboptimality by an arbitrarily large factor. Surprisingly, several classic paging algorithms still perform remarkably well, maintaining that factor 2 optimality even if faced with adversarial capacity fluctuations - without taking those fluctuations into explicit account!

Cited by 1

paging, n.²

Oxford University Press eBooks · 2023

Cited by 0