Browse Prior Art Database

Delayed Reuse of Resource Handles

IP.com Disclosure Number: IPCOM000115387D
Original Publication Date: 1995-Apr-01
Included in the Prior Art Database: 2005-Mar-30
Document File: 2 page(s) / 57K

Publishing Venue

IBM

Related People

Jennery, A: AUTHOR [+3]

Abstract

Disclosed is a technique delaying the reuse of resource handles, or other unique identifiers, in a computer operating system until a minimum of n resource handles have been used and subsequently removed from use to become invalid. This technique is needed because a computer program may otherwise continue to use a resource handle even after it has become invalid or after it has been redefined to represent a different logical or physical resource.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 74% of the total text.

Delayed Reuse of Resource Handles

      Disclosed is a technique delaying the reuse of resource
handles, or other unique identifiers, in a computer operating system
until a minimum of n resource handles have been used and subsequently
removed from use to become invalid.  This technique is needed because
a computer program may otherwise continue to use a resource handle
even after it has become invalid or after it has been redefined to
represent a different logical or physical resource.

      With this technique, a set of resource handles is managed as a
list, referred to as the "free list."  When a resource handle is put
into use by the operating system, it is removed from the free list.
If a resource handle is subsequently removed from use, being no
longer needed to represent a particular resource, it is placed in
another list, referred to as the "delay list."  While a resource
handle is in the delay list, it is not reused.  When the length of
the delay list reaches (n + x), where n is the minimum number of
resource handles which must be kept out of use to avoid repetition,
and x is the number of resource handles to be simultaneously moved to
the free list, the oldest x resource handles are put back into the
free list.

      Fig. 1 is a schematic diagram showing the free list 1, in which
available handles are stored in an arbitrary order.

      Fig. 2 shows the removal from the free list 1 of a handle 2
selected by the operating system for allocation...