Filters








2,128 Hits in 3.8 sec

Optimal folding of a paging drum in a three level memory system

Lee J. Scheffier
1973 ACM SIGOPS Operating Systems Review  
In a hypothetical three-level memory system of primary (directly addressable), drum, and tertiary (usually disk) memories, the tradeoffs among drum storage capacity, drum page fetch time, and page fetch  ...  Measurements of the MULTICS three-level memory system are presented as examples of improving multi-level memory performance through drum folding.  ...  The Three-Level Memory S~st~m Our model of a three-level paged virtual memory system consists of: i. a primary memory of size M page frames (usually core), that is directly referenced by programs, into  ... 
doi:10.1145/957195.808050 fatcat:ryoopzw4rzc2flfsonvqv4i4xm

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  ...  These and subsidiary problems are studied from a theoretic view, and are shown to be controllable by a proper combination of hardware and memory management policies.  ...  Pomeranz (of the University of Chicago) for suggesting some refinements in the section on Demand Paging.  ... 
doi:10.1145/356571.356573 fatcat:jenehszezjfp7bozv4wvv2bt54

Virtual storage and virtual machine concepts

R. P. Parmelee, T. I. Peterson, C. C. Tillman, D. J. Hatfield
1972 IBM Systems Journal  
Gold, “Strategies for structuring two-level memories in a paging environment,” Second ACM Symposium on Operating System Principles, Princeton University, 54-59 (October 20-22, 1969).  ...  “Matrix representations and operations are examined for the purpose of minimizing the page faulting occurring in a paged memory system . . .  ... 
doi:10.1147/sj.112.0099 fatcat:peys2o3jyvcgvjb62erlopcczy

TSS/360

Alexander S. Lett, William L. Konigsford
1968 Proceedings of the December 9-11, 1968, fall joint computer conference, part I on - AFIPS '68 (Fall, part I)  
From the collection of the Computer History Museum (www.computerhistory.org) P A Crisman ed MIT Computation Center Cambridge Mfl,sS MIT Press 2nd ed 1965 2 HAKINSLOW The time-sharing monitor system Proc  ...  AFIPS 1964 FJCC Vol 26 Washington DC Spartan Books 1964 pp 443-454 3 WTCOMFORT A computing system design jor user service  ...  an optimal overall system.  ... 
doi:10.1145/1476589.1476593 dblp:conf/afips/LettK68 fatcat:jckfkqb46zd7ze2nbkhim7mnga

An analysis of prepaging

K. S. Trivedi
1979 Computing  
Zusammenfassung An Analysis of Prepaging. Prepaging is advocated as a technique to reduce the excessive page traffic due to the changes in the phases of execution of a program.  ...  The relative space-time product is presented as a measure of the effectiveness of a prepaging scheme. The effect of prepaging on system throughput is studied using a cyclic queuing model.  ...  FDPA keeps a list of pages to be prefetched and at the time of the next page fault, say for page x, it not only fetches x but also fetches as many pages from the list as the memory space permits.  ... 
doi:10.1007/bf02243562 fatcat:bdnumxqjkrffha7e356h5hr3ry

On modeling program behavior

Peter J. Denning
1971 Proceedings of the November 16-18, 1971, fall joint computer conference on - AFIPS '71 (Fall)  
IS In other words, the use of locality as a basis for memory management is close to being optimal.  ...  for drum storage management in time sharing systems Proceedings 3rd ACM Symposium on Operating Systems Principles October 1971 21 J S LIPTAY The cache IBM Sys J 7 11968 pp 15-21 22 J B MORRIS Demand paging  ... 
doi:10.1145/1478873.1478998 dblp:conf/afips/Denning72a fatcat:jpljize3b5an7goqwfrtv2rp6i

Near-Memory Address Translation

Javier Picorel, Djordje Jevdjic, Babak Falsafi
2017 2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT)  
MIPS employs a linear page table of two or three levels (depending on the operating system). The MMU does not integrate a hardware page walker.  ...  achieving a page walk of three memory references.  ...  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

Scheduling TSS/360 for responsiveness

Walter J. Doherty
1970 Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall)  
A high degree of folding is important since it then permits many programs to be folded into main memory simultaneously, thereby providing a potentially significant, increase in the level of multiprogramming  ...  If the level of multiprogramming is sufficiently high then the paging device will be used optimally across all users. Furthermore no unwanted pages will be brought in.  ... 
doi:10.1145/1478462.1478477 dblp:conf/afips/Doherty70 fatcat:rc2hglqj55emzen77d2jzo2sqa

New Products

D.A. Michalopouios
1978 Computer  
'The system is compatible with Primos IV, and runs shared, reentrant procedures that execute in a virtual memory that is segmented, paged, and protected by multiple rings.  ...  The systems perform data inquiry, entry updating and editing, and they support OCR processing at document, page, and image levels.  ... 
doi:10.1109/c-m.1978.218192 fatcat:egexijdhffeofmkph4ab7impzu

Early Nordic Compilers and Autocodes [chapter]

Peter Sestoft
2015 IFIP Advances in Information and Communication Technology  
The early development of compilers for high-level programming languages, and of so-called autocoding systems, is well documented at the international level but not as regards the Nordic countries.  ...  The goal of this paper is to provide a survey of compiler and autocode development in the Nordic countries in the early years, roughly 1953 to 1965, and to relate it to international developments.  ...  Similarly, the dynamic two-level virtual memory (core and drum) run-time management of program fragments in GIER Algol [55] seems original and very effective.  ... 
doi:10.1007/978-3-319-17145-6_36 fatcat:lt5eiuxkw5aczjqplvkqfj4wym

The biological cost of consciousness

Bernard Baars, Bernard Baars
2012 Nature Precedings  
Likewise, attended sensory stimuli are typically reportable as conscious, while memories of those stimuli are not so reportable until they are specifically recalled.  ...  The cortex and thalamus support the reportable qualitative contents of consciousness. Subcortical structures like the cerebellum do not.  ...  The biological cost of consciousness. Nature Precedings, 2012 page 15 1/11/12  ... 
doi:10.1038/npre.2012.6775 fatcat:fdm7bconungl7hy6clg5fun2bu

The biological cost of consciousness

Bernard Baars, Bernard Baars
2012 Nature Precedings  
Likewise, attended sensory stimuli are typically reportable as conscious, while memories of those stimuli are not so reportable until they are specifically recalled.  ...  The cortex and thalamus support the reportable qualitative contents of consciousness. Subcortical structures like the cerebellum do not.  ...  The biological cost of consciousness. Nature Precedings, 2012 page 15 1/11/12  ... 
doi:10.1038/npre.2012.6775.1 fatcat:wlclsvfkn5emnhkd5hjfadn6oe

Large-Scale Physical Modeling Synthesis, Parallel Computing, and Musical Experimentation: The NESS Project in Practice

Stefan Bilbao, James Perry, Paul Graham, Alan Gray, Kostas Kavoussanakis, Gordon Delap, Tom Mudd, Gadi Sassoon, Trevor Wishart, Samson Young
2020 Computer Music Journal  
A basic interface to a parallelized large-scale physical modeling synthesis system is presented here, accompanied by first-hand descriptions of the working methods of five composers, each of whom generated  ...  Severe practical difficulties remain, both at the level of the raw computational resources required, and at the level of user control.  ...  These algorithms are detailed in a companion article in the pages of this issue of Computer Music Journal (Bilbao et al. 2020) .  ... 
doi:10.1162/comj_a_00517 fatcat:w2kvkp5hgnf2zhvzxihos52siq

Scanning Process in Digitization of Records and Archives Materials

Nur Nazeera Asma Ruhaimi, Saiful Farik Mat Yatin, Nur Hajar Mohd Fadzil
2018 International Journal of Academic Research in Business and Social Sciences  
There are also a few example of scanning resolution, In addition, there are also explanation about the scanning process and new technology in the scanning.  ...  There are several types of scanner that have been stated in this academic writing which is flatbed Scanners, Sheet-Fed Scanners, Integrated Scanners , Drum Scanners and Portable Scanners.  ...  Battery-powered mobile scanners store scans on internal memory; they can then be transferred to a computer either via a direct connection, usually USB, or in some cases a memory card can be removed from  ... 
doi:10.6007/ijarbss/v8-i9/4584 fatcat:jzdpzvaabjelxlhjocwc3zjzoy

Effective utilization of IBM 3090 large virtual storage in the numerically intensive computations of ab initio molecular orbitals

M. Sakaki, H. Samukawa, N. Honjou
1988 IBM Systems Journal  
DRUM—Read common data from a disk file in 2.  ...  It is a new level of storage hierarchy, and the MvS/XA operating system utilizes it as high-speed paging equipment, allowing a user to hold application data in large virtual storage (FORTRAN Dynamic Common  ... 
doi:10.1147/sj.274.0528 fatcat:3eg7jhkoafg4xnzfc52gsl475e
« Previous Showing results 1 — 15 out of 2,128 results