Junction manager program object interconnection and method

Details Junction manager program object interconnection and method Junction manager program object interconnection and method

1995-10-17

2003-07-01

Courtenay, III, St. John (Department: 2126)

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

Least weight routing

C709S241000

Reexamination Certificate

active

06587889

ABSTRACT:

This invention describes a “junction manager” and process that improve upon the junction object interconnect technology described in Program Object Interconnection and Method, my co-pending, commonly assigned patent application, Ser. No. 08/417,582, filed Apr. 6, 1995.
1. Field of the Invention
This invention relates generally to computer programming methods and, in particular, to object oriented programming and to methods of connecting independent program objects for communicating or for sharing data in such programming constructs.
2. Background of the Invention
OMG's CORBA (Common Object Request Broker Architecture) provides for distribution of interobject data and communication based on remote procedure calls (RPCs). In this model, one program object makes a method call against another, possibly remote, program object. The called, possibly remote, object executes the method and returns results to the caller. This model is simple and eases the transition from uniprocessor to multiprocessor programming environments, but it suffers from inherent latency. Unless the calling object uses complicated, asynchronous callbacks, it must wait for the called object to perform the requested task and respond.
U.S. Pat. No. 5,396,630 commonly assigned to the Assignee of the present application, is incorporated herein by reference as an example of the registry and messaging approach described above, specifically for an object request broker type of object programming communication environment.
In my aforementioned patent application, state changes are propagated among object-connecting junctions. When a state change occurs at one object's junction, the new state is sent to each connected object's junction. Junctions for objects are connected in a circularly-link list. Thus, the junctions form a logical ring for sharing data, such as changes of state of one or more objects.
Using my prior patent application, when N object junctions are connected, propagating state changes or data requires that N−1 messages be sent (one to each junction, excluding the junction initiating the propagation), and each junction participates in forwarding the data or message.
OBJECT OF THE INVENTION
It is an object of this invention to provide an improved mechanism and process for eliminating multiple sending and exchanging of synchronization and state messages among interconnectable program objects.
It is a further object of this invention to provide for an improved object request broker function without either the broker entity or the need for the messaging overhead associated with prior art program object request brokers.
BRIEF SUMMARY OF THE INVENTION
The junction manager in the present invention eliminates the need for a separate request broker or manager and eliminates, as well, the need for each junction to propagate each state change. Instead, the state change of each program object (hereinafter simply referred to as “object”) to be interconnected is reported once by the junction manager function process either located in or used by each object desiring to do so, to a shared memory space. “Processes” in each object's junction manager (we use the term process to represent processes, threads or objects themselves) which are thus logically connected or “joined”, and which may depend on one another, then query the shared memory space to obtain information about the state of a junction with another object that is of interest to them. The junction manager function used by the object services each query by accessing and returning from the shared memory space the next chronologically posted state that the requesting process has not previously seen. For example, if the state of the junction has changed from S
0
to S
1
to S
2
, the current state is S
2
; but, if a process P has not queried the junction's state since it was S
0
, then the junction manager function of the requesting process P would return S
1
to process P's request. S
2
would be returned on the P's subsequent query.
Processes can access and read only the state changes for a queried junction that occur after the processes attach to an object's junction by accessing shared memory. In the example above, if a process P
2
attached to a junction after the state changed to S
2
, but before the junction again changed its state, then P
2
's first query via its junction manager process would return S
2
; P
2
would never see S
0
or S
1
.
Processes, such as objects, can perform a number of operations when executing sub-processes to act as junction managers as listed briefly below:
Create a new junction with an initial state and no attached processes.
Attach to (i.e., access in shared memory) another object's junction data. Once a process has attached to a junction's data, it is eligible to query or alter the junction's data state; however, unattached process can neither query nor alter
a junction's state data.
Set the junction state data.
Query the junction's state data.
Unlink a junction from an object. After unlinking, a process can neither query nor alter a junction's state data.
Destroy a junction entirely.


REFERENCES:
patent: 4912629 (1990-03-01), Shuler
patent: 5041970 (1991-08-01), Desjourdy
patent: 5339418 (1994-08-01), East et al.
patent: 5434975 (1995-07-01), Allen
patent: 5437031 (1995-07-01), Kitami
patent: 5446901 (1995-08-01), Owicki et al.
patent: 5598562 (1997-01-01), Cutler et al.
patent: 5764985 (1998-06-01), Smale
patent: 0108338 (1983-10-01), None
patent: 0514112 (1992-05-01), None
patent: 05114112 (1992-05-01), None
A.S. Tanenbaum ‘Operating Systems: Design & Implementation’, Prentice-Hall International, Inc., Englewood Cliffs, NJ, US, XP0002023005, p. 60, paragraph 2-p. 75, paragraph 3.
SAC—The Thirteenth Annual International Computer Software and Applications Conference, Sep. 20, 1989, Orlando, Fl, US—pp. 130-135, XP000091496 Peiyi Tang et al ‘A Parallel Linked List for Shared-Memory Multiprocessors’ * the whole document*.
Software Practice & Experience, vol. 17, No. 1, Jan. 1987, Chichester, Sussex, GB. pp. 1-4, XP000004698, H.W.Glaser et al ‘Lazy Garbage Collection’, *p. 2, paragraph 3-paragraph 5*.

Affiliated with

Also associated with

Rating

Junction manager program object interconnection and method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Junction manager program object interconnection and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Junction manager program object interconnection and method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3056234