Log in

Relevant bibliographies by topics / Virtual memory systems

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Virtual memory systems'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Virtual memory systems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Virtual memory systems"

1

Li, Kai, and Paul Hudak. "Memory coherence in shared virtual memory systems." ACM Transactions on Computer Systems 7, no. 4 (November 1989): 321–59. http://dx.doi.org/10.1145/75104.75105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sato, Masaya, and Hideo Taniguchi. "OFF2F: A New Object File Format for Virtual Memory Systems to Support Volatile/non-Volatile Memory-Mixed Environment." International Journal of Machine Learning and Computing 9, no. 4 (August 2019): 387–92. http://dx.doi.org/10.18178/ijmlc.2019.9.4.815.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ji, Seunggu, and Dongkun Shin. "An efficient garbage collection for flash memory-based virtual memory systems." IEEE Transactions on Consumer Electronics 56, no. 4 (November 2010): 2355–63. http://dx.doi.org/10.1109/tce.2010.5681112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Troscianko, T., N. Mourkoussis, F. Rivera, K. Mania, T. Dixon, and R. Hawkes. "Memory for objects in virtual environments." Journal of Vision 7, no. 9 (March 23, 2010): 763. http://dx.doi.org/10.1167/7.9.763.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Iftode, Liviu, Jaswinder Pal Singh, and Kai Li. "Understanding application performance on shared virtual memory systems." ACM SIGARCH Computer Architecture News 24, no. 2 (May 1996): 122–33. http://dx.doi.org/10.1145/232974.232987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Duy Le and Haining Wang. "An Effective Memory Optimization for Virtual Machine-Based Systems." IEEE Transactions on Parallel and Distributed Systems 22, no. 10 (October 2011): 1705–13. http://dx.doi.org/10.1109/tpds.2011.37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jantz, Michael R., Carl Strickland, Karthik Kumar, Martin Dimitrov, and Kshitij A. Doshi. "A framework for application guidance in virtual memory systems." ACM SIGPLAN Notices 48, no. 7 (August 22, 2013): 155–66. http://dx.doi.org/10.1145/2517326.2451543.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hartley, S. J. "Compile-time program restructuring in multiprogrammed virtual memory systems." IEEE Transactions on Software Engineering 14, no. 11 (1988): 1640–44. http://dx.doi.org/10.1109/32.9051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Morin, C., and I. Puaut. "A survey of recoverable distributed shared virtual memory systems." IEEE Transactions on Parallel and Distributed Systems 8, no. 9 (1997): 959–69. http://dx.doi.org/10.1109/71.615441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Min, Changwoo, Inhyeok Kim, Taehyoung Kim, and Young Ik Eom. "VMMB: Virtual Machine Memory Balancing for Unmodified Operating Systems." Journal of Grid Computing 10, no. 1 (March 2012): 69–84. http://dx.doi.org/10.1007/s10723-012-9209-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Virtual memory systems"

1

Griffiths, R. B. "Virtual memory systems using magnetic bubble memory." Thesis, Bucks New University, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356215.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ramesh, Bharath. "Samhita: Virtual Shared Memory for Non-Cache-Coherent Systems." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/23687.

Full text

Abstract:

Among the key challenges of computing today are the emergence of many-core architectures and the resulting need to effectively exploit explicit parallelism. Indeed, programmers are striving to exploit parallelism across virtually all platforms and application domains. The shared memory programming model effectively addresses the parallelism needs of mainstream computing (e.g., portable devices, laptops, desktop, servers), giving rise to a growing ecosystem of shared memory parallel techniques, tools, and design practices. However, to meet the extreme demands for processing and memory of critical problem domains, including scientific computation and data intensive computing, computing researchers continue to innovate in the high-end distributed memory architecture space to create cost-effective and scalable solutions. The emerging distributed memory architectures are both highly parallel and increasingly heterogeneous. As a result, they do not present the programmer with a cache-coherent view of shared memory, either across the entire system or even at the level of an individual node. Furthermore, it remains an open research question which programming model is best for the heterogeneous platforms that feature multiple traditional processors along with accelerators or co-processors. Hence, we have two contradicting trends. On the one hand, programming convenience and the presence of shared memory call for a shared memory programming model across the entire heterogeneous system. On the other hand, increasingly parallel and heterogeneous nodes lacking cache-coherent shared memory call for a message passing model. In this dissertation, we present the architecture of Samhita, a distributed shared memory (DSM) system that addresses the challenge of providing shared memory for non-cache-coherent systems. We define regional consistency (RegC), the memory consistency model implemented by Samhita. We present performance results for Samhita on several computational kernels and benchmarks, on both cluster supercomputers and heterogeneous systems. The results demonstrate the promising potential of Samhita and the RegC model, and include the largest scale evaluation by a significant margin for any DSM system reported to date.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

3

Martinez, Peck Mariano. "Application-Level Virtual Memory for Object-Oriented Systems." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2012. http://tel.archives-ouvertes.fr/tel-00764991.

Full text

Abstract:

Lors de l'exécution des applications à base d'objets, plusieurs millions d'objets peuvent être créés, utilisés et enfin détruits s'ils ne sont plus référencés. Néanmoins, des dysfonc- tionnements peuvent apparaître, quand des objets qui ne sont plus utilisés ne peuvent être détruits car ils sont référencés. De tels objets gaspillent la mémoire principale et les ap- plications utilisent donc davantage de mémoire que ce qui est effectivement requis. Nous affirmons que l'utilisation du gestionnaire de mémoire virtuel du système d'exploitation ne convient pas toujours, car ce dernier est totalement isolé des applications. Le système d'exploitation ne peut pas prendre en compte ni le domaine ni la structure des applications. De plus, les applications n'ont aucun moyen de contrôler ou influencer la gestion de la mémoire virtuelle. Dans cette thèse, nous présentons Marea, un gestionnaire de mémoire virtuelle piloté par les applications à base d'objets. Il constitue une solution originale qui permet aux développeurs de gérer la mémoire virtuelle au niveau applicatif. Les développeurs d'une application peuvent ordonner à notre système de libérer la mémoire principale en trans- férant les objets inutilisés, mais encore référencés vers une mémoire secondaire (telle qu'un disque dur). En plus de la description du modèle et des algorithmes sous-jacents à Marea, nous présentons notre implémentation dans le langage Pharo. Notre approche a été validée à la fois qualitativement et quantitativement. Ainsi, nous avons réalisés des expérimentations et des mesures sur des applications grandeur-nature pour montrer que Marea peut réduire l'empreinte mémoire de 25% et jusqu'à 40%.

APA, Harvard, Vancouver, ISO, and other styles

4

Milouchev, Alexandre (Alexandre M. ). "Estimating memory locality for virtual machines on NUMA systems." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/85448.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 59-61).
The multicore revolution sparked another, similar movement towards scalable memory architectures. With most machines nowadays exhibiting non-uniform memory access (NUMA) properties, software and operating systems have seen the necessity to optimize their memory management to take full advantage of such architectures. Type 1 (native) hypervisors, in particular, are required to extract maximum performance from the underlying hardware, as they often run dozens of virtual machines (VMs) on a single system and provide clients with performance guarantees that must be met. While VM memory demand is often satisfied by CPU caches, memory-intensive workloads may induce a higher rate of last-level cache misses, requiring more accesses to RAM. On today's typical NUMA systems, accessing local RAM is approximately 50% faster than remote RAM. We discovered that current-generation processors from major manufacturers do not provide inexpensive ways to characterize the memory locality achieved by VMs and their constituents. Instead, we present in this thesis a series of techniques based on statistical sampling of memory that produce powerful estimates for NUMA locality and related metrics. Our estimates offer tremendous insight on inefficient placement of VMs and memory, and can be a solid basis for algorithms aiming at dynamic reorganization for improvements in locality, as well as NUMA-aware CPU scheduling algorithms.
by Alexandre Milouchev.
M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

5

Huffman, Michael John. "JDiet: Footprint Reduction for Memory-constrained Systems." DigitalCommons@CalPoly, 2009. https://digitalcommons.calpoly.edu/theses/108.

Full text

Abstract:

Main memory remains a scarce computing resource. Even though main memory is becoming more abundant, software applications are inexorably engineered to consume as much memory as is available. For example, expert systems, scientific computing, data mining, and embedded systems commonly suffer from the lack of main memory availability. This thesis introduces JDiet, an innovative memory management system for Java applications. The goal of JDiet is to provide the developer with a highly configurable framework to reduce the memory footprint of a memory-constrained system, enabling it to operate on much larger working sets. Inspired by buffer management techniques common in modern database management systems, JDiet frees main memory by evicting non-essential data to a disk-based store. A buffer retains a fixed amount of managed objects in main memory. As non-resident objects are accessed, they are swapped from the store to the buffer using an extensible replacement policy. While the Java virtual machine naïvely delegates virtual memory management to the operating system, JDiet empowers the system designer to select both the managed data and replacement policy. Guided by compile-time configuration, JDiet performs aspect-oriented bytecode engineering, requiring no explicit coupling to the source or compiled code. The results of an experimental evaluation of the effectiveness of JDiet are reported. A JDiet-enabled XML DOM parser is capable of parsing and processing over 200% larger input documents by sacrificing less than an order of magnitude in performance.

APA, Harvard, Vancouver, ISO, and other styles

6

Musunuru, Venkata Krishna Kanth. "Virtuo-ITS: An Interactive Tutoring System to Teach Virtual Memory Concepts of an Operating System." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1495481049986755.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mohindra, Ajay. "Issues in the design of distributed shared memory systems." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/9123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

RAMAN, VENKATESH. "A STUDY OF CLUSTER PAGING METHODS TO BOOST VIRTUAL MEMORY PERFORMANCE." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1014062558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Petit, Martí Salvador Vicente. "Efficient Home-Based protocols for reducing asynchronous communication in shared virtual memory systems." Doctoral thesis, Universitat Politècnica de València, 2008. http://hdl.handle.net/10251/2908.

Full text

Abstract:

En la presente tesis se realiza una evaluación exhaustiva de ls Sistemas de Memoria Distribuida conocidos como Sistemas de Memoria Virtual Compartida. Este tipo de sistemas posee características que los hacen especialmente atractivos, como son su relativo bajo costo, alta portabilidad y paradigma de progración de memoria compartida. La evaluación consta de dos partes. En la primera se detallan las bases de diseño y el estado del arte de la investigación sobre este tipo de sistemas. En la segunda, se estudia el comportamiento de un conjunto representativo de cargas paralelas respecto a tres ejes de caracterización estrechamente relacionados con las prestaciones en estos sistemas. Mientras que la primera parte apunta la hipótesis de que la comunicación asíncrona es una de las principales causas de pérdida de prestaciones en los Sistemas de Memoria Virtual Compartida, la segunda no sólo la confirma, sino que ofrece un detallado análisis de las cargas del que se obteiene información sobre la potencial comunicación asíncrona atendiendo a diferentes parámetros del sistema. El resultado de la evaluación se utiliza para proponer dos nuevos protocolos para el funcionamiento de estos sistemas que utiliza un mínimo de recursos de hardware, alcanzando prestaciones similares e incluso superiores en algunos casos a sistemas que utilizan circuitos hardware de propósito específico para reducir la comunicación asíncrona. En particular, uno de los protocolos propuestos es comparado con una reconocida técnica hardware para reducir la comunicación asíncrona, obteniendo resultados satisfactorios y complementarios a la técnica comparada. Todos los modelos y técnicas usados en este trabajo han sido implementados y evalados utilizando un nuevo entorno de simulación desarollado en el contexto de este trabajo.
Petit Martí, SV. (2003). Efficient Home-Based protocols for reducing asynchronous communication in shared virtual memory systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/2908
Palancia

APA, Harvard, Vancouver, ISO, and other styles

10

Costa, Prats Juan José. "Efficient openMP over sequentially consistent distributed shared memory systems." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/81012.

Full text

Abstract:

Nowadays clusters are one of the most used platforms in High Performance Computing and most programmers use the Message Passing Interface (MPI) library to program their applications in these distributed platforms getting their maximum performance, although it is a complex task. On the other side, OpenMP has been established as the de facto standard to program applications on shared memory platforms because it is easy to use and obtains good performance without too much effort. So, could it be possible to join both worlds? Could programmers use the easiness of OpenMP in distributed platforms? A lot of researchers think so. And one of the developed ideas is the distributed shared memory (DSM), a software layer on top of a distributed platform giving an abstract shared memory view to the applications. Even though it seems a good solution it also has some inconveniences. The memory coherence between the nodes in the platform is difficult to maintain (complex management, scalability issues, high overhead and others) and the latency of the remote-memory accesses which can be orders of magnitude greater than on a shared bus due to the interconnection network. Therefore this research improves the performance of OpenMP applications being executed on distributed memory platforms using a DSM with sequential consistency evaluating thoroughly the results from the NAS parallel benchmarks. The vast majority of designed DSMs use a relaxed consistency model because it avoids some major problems in the area. In contrast, we use a sequential consistency model because we think that showing these potential problems that otherwise are hidden may allow the finding of some solutions and, therefore, apply them to both models. The main idea behind this work is that both runtimes, the OpenMP and the DSM layer, should cooperate to achieve good performance, otherwise they interfere one each other trashing the final performance of applications. We develop three different contributions to improve the performance of these applications: (a) a technique to avoid false sharing at runtime, (b) a technique to mimic the MPI behaviour, where produced data is forwarded to their consumers and, finally, (c) a mechanism to avoid the network congestion due to the DSM coherence messages. The NAS Parallel Benchmarks are used to test the contributions. The results of this work shows that the false-sharing problem is a relative problem depending on each application. Another result is the importance to move the data flow outside of the critical path and to use techniques that forwards data as early as possible, similar to MPI, benefits the final application performance. Additionally, this data movement is usually concentrated at single points and affects the application performance due to the limited bandwidth of the network. Therefore it is necessary to provide mechanisms that allows the distribution of this data through the computation time using an otherwise idle network. Finally, results shows that the proposed contributions improve the performance of OpenMP applications on this kind of environments.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Virtual memory systems"

1

Eddings, Joshua. How virtual reality works. Emeryville, Calif: Ziff-Davis Press, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Russo, Vincent. A class hierarchical, object-oriented approach to virtual memory management. [Washington, DC: National Aeronautics and Space Administration, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yiming, Zhang, ed. Ji yu xu ni ji suan huan jing de nei cun gong xiang ji shu. [Changsha]: Guo fang ke ji da xue chu ban she, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dave, Schnee, Mullin Peter, and International Business Machines Corporation. International Technical Support Organization., eds. Automatic partition resource manager for System i and iSeries. [Poughkeepsie, NY]: IBM, International Technical Suppport Organization, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Francis, Tony. Mac OS 8 revealed. Reading, Mass: Addison-Wesley, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rubin, Charles. The Macintosh bible guide to system 7.1. Berkeley, CA: Peachpit Press, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Video Game Bible, 1985-2002. Victoria, Canada: Trafford Publishing, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Interfacing laboratory instruments to multiuser, virtual memory computers. [Washington, D.C.]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Division, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gorman, Mel. Understanding the Linux Virtual Memory Manager (Bruce Perens' Open Source Series). Prentice Hall PTR, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Understanding the Linux Virtual Memory Manager (Bruce Perens' Open Source Series). Prentice Hall PTR, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Virtual memory systems"

1

Abrossimov, Vadim, Marc Rozier, and Michel Gien. "Virtual memory management in Chorus." In Progress in Distributed Operating Systems and Distributed Systems Management, 45–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52609-9_76.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Keedy, J. Leslie, and Peter Brössler. "Implementing Databases in the MONADS Virtual Memory." In Persistent Object Systems, 318–38. London: Springer London, 1993. http://dx.doi.org/10.1007/978-1-4471-3209-7_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gerndt, M., and A. Krumme. "Program optimization for shared virtual memory systems." In High-Performance Computing and Networking, 1001–2. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61142-8_681.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Muraoka, Yuji, and Kenichi Kourai. "Efficient Migration of Large-Memory VMs Using Private Virtual Memory." In Advances in Intelligent Networking and Collaborative Systems, 380–89. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29035-1_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Baiardi, Fabrizio, Gianmarco Dobloni, Paolo Mori, and Laura Ricci. "Hive: Implementing a Virtual Distributed Shared Memory in Java." In Distributed and Parallel Systems, 169–72. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4489-0_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Čiegis, Raimondas, Ramunas Šablinskas, and Jerzy Waśniewski. "Numerical integration on distributed-memory parallel systems." In Recent Advances in Parallel Virtual Machine and Message Passing Interface, 329–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63697-8_101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Hom, Jerry, and Ulrich Kremer. "Energy Management of Virtual Memory on Diskless Devices." In Compilers and Operating Systems for Low Power, 95–113. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4419-9292-5_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gebis, Joseph, Leonid Oliker, John Shalf, Samuel Williams, and Katherine Yelick. "Improving Memory Subsystem Performance Using ViVA: Virtual Vector Architecture." In Architecture of Computing Systems – ARCS 2009, 146–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00454-4_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hahad, Mounir, Thierry Priol, and Jocelyne Erhel. "Compiling Assembly Pattern on a Shared Virtual Memory." In Languages, Compilers and Run-Time Systems for Scalable Computers, 299–302. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4615-2315-4_26.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Véron, André, Jiyang Xu, S. A. Delgado-Rannauro, and K. Schuerman. "Virtual memory support for OR-parallel logic programming systems." In PARLE '91 Parallel Architectures and Languages Europe, 421–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54152-7_78.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Virtual memory systems"

1

Li, Kai, and Paul Hudak. "Memory coherence in shared virtual memory systems." In the fifth annual ACM symposium. New York, New York, USA: ACM Press, 1986. http://dx.doi.org/10.1145/10590.10610.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Granston, Elana D., and Harry A. G. Wijshoff. "Managing pages in shared virtual memory systems." In the 7th international conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/165939.165944.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Weinstein, D. "Virtual memory on systems without hardware support." In the first annual workshop. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/73312.73335.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Weisberg, Pinchas, and Yair Wiseman. "Virtual Memory Systems Should use Larger Pages." In Information Technology and Computer Science 2015. Science & Engineering Research Support soCiety, 2015. http://dx.doi.org/10.14257/astl.2015.106.01.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Jiayin, and Kartik Mohanram. "Virtual Two-Port Memory Architecture for Asymmetric Memory Technologies." In 2017 30th International Conference on VLSI Design and 2017 16th International Conference on Embedded Systems (VLSID). IEEE, 2017. http://dx.doi.org/10.1109/vlsid.2017.13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lankes, Stefan, Pablo Reble, Oliver Sinnen, and Carsten Clauss. "Revisiting shared virtual memory systems for non-coherent memory-coupled cores." In the 2012 International Workshop. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2141702.2141708.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kommareddy, Vamsee Reddy, Clayton Hughes, Simon David Hammond, and Amro Awad. "DeACT: Architecture-Aware Virtual Memory Support for Fabric Attached Memory Systems." In 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 2021. http://dx.doi.org/10.1109/hpca51647.2021.00046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Iftode, Liviu, Jaswinder Pal Singh, and Kai Li. "Understanding application performance on shared virtual memory systems." In the 23rd annual international symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/232973.232987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhu, He, and Ian Watson. "Compiler support for decoupled virtual shared memory systems." In the sixteenth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/259380.259484.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Suetake, Masato, Hazuki Kizu, and Kenichi Kourai. "Split Migration of Large Memory Virtual Machines." In APSys '16: 7th ACM SIGOPS Asia-Pacific Workshop on Systems. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2967360.2967368.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Virtual memory systems"

1

Anderson, David P., Shin-Yuan Tzou, and G. S. Graham. The DASH Virtual Memory System. Fort Belvoir, VA: Defense Technical Information Center, November 1988. http://dx.doi.org/10.21236/ada620735.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nelson, Michael N. Virtual Memory for the Sprite Operating System. Fort Belvoir, VA: Defense Technical Information Center, June 1986. http://dx.doi.org/10.21236/ada619315.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!