Browse Prior Art Database

Implementation of Distributed Process Synchronization Via Coordinated Finite State Automata

IP.com Disclosure Number: IPCOM000100255D
Original Publication Date: 1990-Mar-01
Included in the Prior Art Database: 2005-Mar-15
Document File: 2 page(s) / 62K

Publishing Venue

IBM

Related People

Peterson, RJ: AUTHOR

Abstract

This invention produces a collection of algorithms which implement producer/consumer process synchronization within a distributed system of interconnected relational database instances, such that the extent to which the producer and consumer may execute in parallel is maximized.

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

Implementation of Distributed Process Synchronization Via Coordinated Finite State Automata

       This invention produces a collection of algorithms which
implement producer/consumer process synchronization within a
distributed system of interconnected relational database instances,
such that the extent to which the producer and consumer may execute
in parallel is maximized.

      An application executing at relational database instance X may
issue SQL CURSOR operations (OPEN, FETCH, CLOSE) against remote data,
e.g., data which is stored at relational database instance Y.  When
the data is remote, the manifestation of the stored data (represented
by the CURSOR) will be managed by a producer process at relational
database instance Y.  The process of extracting and sending this data
to relational database instance X must be synchronized with the
application FETCH patterns at X, which is managed by a consumer
process.

      The data consumer process may be modeled by a Finite State
Automaton "Fc".  An instance of Fc is activated as a result of an
application executing within a relational database environment on
processor i requesting data defined by SQL CURSOR operations whose
underlying data are stored at some remote relational database
instance on processor j. Similarly, the data producer process also
may be modeled by a Finite State Automaton "Fp", which is activated
upon the arrival of a continue-to-produce message sent by the
consumer process, Fc.

   ...