Article

Free access

A study of the effect of user program optimization in a paging system

Author:

Lesin W. ComeauAuthors Info & Claims

SOSP '67: Proceedings of the first ACM symposium on Operating System Principles

Pages 4.1 - 4.7

https://doi.org/10.1145/800001.811667

Published: 01 January 1967 Publication History

PDF eReader

Abstract

Much attention has been directed to paging algorithms and little to the role of the user in this environment. This paper describes an experiment which is an attempt to determine the significance of efforts by the user to improve the paging characteristics of his program.

The problem of throughput in a computing system is primarily one of balancing the flow of data and programs through a hierarchy of storages. The problem is considered solved when for every available processor cycle there is a matching demand for that cycle in the primary (execution) store. Since programs and their data usually originate in a location other than the execution store, there is a delay associated with the movement of data and programs to the primary store. The delay has two components, the operational speed (data transfer time) and the positioning, or access time, of the secondary storage device. Since the access time usually exceeds the data transfer time by an order of magnitude, the problem of transferring information to the primary store has been named the “access gap” problem.

References

[1]

T. Kilburn, D.B.G. Edwards, M.J. Lenigan, and F. H. Sumner, "One Level Storage System" - IRE Transactions on Electronic Computers, Vol. EC-12, PP. 223-235, April, 1962.

Crossref

Google Scholar

[2]

O'Neill, R. W. - "Experience Using A Timesharing Multiprogramming System with Dynamic Address Relocation Hardware". AFIPS Conference Proceedings, Vol. 30, PP. 611-621, April, 1957.

Google Scholar

[3]

G. H. Fine, C. W. Jackson, and P. V. McIssac, "Dynamic Program Behaviour Under Paging", System Development Corporation SP-2397, June, 1966.

Google Scholar

[4]

Cambridge Monitor System - A user's manual available from the Cambridge Scientific Center.

Google Scholar

[5]

A. B. Lindquist, R. R. Seeber, and L. W. Comeau - "A Time-Sharing System Using an Associative Memory", Proceedings of the IEE, Special Issue on Computers, Vol. 54, No. 12, PP. 1774-1779, December, 1966.

Crossref

Google Scholar

[6]

R. J. Adair, R. U. Bayles, L. W. Comeau, and R. J. Creasy - "A Virtual Machine System for the 360/40", Cambridge Scientific Center Report 36. 010, May, 1966.

Google Scholar

Cited By

View all

Anjos MNeto J(2019)Spectral bounds for graph partitioning with prescribed partition sizesDiscrete Applied Mathematics10.1016/j.dam.2019.06.007Online publication date: Jun-2019
https://doi.org/10.1016/j.dam.2019.06.007
Menouar B(2010)Genetic algorithm encoding representations for graph partitioning problems2010 International Conference on Machine and Web Intelligence10.1109/ICMWI.2010.5648133(288-291)Online publication date: Oct-2010
https://doi.org/10.1109/ICMWI.2010.5648133
Jacob BNg SWang D(2007)Memory SystemsundefinedOnline publication date: 10-Sep-2007
Show More Cited By

Index Terms

A study of the effect of user program optimization in a paging system
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Virtual memory

Recommendations

Fast and Low Overhead Metadata Operations for NVM-Based File System Using Slotted Paging
Existing nonvolatile memory (NVM)-based file systems can fully leverage the characteristics of NVM to obtain better performance than traditional disk-based file systems. It has the potential capacity to efficiently manage metadata and perform fast ...
A five-year study of file-system metadata

For five years, we collected annual snapshots of file-system metadata from over 60,000 Windows PC file systems in a large corporation. In this article, we use these snapshots to study temporal changes in file size, file age, file-type frequency, ...
iSCSI Simulation Study of Storage System
UKSIM '08: Proceedings of the Tenth International Conference on Computer Modeling and Simulation

Demands for more storage in the industry has increased beyond that the traditional storage mechanisms can supply and thus, the concept of Storage Area Networks (SANs) has evolved. This has resulted in the design of iSCSI (Internet SCSI) protocols that ...

Comments

Information & Contributors

Information

Published In

SOSP '67: Proceedings of the first ACM symposium on Operating System Principles

January 1967

300 pages

ISBN:9781450373708

DOI:10.1145/800001

Editors:
J. Gosden,
B. Randell

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1967

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 131 of 716 submissions, 18%

Upcoming Conference

SOSP '24

Sponsor:
sigops

ACM SIGOPS 30th Symposium on Operating Systems Principles

November 5 - 8, 2024

Austin , TX , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
415
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)9

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Anjos MNeto J(2019)Spectral bounds for graph partitioning with prescribed partition sizesDiscrete Applied Mathematics10.1016/j.dam.2019.06.007Online publication date: Jun-2019
https://doi.org/10.1016/j.dam.2019.06.007
Menouar B(2010)Genetic algorithm encoding representations for graph partitioning problems2010 International Conference on Machine and Web Intelligence10.1109/ICMWI.2010.5648133(288-291)Online publication date: Oct-2010
https://doi.org/10.1109/ICMWI.2010.5648133
Jacob BNg SWang D(2007)Memory SystemsundefinedOnline publication date: 10-Sep-2007
Hadley SMark BVannelli A(2006)An efficient eigenvector approach for finding netlist partitionsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.14485211:7(885-892)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.144852
Weinberg G(2006)Programming and compiling strategies for paging systemsSoftware: Practice and Experience10.1002/spe.43800202062:2(165-171)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380020206
Bui T(2001)Graph PartitioningEncyclopedia of Optimization10.1007/0-306-48332-7_186(902-908)Online publication date: 2001
https://doi.org/10.1007/0-306-48332-7_186
Rao PJayathirtha CRaghavendraprasad C(1998)New net models for spectral netlist partitioningProceedings Eleventh International Conference on VLSI Design10.1109/ICVD.1998.646642(406-411)Online publication date: 1998
https://doi.org/10.1109/ICVD.1998.646642
Saab Y(1995)A Fast and Robust Network Bisection AlgorithmIEEE Transactions on Computers10.1109/12.39284844:7(903-913)Online publication date: 1-Jul-1995
https://dl.acm.org/doi/10.1109/12.392848
Orr DMecklenburg RHoogenboom PLepreau J(1994)Dynamic Program Monitoring and Transformation using the OMOS Object ServerThe Interaction of Compilation Technology and Computer Architecture10.1007/978-1-4615-2684-1_6(137-159)Online publication date: 1994
https://doi.org/10.1007/978-1-4615-2684-1_6
Orr DMecklenburg RHoogenboom PLepreau J(1993)Dynamic program monitoring and transformation using the OMOS object server[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences10.1109/HICSS.1993.270741(232-241)Online publication date: 1993
https://doi.org/10.1109/HICSS.1993.270741
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Fast and Low Overhead Metadata Operations for NVM-Based File System Using Slotted Paging

A five-year study of file-system metadata

iSCSI Simulation Study of Storage System

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations