US6681220B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Reduction and optimization of information processing systems
Assignee: International Business Machines Corp
•
Filing: 1999-05-28
•
Granted: 2004-01-20
•
Expires: 2019-05-28
Abstract
Abstract Techniques for arranging operations performable on information in an information processing system are provided. In a system having a plurality of information producers and a plurality of information subscribers, paths are identified over which information traverses, and within which the information is subject to select and/or transform operations. The present invention optimizes the system by reorganizing the sequence of select and transform operations so that transforms follow select operations; and by combining multiple select and transform operations into single select and transform operations, respectively. Using these optimizations, the processing resources of the system can be reorganized, and/or information flow graphs describing the system can be designed, so that the select operations are “pushed” toward the producers, and transform operations are “pushed” toward the subscribers. Efficient content-based routing systems can then be used to implement the select operations.
Inventors
- 👤 Marc A. Kaplan
- 👤 Kelly Anne Shaw
- 👤 Daniel C. Sturman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 13:08
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/542; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934; Y10S707/99935
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
61 words
A method for arranging operations performable on message streams in a message processing system by a first operation sequence between two nodes in the system, the first operation sequence having a transform operation followed by a select operation, the method comprising: converting the first operation sequence into a second, equivalent operation sequence comprising a select operation followed by a transform operation.
Claim 2
Independent Claim
61 words
A method for arranging operations performable on message streams in a message processing system by a first operation sequence between two nodes in the system, the first operation sequence having a transform operation followed by a select operation, the method comprising: converting the first operation sequence into a second, equivalent operation sequence comprising a select operation followed by a transform operation.
Claim 3
Dependent Claim
43 words
The method of claim 1 , wherein the first operation sequence comprises a plurality of transform operation and a plurality of select operations and wherein the second, equivalent operation sequence comprises a plurality of select operations followed by a plurality of transform operations.
Claim 4
Dependent Claim
54 words
The method of claim 2 , wherein said converting comprises: combining the plurality of select operations into a single, equivalent select operation; and combining the plurality of transform operations into a single, equivalent transform operation, whereby the second, equivalent operation sequence comprises the single, equivalent select operation followed by the single, equivalent transform operation.
Claim 5
Dependent Claim
21 words
A method for reorganizing message processing operations in a message processing system comprising using the arranging method of claim 1 .
Claim 6
Dependent Claim
16 words
The method of claim 4 , wherein said reorganizing is facilitated by an automated processing system.
Claim 7
Dependent Claim
31 words
A method for arranging an information flow graph descriptive of message processing operation for a method processing system, comprising using the arranging method of claim 1 on said information flow graph.
Claim 8
Dependent Claim
39 words
The method of claim 6 , wherein said method for arranging the information flow graph is performed on an automated processing system, and wherein the information flow graph comprises information tangibly stored on media in said automated processing system.
Claim 9
Dependent Claim
42 words
The method of claim 1 , wherein said converting comprises: reducing a number of calculations required to determine the second, equivalent operation sequence by storing results of any common subexpressions thereof and using said stored results instead of recalculating the common subexpressions.
Claim 10
Independent Claim
80 words
A system for arranging operation performable on message streams in a message processing system, comprising: a first node and a second node, wherein a first operation sequence between the first node and second node comprises a transform operation followed by a select operation, wherein the select operation comprises determining whether input data satisfies one or more criteria; and mean for converting the first operation sequence into a second, equivalent operation sequence comprising a select operation followed by a transform operation.
Claim 11
Independent Claim
80 words
A system for arranging operation performable on message streams in a message processing system, comprising: a first node and a second node, wherein a first operation sequence between the first node and second node comprises a transform operation followed by a select operation, wherein the select operation comprises determining whether input data satisfies one or more criteria; and mean for converting the first operation sequence into a second, equivalent operation sequence comprising a select operation followed by a transform operation.
Claim 12
Dependent Claim
43 words
The system of claim 9 , wherein the first operation sequence comprises a plurality of transform operations and a plurality of select operations and wherein the second, equivalent operation sequence comprises a plurality of select operation followed by a plurality of transform operations.
Claim 13
Dependent Claim
60 words
The system of claim 10 , wherein said means for converting comprises: means for combining the plurality of select operation into a single, equivalent select operation; and means for combining the plurality of transform operations into a single, equivalent transform operation, whereby the second, equivalent operation sequence comprises the single, equivalent select operation followed by the single, equivalent transform operation.
Claim 14
Dependent Claim
46 words
The system of claim 9 , wherein said means for converting comprises: means for reducing a number of calculations required to determine the second, equivalent operation sequence by storing results of any common subexpressions thereof and using said stored results instead of recalculating the common subexpressions.
Claim 15
Dependent Claim
85 words
At least one program storage device readable by a machine, tangibly embodying at least one program of instructions executable by the machine to perform a method for arranging operations performable on message streams in a message processing system by a first operation sequence between two nodes in the system, the first operation sequence having a transform operation followed by a select operation, the method comprising: converting the first operation sequence into a second, equivalent operation sequence comprising a select operation followed by a transform operation.
Claim 16
Dependent Claim
85 words
At least one program storage device readable by a machine, tangibly embodying at least one program of instructions executable by the machine to perform a method for arranging operations performable on message streams in a message processing system by a first operation sequence between two nodes in the system, the first operation sequence having a transform operation followed by a select operation, the method comprising: converting the first operation sequence into a second, equivalent operation sequence comprising a select operation followed by a transform operation.
Claim 17
Dependent Claim
48 words
The at least one program storage device of claim 13 , wherein the first operation sequence comprises a plurality of transform operations and a plurality of select operations and wherein the second, equivalent operation sequence comprises a plurality of select operations followed by a plurality of transform operations.
Claim 18
Dependent Claim
59 words
The at least one program storage device of claim 14 , wherein said converting comprises: combining the plurality of select operation into a single, equivalent select operation; and combining the plurality of transform operations into a single, equivalent transform operation, whereby the second, equivalent operation sequence comprises the single, equivalent select operation followed by the single, equivalent transform operation.
Claim 19
Dependent Claim
47 words
The at least one program storage device of claim 13 , wherein said converting comprises: reducing a number of calculations required to determine the second, equivalent operation sequence by storing results of any common subexpressions thereof and using said stored results instead of recalculating the common subexpressions.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-01-19 | 2007-07-21 | 2008-01-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-01-19 | 2011-07-21 | 2012-01-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-01-19 | 2015-07-21 | 2016-01-20 | $7700.00 | Window Closed / Lapsed |