• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 5,023
Next 10 →

The Multics Virtual Memory: Concepts and Design

by A. Bensoussan, C.T. Clingen, R. C. Daley - Communications of the ACM , 1972
"... As experience with use of on-line operating systems has grown, the need to share information among system users has become increasingly apparent. Many contemporary systems permit some degree of sharing. Usually, sharing is accomplished by allowing several users to share data via input and output of ..."
Abstract - Cited by 50 (0 self) - Add to MetaCart
and carries its own independent attributes of size and access privilege. 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

Memory Coherence in Shared Virtual Memory Systems

by Kai Li, Paul Hudak , 1989
"... This paper studies the memory coherence problem in designing said inaplementing a shared virtual memory on looselycoupled multiprocessors. Two classes of aIgoritb. ms for solving the problem are presented. A prototype shared virtual memory on an Apollo ring has been implemented based on these a ..."
Abstract - Cited by 957 (17 self) - Add to MetaCart
This paper studies the memory coherence problem in designing said inaplementing a shared virtual memory on looselycoupled multiprocessors. Two classes of aIgoritb. ms for solving the problem are presented. A prototype shared virtual memory on an Apollo ring has been implemented based

Virtual time

by David R. Jefferson - ACM Transactions on Programming Languages and Systems , 1985
"... Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concur-rency control. Virtual time provides a flexible abstraction of real time in much the same way that virtua ..."
Abstract - Cited by 980 (7 self) - Add to MetaCart
that virtual memory provides an abstraction of real memory. It is implemented using the Time Warp mechanism, a synchronization protocol distinguished by its reliance on lookahead-rollback, and by its implementation of rollback via antimessages.

Exokernel: An Operating System Architecture for Application-Level Resource Management

by Dawson R. Engler, M. Frans Kaashoek, James O’toole , 1995
"... We describe an operating system architecture that securely multiplexes machine resources while permitting an unprecedented degree of application-specific customization of traditional operating system abstractions. By abstracting physical hardware resources, traditional operating systems have signifi ..."
Abstract - Cited by 732 (24 self) - Add to MetaCart
Aegis operations are 10–100 times faster than Ultrix,a mature monolithic UNIX operating system. ExOS implements processes, virtual memory, and inter-process communication abstractions entirely within a library. Measurements show that ExOS’s application-level virtual memory and IPC primitives are 5

Memory resource management in VMware ESX server,”

by Carl A Waldspurger - In Proc. of the 5th OSDI, , 2002
"... Abstract 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 ..."
Abstract - Cited by 449 (2 self) - Add to MetaCart
Abstract 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

Virtualizing Transactional Memory

by Ravi Rajwar, et al. , 2005
"... Writing concurrent programs is difficult because of the complexity of ensuring proper synchronization. Conventional lock-based synchronization suffers from wellknown limitations, so researchers have considered nonblocking transactions as an alternative. Recent hardware proposals have demonstrated ho ..."
Abstract - Cited by 337 (3 self) - Add to MetaCart
, and process migrations. If the transactional model is to gain wide acceptance, hardware support for transactions must be virtualized to hide these limitations in much the same way that virtual memory shields the programmer from platform-specific limitations of physical memory. This paper proposes Virtual

Virtual Memory, Processes, and Sharing in MULTICS

by Oliver, G. A. System, Jodeit, Robert C. Daley, Jack B. Dennis
"... multifunctional scratchpad memories in the Burroughs ..."
Abstract - Add to MetaCart
multifunctional scratchpad memories in the Burroughs

Fixing the Java memory model

by Jeremy Manson, William Pugh, Sarita V. Adve, Jeremy Manson - In ACM Java Grande Conference , 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract - Cited by 385 (10 self) - Add to MetaCart
This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines

Virtual Knot Theory

by Louis H. Kauffman - European J. Comb , 1999
"... This paper is an introduction to the theory of virtual knots. It is dedicated to the memory of Francois Jaeger. 1 ..."
Abstract - Cited by 341 (39 self) - Add to MetaCart
This paper is an introduction to the theory of virtual knots. It is dedicated to the memory of Francois Jaeger. 1

The DaCapo Benchmarks: Java Benchmarking Development and Analysis

by Stephen M Blackburn, Robin Garner , Chris Hoffmann , Asjad M Khan , Kathryn S Mckinley , Rotem Bentzur , Amer Diwan , Daniel Feinberg , Daniel Frampton , Samuel Z Guyer , Martin Hirzel , Antony Hosking , Maria Jump , Han Lee , J Eliot B Moss, Aashish Phansalkar , Darko Stefanović , Thomas Vandrunen , Daniel Von Dincklage , Ben Wiedermann
"... Since benchmarks drive computer science research and industry product development, which ones we use and how we evaluate them are key questions for the community. Despite complex runtime tradeoffs due to dynamic compilation and garbage collection required for Java programs, many evaluations still us ..."
Abstract - Cited by 397 (65 self) - Add to MetaCart
Capo benchmarks, a set of open source, client-side Java benchmarks. We demonstrate that the complex interactions of (1) architecture, (2) compiler, (3) virtual machine, (4) memory management, and (5) application require more extensive evaluation than C, C++, and Fortran which stress (4) much less, and do
Next 10 →
Results 1 - 10 of 5,023
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University