Browse Prior Art Database

Management of Asynchronous Processes

IP.com Disclosure Number: IPCOM000106200D
Original Publication Date: 1993-Oct-01
Included in the Prior Art Database: 2005-Mar-20
Document File: 4 page(s) / 91K

Publishing Venue

IBM

Related People

Hausmann, F: AUTHOR

Abstract

An asynchronous process, or a group of such processes, can be serialized by subdividing the whole process into a series of sub-processes. Each of the sub-processes is assigned a unique priority to indicate the order in which it is to be carried out. As shown in Fig. 1, a bit string is constructed in which each bit represents one of the sub-processes. The most significant bit in the bit string represents the sub-process with the highest priority, i.e., the sub-process that should be completed before all other sub-processes, and the least significant bit represents the sub-process with the lowest priority.

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

Management of Asynchronous Processes

      An asynchronous process, or a group of such processes, can be
serialized by subdividing the whole process into a series of
sub-processes.  Each of the sub-processes is assigned a unique
priority to indicate the order in which it is to be carried out.  As
shown in Fig. 1, a bit string is constructed in which each bit
represents one of the sub-processes.  The most significant bit in the
bit string represents the sub-process with the highest priority,
i.e., the sub-process that should be completed before all other
sub-processes, and the least significant bit represents the
sub-process with the lowest priority.

      Two copies of the bit string are present in the system.  One
copy, the selection bit string, has bits which are directly set by
the system to indicate which sub-processes need to be carried out.
The other copy, the workcopy bit string, is used to indicate which
sub-processes have been selected but not yet carried out.

      Fig. 2 shows a flow diagram in which the method of selecting
sub-processes to be carried out is illustrated.  When no
sub-processes are being carried out, the system is in a general wait
state shown in step 10.  In this state, both the selection and the
workcopy bit strings are clear, i.e. all entries are set to 0.  When
a sub-process is re quested (step 110), a bit in the selection bit
string is set (step 120).  Should the asynchronous process containing
the sub-process not already be running, i.e. the system is in the
general wait state (step 10), then the process is...