Results 211 to 220 of about 1,433,501 (267)
Some of the next articles are maybe not open access.

Related searches:

Green Paging and Parallel Paging

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
We study two fundamental variants of the classic paging problem: green paging and parallel paging. In green paging one can choose the exact memory capacity in use at any given instant, between a maximum of k and a minimum of k/p pages; the goal is to minimize the integral of this number over the time required to complete a computation (note that ...
Agrawal K.   +5 more
openaire   +2 more sources

Page size in demand-paging systems

Acta Informatica, 1973
The problem of determining page size in a page on demand system is discussed in detail in this paper. After having introduced the problem, the effect page size may have on various system performance measures is reviewed based on measurements of program behaviour and on simple models of system behaviour.This discussion is followed by a detailled study ...
Erol Gelenbe   +2 more
openaire   +2 more sources

Markov Paging

SIAM Journal on Computing, 1992
Summary: This paper considers the problem of 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 algorithm that achieves optimal fault-rate on any Markov chain ...
Anna R. Karlin   +2 more
openaire   +2 more sources

WWW Front Pages, Home Pages, Entry Pages and Root Pages

1996
Whenever one has a body of hypertext materials that stands alone either because it occupies an entire system or because it exists, however, transiently, within a frame, the reader has to begin reading at some point, and for the reader, that point is a beginning. (Landow 1994).
openaire   +1 more source

Sibling Page Search by Page Examples

2006
We propose methods of searching Web pages that are “semantically” regarded as “siblings” with respect to given page examples. That is, our approach aims to find pages that are similar in theme but have different content from the given sample pages. We called this “sibling page search”. The proposed search methods are different from conventional content-
Hiroaki Ohshima   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy