Filters








423 Hits in 6.6 sec

The Multics virtual memory: concepts and design

A. Bensoussan, C. T. Clingen, R. C. Daley
1972 Communications of the ACM  
Here, the design and implementation considerations of segmentation and sharing in Multics are first discussed under the assumption that all information resides in a large, segmented main memory.  ...  Since the size of main memory on contemporary systems is rather limited, it is then shown how the Multics software achieves the effect of a large segmented main memory through the use of the Honeywell  ...  This paper would be incomplete without acknowledgment of the people who worked so hard to build the virtual memory supervisor portion of Multics. Special mention goes to G.  ... 
doi:10.1145/355602.361306 fatcat:co3dcbj6zng4jclkv6k2wh53ye

Virtual memory, processes, and sharing in MULTICS

Robert C. Daley, Jack B. Dennis
1968 Communications of the ACM  
The evolution of the concepts presented in this paper represents the efforts of many members of the MULTICS programming staff.  ...  However, the authors wish to express particular appreciation of the work of F. J. Corbato and R. M. Graham in developing the basic design of the MULTmS linkage mechanism.  ...  In MULTICS, the concept of process is intimately connected with the concept of address space. Processes stand in one-to-one correspondence with virtual memories.  ... 
doi:10.1145/363095.363139 fatcat:2c43owht3vhtzcnajttibrzoqa

Virtual memory, processes, and sharing in Multics

Robert C. Daley, Jack B. Dennis
1967 Proceedings of the ACM symposium on Operating System Principles - SOSP '67  
The evolution of the concepts presented in this paper represents the efforts of many members of the MULTICS programming staff.  ...  However, the authors wish to express particular appreciation of the work of F. J. Corbato and R. M. Graham in developing the basic design of the MULTmS linkage mechanism.  ...  In MULTICS, the concept of process is intimately connected with the concept of address space. Processes stand in one-to-one correspondence with virtual memories.  ... 
doi:10.1145/800001.811668 fatcat:aiimy5b2tbbqvaxuu6s765mhjm

An Efficient Virtual Memory using Graceful Code

Divya YA
2019 International Journal of Trend in Scientific Research and Development  
When too many programs are simultaneously it is possible to run a program out of memory. This is the concept where virtual memory comes.  ...  The process of mapping data and forth between the hard disc and RAM takes longer than accessing it directly from the memory.  ...  Virtual memory is specialized to design to automate the movement of data and code between secondary memory and RAM to give the appearance of a single large store.  ... 
doi:10.31142/ijtsrd23878 fatcat:ptiv6gpbffgjddpg7x5kluu2b4

Lightweight recoverable virtual memory

M. Satyanarayanan, Henry H. Mashburn, Puneet Kumar, David C. Steere, James J. Kistler
1993 Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93  
Segments and Regions Recoverable memory is managed in segments, which are loosely analogous to Multics segments.  ...  Camelot taught us the value of recoverable virtual memory and showed us the merits and pitfalls of a specific approach to its implementation.  ... 
doi:10.1145/168619.168631 dblp:conf/sosp/SatyanarayananMKSK93 fatcat:br7dsj37iffnxaic7re7etpzke

Lightweight recoverable virtual memory

M. Satyanarayanan, Henry H. Mashburn, Puneet Kumar, David C. Steere, James J. Kistler
1993 ACM SIGOPS Operating Systems Review  
Segments and Regions Recoverable memory is managed in segments, which are loosely analogous to Multics segments.  ...  Camelot taught us the value of recoverable virtual memory and showed us the merits and pitfalls of a specific approach to its implementation.  ... 
doi:10.1145/173668.168631 fatcat:xl32xlkfrndwhlkwal2cmlihyu

Lightweight recoverable virtual memory

M. Satyanarayanan, Henry H. Mashburn, Puneet Kumar, David C. Steere, James J. Kistler
1994 ACM Transactions on Computer Systems  
Segments and Regions Recoverable memory is managed in segments, which are loosely analogous to Multics segments.  ...  Camelot taught us the value of recoverable virtual memory and showed us the merits and pitfalls of a specific approach to its implementation.  ... 
doi:10.1145/174613.174615 fatcat:rxmpdemslnd5roeo4hqoluv2mq

Memory coherence in shared virtual memory systems

Kai Li, Paul Hudak
1986 Proceedings of the fifth annual ACM symposium on Principles of distributed computing - PODC '86  
The memory coherence problem in designing and implementing a shared virtual memory on loosely coupled multiprocessors is studied in depth.  ...  Two classes of algorithms, centralized and distributed, for solving the problem are presented. A prototype shared virtual memory on an Apollo ring based on these algorithms has been implemented.  ...  ACKNOWLEDGMENTS We wish to thank John Ellis for his invaluable suggestions and helpful discussions in the early stages of this research.  ... 
doi:10.1145/10590.10610 dblp:conf/podc/LiH86 fatcat:s7yzom3qnjdq5htl3rqqkrcelu

Memory coherence in shared virtual memory systems

Kai Li, Paul Hudak
1989 ACM Transactions on Computer Systems  
The memory coherence problem in designing and implementing a shared virtual memory on loosely coupled multiprocessors is studied in depth.  ...  Two classes of algorithms, centralized and distributed, for solving the problem are presented. A prototype shared virtual memory on an Apollo ring based on these algorithms has been implemented.  ...  ACKNOWLEDGMENTS We wish to thank John Ellis for his invaluable suggestions and helpful discussions in the early stages of this research.  ... 
doi:10.1145/75104.75105 fatcat:ines7w5ojjfxtapjkzpscekhpe

Virtual Memory

Peter J. Denning
1970 ACM Computing Surveys  
In a virtual memory, the addresses a program may use to identify information are distinguished from the addresses the memory system uses to identify physical storage sites, and program-generated addresses  ...  Two principal methods for implementing virtual memory, segmentation and paging, are compared and contrasted.  ...  Galler and Bruce W. Arden (both of the University of Michigan), and to David Sayre (of I B M T. J. Watson Research Center), whose penetrating comments proved invaluable in improving the manuscript.  ... 
doi:10.1145/356571.356573 fatcat:jenehszezjfp7bozv4wvv2bt54

Near-Memory Address Translation

Javier Picorel, Djordje Jevdjic, Babak Falsafi
2017 2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT)  
It is not clear the main reason why early PC designs distanced themselves from the concepts that had worked so well in mainframes.  ...  Early Virtual Memory Designs Even in the early days of computing, system designers realized that fast access to a large amount of storage is hard and expensive, and therefore computer memories have to  ...  Furthermore, we place the page table entries next to the data in the form of an inverted page table, either in SRAM or embedded in DRAM, so that the data fetch and translation operations are completely  ... 
doi:10.1109/pact.2017.56 dblp:conf/IEEEpact/PicorelJF17 fatcat:zgsfj7v4pjazdcfb5hcyemndea

Addressing Mechanisms for Large Virtual Memories

J. Rosenberg, J. L. Keedy, D. Abramson
1992 Computer journal  
This paper presents hardware and software mechanisms to implement a paged virtual memory which can be efficiently accessed by large addresses.  ...  An additional incentive for supporting large virtual addresses is an interest in exploiting the potential of very large main memories to achieve supercomputer speed.  ...  Their constructive comments and suggestions have resulted in substantial improvements to the paper.  ... 
doi:10.1093/comjnl/35.4.369 fatcat:spljagy4tfdobhmmclgf7fymfi

Twizzler: a Data-Centric OS for Non-Volatile Memory

Daniel Bittman, Peter Alvaro, Pankaj Mehra, Darrell D. E. Long, Ethan L. Miller
2020 USENIX Annual Technical Conference  
data serialization, and complexity in data sharing requiring the overhead of pipes or the management cost of shared virtual memory.  ...  Virtual memory mappings are, by contrast, ephemeral and so cannot effectively name persistent data.  ...  We thank our shepherd, Yu Hua, the anonymous reviewers, and the members of the Storage Systems Research Center for their support and feedback.  ... 
dblp:conf/usenix/BittmanAMLM20 fatcat:xwryk64tbvha3gge4n6srm4tvq

Virtual-ROM: A New Demand Paging Component for RTOS and NAND Flash Memory Based Mobile Devices [chapter]

Hyojun Kim, Jihyun In, DongHoon Ham, SongHo Yoon, Dongkun Shin
2006 Lecture Notes in Computer Science  
Virtual-ROM is a light-weight demand paging solution designed for RTOS based mobile devices. It is OS-independent, easy-to-use, and well optimized for NAND flash memory.  ...  A virtual memory technique is promising as a RAM saving solution.  ...  The virtual memory concept was introduced in the 1950s.  ... 
doi:10.1007/11902140_71 fatcat:zwpkyf5psvhmnay5a4ymugu5qq

Virtual memory on data diffusion architectures

Jorge Buenabad-Chávez, Henk L Muller, Paul W.A Stallard, David H.D Warren
2003 Parallel Computing  
For the provision of diffusion space to be adequate, our results on set-associative memory suggest the need for a simple interaction between virtual memory software and the data diffusing hardware. i Acknowledgements  ...  This thesis presents an analysis of possible ways to organise virtual memory on such machines, and proposes two main alternatives: traditional virtual memory (TVM) is organised around a fixed and contiguous  ...  Acknowledgements It is a pleasure to thank the people who made possible the completion of this work. The British Council, CINVESTAV 1 , CONACyT 2 and SEP 3 provided the necessary funds.  ... 
doi:10.1016/s0167-8191(03)00088-7 fatcat:gsvwk6bp2na2zbturcplocdpr4
« Previous Showing results 1 — 15 out of 423 results