Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Control Block Fading Algorithm

IP.com Disclosure Number: IPCOM000038078D
Original Publication Date: 1989-Oct-01
Included in the Prior Art Database: 2005-Jan-31
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Related People

Goldberg, SH: AUTHOR

Abstract

This invention relates to a method for managing concurrent access to a chain of control blocks (CBs) in a layered communications subsystem. Each layer is manifest by at least one CB. The subsystem is responsive to a data-passing request from a source to a sink by allocating and processing a thread. A "thread" is a construct which includes a sequence of layer-processing primitives associated with the data-passing request. The thread is processed by counterpart layers to establish a physical and logical path connection between source and sink and to pass data therethrough. The subsystem executes several threads concurrently.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

Control Block Fading Algorithm

This invention relates to a method for managing concurrent access to a chain of control blocks (CBs) in a layered communications subsystem. Each layer is manifest by at least one CB. The subsystem is responsive to a data-passing request from a source to a sink by allocating and processing a thread. A "thread" is a construct which includes a sequence of layer-processing primitives associated with the data-passing request. The thread is processed by counterpart layers to establish a physical and logical path connection between source and sink and to pass data therethrough. The subsystem executes several threads concurrently.

The method steps include (a) responsive to a thread requesting deletion of a predetermined CB, marking said preselected CB "to be deleted" and removing said marked CB from the chain; (b) responsive to each executing thread, associating a reference from said thread to the "to be deleted" CB and incrementing and storing a count of said references; and (c) responsive to the termination of the most current layer invocation of the thread, decrementing the count, and completely removing the "to be deleted" CB upon the count reaching a predetermined amount, whereby access to the deleted CB is guaranteed only for those threads having reference to the preselected CB prior to completion of a delete request.

Disclosed anonymously.

1