By Topic

On the Apparent Continuity of Processing in a Paging Environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chin Tung ; IEEE

The page-faulting rate is one of the important criteria measuring the performance of a virtual storage under demand paging. In a multiprogrammed and/or time-sharing environment, a job is not expected to be run from the beginning to the end without interruption. In effect, it is segmented into phases and run piecewise. When running in this "segmented mode," a job phase upon initiation will most likely not possess the storage contents left by its preceding job phase (from the same job). Further, a job running in a paging environment at time t has a nonzero probability of referencing information brought to the high-speed store before t. Hence, for a given job, the segmented mode will yield a higher page faulting rate than the "continuous mode" in which the job runs continuously from the beginning to the end. By saving and retrieving its "working ensemble" upon the termination and initiation of a job phase, a job can be made to possess an "apparent continuity" insofar as the storage activity is concerned. The performance of the "apparently continuous" mode is hoped to approximate that of the continuous mode with an insignificant amount of overhead. Based on this observation, a storage organization oriented toward the minimization of overhead, is proposed. Simulation has been done for verification.

Published in:

IEEE Transactions on Computers  (Volume:C-19 ,  Issue: 11 )