article

Free access

Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store

Author:

John FotheringhamAuthors Info & Claims

Communications of the ACM, Volume 4, Issue 10

Pages 435 - 436

https://doi.org/10.1145/366786.366800

Published: 01 October 1961 Publication History

PDF eReader

Abstract

No abstract available.

Cited By

View all

Denning P(2021)Working Set AnalyticsACM Computing Surveys10.1145/339970953:6(1-36)Online publication date: 2-Feb-2021
https://dl.acm.org/doi/10.1145/3399709
Hajinazar NPatel PPatel MKanellopoulos KGhose SAusavarungnirun ROliveira GAppavoo JSeshadri VMutlu OMartínez JDuato JEeckhout L(2020)The virtual block interfaceProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00089(1050-1063)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00089
Guvenilir FPatt YMartínez JDuato JEeckhout L(2020)Tailored page sizesProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00078(900-912)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00078
Show More Cited By

Index Terms

Dynamic storage allocation in the Atlas computer, including an automatic use of a backing store
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Allocation / deallocation strategies

Recommendations

LSM-tree managed storage for large-scale key-value store
SoCC '17: Proceedings of the 2017 Symposium on Cloud Computing

Key-value stores are increasingly adopting LSM-trees as their enabling data structure in the backend storage, and persisting their clustered data through a file system. A file system is expected to not only provide file/directory abstraction to organize ...
LSM-Tree Managed Storage for Large-Scale Key-Value Store

Key-value stores are increasingly adopting LSM-trees as their enabling data structure in the backend block storage, and persisting their clustered data through a block manager, usually a file system. In general, a file system is expected to not only ...
An Efficient Memory-Mapped Key-Value Store for Flash Storage
SoCC '18: Proceedings of the ACM Symposium on Cloud Computing

Persistent key-value stores have emerged as a main component in the data access path of modern data processing systems. However, they exhibit high CPU and I/O overhead. Today, due to power limitations it is important to reduce CPU overheads for data ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 4, Issue 10

Oct. 1961

59 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/366786

Editor:
Alan J. Perlis
Carnegie Institute of Technology, Pittsburgh, PA

Issue’s Table of Contents

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 October 1961

Published in CACM Volume 4, Issue 10

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

82
Total Citations
View Citations
984
Total Downloads

Downloads (Last 12 months)131
Downloads (Last 6 weeks)19

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Denning P(2021)Working Set AnalyticsACM Computing Surveys10.1145/339970953:6(1-36)Online publication date: 2-Feb-2021
https://dl.acm.org/doi/10.1145/3399709
Hajinazar NPatel PPatel MKanellopoulos KGhose SAusavarungnirun ROliveira GAppavoo JSeshadri VMutlu OMartínez JDuato JEeckhout L(2020)The virtual block interfaceProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00089(1050-1063)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00089
Guvenilir FPatt YMartínez JDuato JEeckhout L(2020)Tailored page sizesProceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture10.1109/ISCA45697.2020.00078(900-912)Online publication date: 30-May-2020
https://dl.acm.org/doi/10.1109/ISCA45697.2020.00078
Seltzer MMarathe VByan S(2018)An NVM Carol: Visions of NVM Past, Present, and Future2018 IEEE 34th International Conference on Data Engineering (ICDE)10.1109/ICDE.2018.00011(15-23)Online publication date: Apr-2018
https://doi.org/10.1109/ICDE.2018.00011
Bilardi GEkanadham KPattnaik PGiorgi RBecchi MPalumbo F(2017)Optimal On-Line Computation of Stack Distances for MIN and OPTProceedings of the Computing Frontiers Conference10.1145/3075564.3075571(237-246)Online publication date: 15-May-2017
https://dl.acm.org/doi/10.1145/3075564.3075571
Mauroner FBaunach M(2017)StackMMU: Dynamic stack sharing for embedded systems2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)10.1109/ETFA.2017.8247614(1-9)Online publication date: 12-Sep-2017
https://dl.acm.org/doi/10.1109/ETFA.2017.8247614
van de Belt JAhmadi HDoyle L(2017)Defining and Surveying Wireless Link Virtualization and Wireless Network VirtualizationIEEE Communications Surveys & Tutorials10.1109/COMST.2017.270489919:3(1603-1627)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1109/COMST.2017.2704899
Blagojević VBojić DBojović MCvetanović MĐorđević JĐurđević ĐFurlan BGajin SJovanović ZMilićev DMilutinović VNikolić BProtić JPunt MRadivojević ZStanisavljević ŽStojanović STartalja ITomašević MVuletić P(2017)A Systematic Approach to Generation of New Ideas for PhD Research in ComputingCreativity in Computing and DataFlow SuperComputing10.1016/bs.adcom.2016.09.001(1-31)Online publication date: 2017
https://doi.org/10.1016/bs.adcom.2016.09.001
Atachiants RDoherty GGregg D(2016)Parallel Performance Problems on Shared-Memory Multicore SystemsIEEE Transactions on Software Engineering10.1109/TSE.2016.251934642:8(764-785)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1109/TSE.2016.2519346
Seshadri VPekhimenko GRuwase OMutlu OGibbons PKozuch MMowry TChilimbi T(2015)Page overlaysACM SIGARCH Computer Architecture News10.1145/2872887.275037943:3S(79-91)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2872887.2750379
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

Cited By

Index Terms

Recommendations

LSM-tree managed storage for large-scale key-value store

LSM-Tree Managed Storage for Large-Scale Key-Value Store

An Efficient Memory-Mapped Key-Value Store for Flash Storage

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

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