Bjorn Bergsten

US Patent:

7958076, Jun 7, 2011

Filed:

Nov 30, 2007

Appl. No.:

11/998581

Inventors:

Bjorn Bergsten - Southborough MA, US
Christopher K. McDermott - Westford MA, US

Assignee:

Stratus Technologies Bermuda Ltd. - Hamilton

International Classification:

G06F 17/00
G06N 5/02

US Classification:

706 47, 717117, 718102

Abstract:

A method of automatically determining firing priority in a plurality of rules. The method includes the steps of determining a level of dependency of each rule; and generating a hierarchy of rules in response to the level of dependency of each rule, wherein the firing priority corresponds to the hierarchy of rules. In another embodiment, the method further includes the step of determining if the hierarchy results in an inconsistency. In another embodiment, the method further comprises the step of determining if the hierarchy results in a loop. In yet another embodiment, the step of determining a level of dependency of each rule is performed in response to an initial event. In one embodiment the method includes the step of determining if there are reciprocal dependencies between any two rules in the set of rules.

US Patent:

8271416, Sep 18, 2012

Filed:

Aug 12, 2008

Appl. No.:

12/189843

Inventors:

Haitham Mahmoud Al-Beik - Stow MA, US
Bjorn Bergsten - Southborough MA, US

Assignee:

Stratus Technologies Bermuda Ltd. - Hamilton

International Classification:

G06F 17/00

US Classification:

706 47

Abstract:

A method for dynamically determining a predetermined previous condition of a rule-based system comprising a plurality of rules. Each of the plurality of rules is associated with a transaction and a condition under which the transaction is executed. In one embodiment, the method includes the steps of (a) determining a system condition; (b) determining an immediate previous condition that caused the system condition; (c) setting the immediate previous condition to the system condition; and (d) repeating steps (b) and (c) until the predetermined previous condition is reached.

US Patent:

20020016935, Feb 7, 2002

Filed:

Sep 24, 2001

Appl. No.:

09/961608

Inventors:

Bjorn Bergsten - Southborough MA, US
Praveen Mutalik - Southborough MA, US
Hrushikesh Bhide - Marlborough MA, US

International Classification:

G06F011/00

US Classification:

714/020000

Abstract:

A method and apparatus for managing one or more records. A scan module transmits a scan request to a session storage manager. The scan request identifies a particular record at which the scan module starts a scan session. The session storage manager also receives an application request from an application to modify the record. The session storage manager then transforms the requested record into a version if the record exhibits a predetermined characteristic.

US Patent:

20020152429, Oct 17, 2002

Filed:

Apr 12, 2001

Appl. No.:

09/833835

Inventors:

Bjorn Bergsten - Marlborough MA, US
Praveen Mutalik - Southbourough MA, US

International Classification:

H02H003/05

US Classification:

714/043000, 714/020000

Abstract:

A method and apparatus for managing session information. In one embodiment, a communication session is established between a client computer and a server computer. When the client computer and the server computer establish the communication session, the client or the server typically stores information about the communication session, which is referred to as “session information.” The session information is stored in a first log file stored in a persistent volatile memory and in a cache file stored in a volatile memory of the server. The cache file is reconstructed after a server failure by retrieving the session information stored in the first log file.

US Patent:

20070011499, Jan 11, 2007

Filed:

Jun 7, 2005

Appl. No.:

11/146864

Inventors:

Bjorn Bergsten - Southborough MA, US
Laurent Fournie - Belmont MA, US
Mark Streitfeld - Arlington MA, US

Assignee:

Stratus Technologies Bermuda Ltd. - Hamilton

International Classification:

G06F 11/00

US Classification:

714100000

Abstract:

The invention includes a method for determining whether a node in a non-recursive network can be removed. The method includes the steps of executing a reachability algorithm for a resource of a system upon initialization of the system. The resource is accessible to the system upon the initialization. A safe to pull manager evaluates the reachability algorithm for each node situated on the network to determine whether the node can be removed without interrupting resource accessibility to the system.