Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home ยป Dynamic Vnodes - Design and Implementation
Tweet

connect with us

Dynamic Vnodes - Design and Implementation

Authors: 

Aju John, Digital Equipment Corporation

Abstract: 

Dynamic vnodes make the UNIX kernel responsive to a varying demand for vnodes, without a need to rebuild the kernel. It also optimizes the usage of memory by deallocating excess vnodes. This paper describes the design and implementation of dynamic vnodes in DEC OSF/1 V3.0. The focus is on the vnode deallocation logic in a Symmetric Multi-Processing environment. Deallocation of vnodes differs from the familiar concept of dynamically allocated data structures in the following ways: the legacy name-cache design implicitly assumes that vnodes are never deallocated, and the vnode free-list needs to cache unused vnodes effectively.

Aju John, Digital Equipment Corporation

BibTeX
@inproceedings {260452,
author = {Aju John},
title = {Dynamic Vnodes - Design and Implementation},
booktitle = {USENIX 1995 Technical Conference (USENIX 1995 Technical Conference)},
year = {1995},
address = {New Orleans, LA},
url = {https://www.usenix.org/conference/usenix-1995-technical-conference/dynamic-vnodes-design-and-implementation},
publisher = {USENIX Association},
month = jan
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/neworl/full_papers/john.ps
  • Log in or    Register to post comments

© USENIX

  • Privacy Policy
  • Contact Us