Composition of systems of objects by interlocking coordination, projection, and distribution

• US 5,640,546 A
• Filed: 02/17/1995
• Issued: 06/17/1997
• Est. Priority Date: 02/23/1993
• Status: Expired due to Term

• Current Assignee: Up Two, Inc.
• Original Assignee: Network Programs, Inc.
• Inventors: Gopinath, Bhaskarpillai, Kurshan, David
• Primary Examiner(s): Heckler, Thomas M.
• Application Number:
  US08/390,705
• Time in Patent Office: 851 Days
• Field of Search: 395/550, 395/551, 395/309, 395/683, 395/881
• US Class Current: 713/400
• CPC Class Codes: G06F 30/20 Design optimisation, verification or simulation optimisation, verification or simulation of circuit designs G06F30/30
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores

Abstract

A methodology for developing scalable systems based on a technique for the composition of objects to form a larger, composite object using Interface Cycles, which are canonical programs, hardware, or abstractions which interlock protection, distribution, and coordination of data and control from the objects. The methodology thus allows the interconnected objects to form the new composite object which is subject to the same principles as the underlying objects and which may then used in any stage of the life cycle of a system. An Interface Cycle transitions through discrete phases only by agreement of all object interfaces connected by the Interface Cycle. Protection and data distribution of composite data collected from all the objects are effected under control of the Interface Cycle.

Claims

1. A method for the operation of a computer-based system composed of two distributed objects each having an interface, the objects being programs, hardware, or canonical representations of such programs or hardware, the method comprising the steps of

interconnecting each interface, and

coordinating the connected interfaces in self-synchronized cycles through the interfaces by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization between the objects.

2. The method as recited in claim 1 further including the steps of

distributing persistent data to each interface in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating and distributing to ensure that the steps of coordinating and distributing are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the persistent data in each corresponding one of the cycles.

3. The method as recited in claim 2 further including the step of protecting the persistent data in each of the cycles, and wherein the step of interlocking further includes the step of interlocking, in each of the cycles, the step of protecting with the steps of coordinating and distributing to ensure that the steps of coordinating, distributing, and protecting are completed before the objects agree to advance to the next cycle so as to thereby ensure that the objects access the protected, persistent data in each corresponding one of the cycles.

4. A method for the operation of a computer-based system composed of a plurality of distributed objects each having an interface, the objects being programs, hardware, or canonical representations of such programs or hardware, the method comprising the steps of

interconnecting each interface, and

coordinating the connected interfaces in self-synchronized cycles through the interfaces by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization among the objects.

5. The method as recited in claim 4 further including the steps of

distributing persistent data to each interface in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating and distributing to ensure that the steps of coordinating and distributing are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the persistent data in each corresponding one of the cycles.

6. The method as recited in claim 5 further including the step of protecting the persistent data in each of the cycles, and wherein the step of interlocking further includes the step of interlocking, in each of the cycles, the step of protecting with the steps of coordinating and distributing to ensure that the steps of coordinating, distributing, and protecting are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the protected, persistent data in each corresponding one of the cycles.

7. A method for the operation of a computer-based system composed of two distributed objects each having an interface, the objects being programs, hardware, or canonical representations of such programs or hardware, the method comprising the steps of

interconnecting each interface,

coordinating the connected interfaces in self-synchronized cycles through the interfaces by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization between the objects,

distributing persistent data to each interface in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating and distributing to ensure that the steps of coordination and distributing are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the persistent data in each corresponding one of the cycles.

8. The method as recited in claim 7 further including the step of protecting the persistent data in each of the cycles, and wherein the step of interlocking further includes the step of interlocking, in each of the cycles, the step of protecting with the steps of coordinating and distributing to ensure that the steps of coordinating, distributing, and protecting are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the protected, persistent data in each corresponding one of the cycles.

9. A method for the operation of a computer-based system composed of a plurality of distributed objects each having an interface, the objects being programs, hardware, or canonical representations of such programs or hardware, the method comprising the steps of

interconnecting each interface,

coordinating the connected interfaces in self-synchronized cycles through the interfaces by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization among the objects,

distributing persistent data to each interface in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating and distributing to ensure that the steps of coordinating and distributing are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the persistent data in each corresponding one of the cycles.

10. The method as recited in claim 9 further including the step of protecting the persistent data in each of the cycles, and wherein the step of interlocking further includes the step of interlocking, in each of the cycles, the step of protecting with the steps of coordinating and distributing to ensure that the steps of coordinating, distributing, and protecting are completed before the objects agree to advance to the next cycle so as to thereby ensure that the objects access the protected, persistent data in each corresponding one of the cycles.

11. A method for the operation of a computer-based system composed of two distributed objects each having an interface, the objects being programs, hardware, or canonical representations of such programs or hardware, the method comprising the steps of

interconnecting each interface,

coordinating the connected interfaces in self-synchronized cycles through the interfaces by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization between the objects,

distributing persistent data to each interface in each of the cycles,

protecting the persistent data in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating, distributing, and protecting to ensure that the steps of coordinating, distributing, and protecting are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the protected, persistent data in each corresponding one of the cycles.

12. A method for the operation of a computer-based system composed of a plurality of distributed objects each having an interface, the objects being programs, hardware, or canonical representations of such programs or hardware, the method comprising the steps of

interconnecting each interface,

coordinating the connected interfaces in self-synchronized cycles through the interfaces by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization among the objects,

distributing persistent data to each interface in each of the cycles,

protecting the persistent data in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating, distributing, and protecting to ensure that the steps of coordinating, distributing, and protecting are completed before the objects agree to advance to the next cycle from the present cycle so as to thereby ensure that the objects access the persistent data in each corresponding one of the cycles.

13. A method for the operation of a computer-based system composed of distributed objects each having at least one interface, the objects being programs, hardware, or canonical abstractions of such programs or hardware, the method comprising the steps of

designating one of the objects as an interface cycle manager and connecting a single interface of each of the other objects to a corresponding interface of the interface cycle manager, and

coordinating all interfaces in self-synchronized cycles through the connections under control of the interface cycle manager by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization among the objects.

14. The method as recited in claim 13 further including the steps of

distributing persistent data from the interface cycle manager to each interface of the other objects in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating and distributing to ensure that the objects access the persistent data in corresponding ones of the cycles.

15. The method as recited in claim 14 further including the step of protecting the persistent data in each of the cycles, and wherein the step of interlocking further includes the step of interlocking, in each of the cycles, the step of protecting with the steps of coordinating and distributing to ensure that the objects access the protected, persistent data in corresponding ones of the cycles.

16. The method as recited in claim 15 wherein the interface of each of the other objects is arranged to send object data generated by each of the other objects to the interface cycle manager through the corresponding ones of the connections, the method further comprising the step of accumulating during each of the cycles any object data sent by the other objects in the interface cycle manager to form the persistent data.

17. The method as recited in claim 16 wherein the step of protecting includes the steps of checking for errors in any object data upon input to the interface cycle manager and checking for errors in the persistent data during the step of accumulating.

18. A method for the operation of a computer-based system composed of distributed objects each having at least one interface, the objects being programs, hardware, or canonical abstractions of such programs or hardware, the method comprising the steps of

designating one of the objects as an interface cycle manager and connecting a single interface of each of the other objects to a corresponding interface of the interface cycle manager,

coordinating all interfaces in self-synchronized cycles through each connection of objects by advancing to the next cycle from the present cycle only upon mutual agreement by the objects,

distributing persistent data to the interfaces in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating and distributing to generate self-synchronization among the objects.

19. The method as recited in claim 18 further including the step of protecting the persistent data in each of the cycles, and wherein the step of interlocking further includes the step of interlocking, in each of the cycles, the step of protecting with the steps of coordinating and distributing to ensure that the objects access the protected, persistent data in corresponding ones of the cycles.

20. The method as recited in claim 19 wherein each of the other objects is arranged to send object data generated by each of the other objects to the interface cycle manager through the corresponding one of the connections, the method further comprising the step of accumulating during each of the cycles any object data sent by the other objects in the interface cycle manager as the persistent data.

21. The method as recited in claim 19 wherein the interface of each of the other objects is arranged to send object data generated by each of the other objects to the interface cycle manager through the corresponding ones of the connections, the method further comprising the step of accumulating during each of the cycles any object data sent by the other objects in the interface cycle manager to form the persistent data.

22. The method as recited in claim 21 wherein the step of protecting includes the steps of checking for errors in any object data upon input to the interface cycle manager and checking for errors in the persistent data during the step of accumulating.

23. The method as recited in claim 19 wherein the step of interlocking includes the step of controlling each of the other objects by operations of the interface cycle manager.

24. The method as recited in claim 23 wherein each interface is a data structure, wherein the interface cycle manager is arranged with one manager data structure for each of the other objects, and each of the other objects is arranged with an object data structure for sending any object data generated by said object to the interface cycle manager and for receiving the persistent data, the object data structure being accessible to operations executing within each corresponding object under control of the interface cycle manager, and wherein the step of controlling comprises the steps of

modifying the manager data structure entries by the interface cycle manager, and

distributing the modified entries to each of the other objects.

25. The method as recited in claim 24 wherein each interface is a data structure, wherein the interface cycle manager is arranged with one manager data structure for each of the other objects, and each of the other objects is arranged with an object data structure for sending any object data generated by said object to the interface cycle manager and for receiving the persistent data, the object data structure being accessible to operations executing within each corresponding object under control of the interface cycle manager, and wherein the step of controlling comprises the steps of

storing any data sent by each of the other objects in the manager data structure,

forming the persistent data from data stored in the manager data structure,

changing a phase manager data structure entry by the interface cycle manager to produce a phase change indicative of the start of the next cycle upon the formation of the persistent data,

distributing the phase change to the object data structure of each other object along with the persistent data, and

detecting the phase change by each of the other objects to enable each of the other objects to access the persistent data distributed by the interface cycle manager.

26. A method for the operation of a computer-based system composed of distributed objects each having at least one interface, the objects being programs, hardware, or canonical abstractions of such programs or hardware, the method comprising the steps of

designating one of the objects as an interface cycle manager and connection a single interface of each of the other objects to a corresponding interface of the interface cycle manager,

coordinating the interfaces in self-synchronized cycles through each connection by advancing to the next cycle from the present cycle only upon mutual agreement by the objects to thereby engender the self-synchronization among the it objects,

distributing persistent data to the interfaces in each of the cycles,

protecting the persistent data in each of the cycles, and

interlocking, in each of the cycles, the steps of coordinating, distributing, and protecting to ensure that the objects access the protected, persistent data in corresponding ones of the cycles.

27. The method as recited in claim 26 wherein the interface of each of the other objects is arranged to send object data generated by each of the other objects to the interface cycle manager through the corresponding ones of the connections, the method further comprising the step of accumulating during each of the cycles any object data sent by the other objects in the interface cycle manager to form the persistent data.

28. The method as recited in claim 27 wherein the step of protecting includes the steps of checking for errors in any object data upon input to the interface cycle manager and checking for errors in the persistent data during the step of accumulating.

29. The method as recited in claim 26 wherein the step of interlocking includes the step of controlling each of the other objects with the interface cycle manager.

30. The method as recited in claim 29 wherein each interface is a data structure, wherein the interface cycle manager is arranged with one manager data structure for each of the other objects, and each of the other objects is arranged with an object data structure for sending any object data generated by said object to the interface cycle manager and for receiving the persistent data, the object data structure being accessible to operations executing within each corresponding object under control of the interface cycle manager, and wherein the step of controlling comprises the steps of

modifying the manager data structure entries by the interface cycle manager, and

distributing the modified entries to each of the other objects.

31. The method as recited in claim 29 wherein each interface is a data structure, wherein the interface cycle manager is arranged with one manager data structure for each of the other objects, and each of the other objects is arranged with an object data structure for sending any object data generated by said object to the interface cycle manager and for receiving the persistent data, the object data structure being accessible to operations executing within each corresponding object under control of the interface cycle manager, and wherein the step of controlling comprises the steps of

storing any data sent by each of the other objects in the manager data structure,

forming the persistent data from data stored in the manager data structure,

changing a phase manager data structure entry by the interface cycle manager to produce a phase change indicative of the start of the next cycle upon the formation of the persistent data,

distributing the phase change to the object data structure of each other object along with the persistent data, and

detecting the phase change by each of the other objects to enable each of the other objects to access the persistent data distributed by the interface cycle manager.

32. A method for the operation of a computer-based system composed of distributed objects each having at least one input data structure and at least one output data structure, the objects being programs, hardware, or canonical abstractions of such programs or hardware, the method comprising the steps of

selecting one of the objects as an interface cycle manager and configuring the interface cycle manager with one input data structure and one output data structure for each of the other objects, and respectively connection the input data structure and the output data structure of each of the other objects to the corresponding output data structure and the corresponding input data structure of the interface cycle manager,

coordinating both the input data structures and the output data structures in self-synchronized cycles through each connection between the interface cycle manager and the corresponding ones of the other objects by advancing to the next cycle from the present cycle only upon mutual agreement by the objects,

distributing persistent data from the output data structure of the interface cycle manager to the input data structure of all the other objects in each of the cycles, and interlocking, in each of the cycles, the steps of coordinating and distributing to generate self-synchronization among the objects.

33. The method as recited in claim 32 wherein the output data structure of each of the other objects is arranged to send object data generated by each of the other objects to the interface cycle manager through the corresponding ones of the connections, the method further comprising the step of accumulating during each of the cycles any object data sent by the other objects in the interface cycle manager to form the persistent data.

34. The method as recited in claim 32 further including the step of protecting the persistent data in each of the cycles, and wherein the step of interlocking further includes the step of interlocking, in each of the cycles, the step of protecting with the steps of coordinating and distributing to ensure that the objects access the persistent data in corresponding ones of the cycles.

35. The method as recited in claim 34 wherein the input data structure of each of the other objects receives its input from the corresponding output data structure of the interface cycle manager, and wherein the corresponding input data structure of the interface cycle manager receives its input from the output data structure of the corresponding one of the other objects, and further wherein each input data structure has an input phase entry and each output data structure has an output phase entry such that the input phase entry in each of the other objects is modified by the interface cycle manager and such that the corresponding input phase entry of the interface cycle manager is modified by the corresponding one of the other objects, said step of accumulating being initiated whenever at least one input phase entry does not equal the corresponding output phase entry in the data structures of the interface cycle manager.

36. The method as recited in claim 34 wherein each of the other objects is arranged to send object data generated by each of the other objects to the interface cycle manager through the corresponding ones of the connections, the method further comprising the step of accumulating in each of the cycles any object data sent by the other objects in the interface cycle manager to form the persistent data.

37. The method as recited in claim 36 wherein the step of protecting includes the steps of checking for errors in any object data upon input to the interface cycle manager and checking for errors in the persistent data during the step of accumulating.