Virtual memory on a narrow machine for an object-oriented language

Kaehler, Ted

doi:10.1145/28697.28707

Cited by 30 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, the empty zero page filled completely with zero bytes is typically shared with a large reference count. A similar overflow technique for large reference counts was used to save space in the early OOZE virtual memory system [15].…”

Section: Methodsmentioning

confidence: 99%

Memory resource management in VMware ESX server

Waldspurger

2002

Proceedings of the 5th Symposium on Operating Systems Design and Implementation - OSDI '02

456

390

View full text Add to dashboard Cite

VMware ESX Server is a thin software layer designed to multiplex hardware resources efficiently among virtual machines running unmodified commodity operating systems. This paper introduces several novel ESX Server mechanisms and policies for managing memory. A ballooning technique reclaims the pages considered least valuable by the operating system running in a virtual machine. An idle memory tax achieves efficient memory utilization while maintaining performance isolation guarantees. Content-based page sharing and hot I/O page remapping exploit transparent page remapping to eliminate redundancy and reduce copying overheads. These techniques are combined to efficiently support virtual machine workloads that overcommit memory.

show abstract

Section: Methodsmentioning

confidence: 99%

Memory resource management in VMware ESX server

Waldspurger

2002

Proceedings of the 5th Symposium on Operating Systems Design and Implementation - OSDI '02

456

390

View full text Add to dashboard Cite

show abstract

“…When having a graph of objects in primary memory which probably will be not used, that graph is swapped out to secondary memory and loaded back when needed to use less memory. This was the idea behind LOOM [Kae86] (Large Object-Oriented Memory), which implemented a swapping mechanism between primary and secondary memory for Smalltalk-80.…”

Section: Swapping Objectsmentioning

confidence: 99%

“…In the eighties, LOOM [Kae86] (Large ObjectOriented Memory) implemented a kind of virtual memory for Smalltalk-80. It defined a swapping mechanism between primary and secondary memory.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Object swapping challenges: An evaluation of imageSegment

Peck

Bouraqadi

Ducasse

et al. 2012

Computer Languages, Systems & Structures

View full text Add to dashboard Cite

In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph exporting and swapping are two important object graph operations. Exporting refers to copying the graph to some other memory so that it can be loaded by another system. Swapping refers to moving the graph to a secondary memory (e.g., a hard disk) to temporary release part of the primary memory (e.g., RAM).Exporting and swapping are achieved in different ways and the speed in presence of large object graphs is critical. Nevertheless, most of the existing solutions do not address well this issue. Another challenge is to deal with common situations where objects outside the exported/swapped graph point to objects inside the graph. To correctly load back an exported subgraph, it is necessary to compute and export extra information that is not explicit in the object subgraph. This extra information is needed because certain objects may require to be reinitialized or recreated, to run specific code before or after the loading, to be updated to a new class definition, etc.In this paper, we present all general problems to our knowledge about object exporting and swapping. As a case of study, we present an analysis of ImageSegment, a fast solution to export and swap object graphs, developed by Dan Ingalls. ImageSegment addresses the speed problems in an efficient way, as shown by the results of several benchmarks we have conducted using Pharo Smalltalk. However, ImageSegment is not a panacea since it still has other problems that hampers its general use.

show abstract

“…But by using prefetching and crystals, clients with more resources can also achieve higher performance than would be possible in a strict object-fetching system. OOZE [4] and LOOM [5,10] already demonstrated the value of object faulting for small memories. Tunable prefetching seems likely to be useful for a wider range of clients than clustering into fixed-size pages could be.…”

Section: Implications For Small Client Machinesmentioning

confidence: 99%

Object groups may be better than pages

Day¹

Proceedings of IEEE 4th Workshop on Workstation Operating Systems. WWOS-III

View full text Add to dashboard Cite

I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or user, and that can be computed at fetch time. I briefly describe crystals, which serve to record such groups statically. Finally, I speculate that object fetching may be particularly relevant for providing services to very small machines with limited memory, such as personal digital assistants. ContextIn a distributed object-oriented database system, server machines store persistent objects shared by applications running on client machines. When an application invokes an operation on a persistent object, that operation must run on either the server or client. I consider the case where objects are moved or copied to the client for at least the duration of the client transaction. A number of existing object-oriented databases work partially or entirely in this mode of executing operations on the client machine: examples are O2 A number of systems transfer pages from server to client. Transferring pages simplifies storage management, since the units transferred are of fixed size, and it allows the use of hardware page-fault mechanisms. However, this approach requires that one have tremendous faith in mechanisms for clustering objects into pages in a reasonable way. Sophisticated Clustering is a Zero-Sum GameAssume for the moment that we have perfect predictive information about access patterns of applications. There is a certain amount of clustering that we can do that benefits all of the applications, but after this point clustering becomes a zero-sum game: making the clustering better for one application makes it worse for another. This effect is not just an intuition, but was apparent in recent work by Tsangaris and Naughton [12]. If it were possible, we would like to cluster as well as we can for each application. In particular, we should be able to accommodate a new application or a dramatically changed access pattern in a relatively straightforward and inexpensive way.

show abstract

Virtual memory on a narrow machine for an object-oriented language

Cited by 30 publications

References 0 publications

Memory resource management in VMware ESX server

Memory resource management in VMware ESX server

Object swapping challenges: An evaluation of imageSegment

Object groups may be better than pages

Contact Info

Product

Resources

About