Method and apparatus for automatically constructing a data flow architecture

• US 5,950,182 A
• Filed: 01/30/1998
• Issued: 09/07/1999
• Est. Priority Date: 05/25/1995
• Status: Expired due to Term

• Current Assignee: Rockwell Automation Technologies Incorporated (Rockwell Automation, Inc.)
• Original Assignee: Pavilion Technologies Incorporated (Rockwell Automation, Inc.)
• Inventors: Harding, Mary Anne, O'Hara, Steven Arthur, Godbole, Devendra Bhalchandra, Ellinger, Joshua Brennan
• Primary Examiner(s): Hafiz, Tariq R.
• Assistant Examiner(s): Rhodes, Jason W.
• Application Number:
  US09/015,984
• Time in Patent Office: 585 Days
• Field of Search: 706/45, 706/46, 706/52, 706/47, 706/900, 706/913, 364/578, 707/503, 707/504
• US Class Current: 706/45
• CPC Class Codes: G06F 8/00 Arrangements for software engineering testing or debugging G06F11/36; administrative, planning or organisation aspects of software project management G06Q10/06
• CPC Class Codes: G06F 9/4494 data driven
• CPC Class Codes: G06T 1/20 Processor architectures; Processor configuration, e.g. pipelining

Abstract

An automatic data flow architecture builder is disclosed that is operable to take raw data which is stored in a raw data buffer (60) and transform it for storage in a transformed data buffer (78). A plurality of transform blocks (68), (70) and (72) are provided for this transform operation, these disposed in a predetermined data flow. When the user inputs a new transform to be disposed within the data flow of the transforms, rules are applied via a rule-base processing system (74) to apply a set of predetermined rules in a rule database (76) to the transform. These rules determine where the transform is to be inserted. This provides an automatic construction operation of a data flow architecture.

Claims

1. A computer-readable medium on which is stored a computer program for controlling a computer to automatically construct a data flow architecture of data transforms, said computer-readable medium comprising:

means for storing raw data in a raw data buffer;

means for forming a sequence of transforms for transforming the data in the raw data buffer, the sequence arranged to define a data flow architecture;

means for storing the output of the sequence of transforms in a transform data buffer;

means for inputting by a user a new transform that will modify the sequence of transforms stored in the transform data buffer;

means for determining where in the sequence of transforms in the transform data buffer the new transform is to be inserted by applying predetermined insertion rules thereto in response to input of the new transform;

means for inserting the new transform in the determined location within the sequence of transforms as a modified sequence of transforms; and

means for controlling the computer with the modified sequence of transforms.

2. The computer-readable medium of claim 1, and further comprising means for determining if the new transform is a valid transform in accordance with the predetermined criteria and, if it is determined that the new transform is an invalid transform, inhibiting said means for determining by applying predetermined insertion rules.

3. The computer-readable medium of claim 1, where said means for storing raw data in a raw data buffer is operable to store the raw data in the form of data in a table that is disposed in columns and rows.

4. The computer-readable medium of claim 3, wherein said means for determining by applying predetermined insertion rules is operable for determining if the transform has an implicit dependency associated therewith upon transform operations that were input prior to input of the new transform, and said means for inserting is operable such that such transform is inserted after prior transforms on which there is an implicit dependency.

5. The computer-readable medium of claim 3, wherein said means for determining by applying predetermined insertion rules utilizes an insertion rule that determines if the transform is one that modifies a single column of data which results in operation of said means for inserting performing an insertion of the transform after the last transform which modifies any of its inputs.

6. The computer-readable medium of claim 3, wherein said means for determining by applying predetermined insertion rules is operable to utilize an insertion rule that determines if the transform is operable to modify one of the columns of data and, if so, said means for inserting is operable for inserting the new transform after the last transform that modifies any of the columns.

7. The computer-readable medium of claim 3, wherein said means for determining by applying predetermined insertion rules is operable for determining if the transform creates or modifies computed variables and, if so, said means for inserting is operable for inserting the transform at the end of the transform sequence.

8. The computer-readable medium of claim 3, wherein said means for determining by applying predetermined insertion rules is operable for determining if the transform is sequential in nature, and said means for inserting is operable such that such transform is inserted after prior transforms upon which the sequential nature depends.

9. The computer-readable medium of claim 1, wherein said means for inserting operates to insert transforms in a run time mode.