Michael R Krause

US Patent:

6718392, Apr 6, 2004

Filed:

Oct 24, 2000

Appl. No.:

09/695634

Inventors:

Michael R. Krause - Boulder Creek CA

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 1300

US Classification:

709238

Abstract:

A distributed computer system has a first subnet including a first group of endnodes and a second subnet including a second group of endnodes. Each endnode in the first and second groups of endnodes includes at least one process which produces and/or consumes message data, and queue pairs. Each queue pair includes a send work queue having work queue elements that describe message data for sending, and a receive work queue having work queue elements that describe where to place incoming message data. A communication fabric is physically coupled to the first group of endnodes and the second group of endnodes. A partitioning mechanism associates a first partition key representing endnodes in a first partition to a first group of queue pairs and a second partition key representing endnodes in a second partition to a second group of queue pairs for enabling communication between endnodes over the communication fabric.

US Patent:

6950961, Sep 27, 2005

Filed:

Feb 13, 2001

Appl. No.:

09/783159

Inventors:

Michael R. Krause - Boulder Creek CA, US
Kimberly K. Scott - San Jose CA, US
Fred B. Worley - Santa Clara CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F011/00

US Classification:

714 4, 714 6, 714 43

Abstract:

The present invention relates to highly available sequence number generation with minimal latency. The present invention involves establishing a primary and secondary sequence number generators. A sequence number request is forwarded to the primary generator. The primary generator determines the next sequence number and forwards the response to the secondary generator. The secondary generator stores the value and forwards the value to the originating entity. Accordingly, the configuration avoids single point failure and is robust against malfunction.

US Patent:

7016971, Mar 21, 2006

Filed:

May 24, 2000

Appl. No.:

09/980760

Inventors:

Renato J. Recio - Austin TX, US
David J. Garcia - Los Gatos CA, US
Michael R. Krause - Boulder Creek CA, US
Patricia A. Thaler - Carmichael CA, US
John C. Krause - Georgetown TX, US

Assignee:

Hewlett-Packard Company - Palo Alto CA
IBM Corporation - Armonk NY
Compaq Computer Corporation - Houston TX
Adaptec, Inc. - Milpitas CA

International Classification:

G06F 15/16

US Classification:

709233, 709234

Abstract:

A distributed computer system includes links and routing devices coupled between the links and routing frames between the links. Each of the routing devices includes a congestion control mechanism for detecting congestion at the routing device and responding to detected congestion by gradually reducing an injection rate of frames routed from the routing device.

US Patent:

7103744, Sep 5, 2006

Filed:

Mar 27, 2003

Appl. No.:

10/401235

Inventors:

David J. Garcia - Los Gatos CA, US
Jeffrey R. Hilland - Cypress TX, US
Paul R. Culley - Tomball TX, US
Dwight L. Barron - Houston TX, US
Michael R. Krause - Boulder Creek CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 12/00
G06F 13/28

US Classification:

711170, 711163, 710 22

Abstract:

The disclosed embodiments may relate to memory window access and may include a memory window and plurality of queue pairs associated with a process. Each of the plurality of queue pairs may be associated with a memory window context that may have queue pair information. The memory window may be associated with a memory window context that includes a protection information field. Accordingly, access to memory window may be allowed if the queue pair information matches the protection information field.

US Patent:

7171484, Jan 30, 2007

Filed:

May 24, 2000

Appl. No.:

09/980759

Inventors:

Michael R. Krause - Boulder Creek CA, US
David J. Garcia - Los Gatos CA, US
Paul R. Culley - Tomball TX, US
Renato J. Recio - Austin TX, US
Alan F. Benner - Poughkeepsie NY, US

International Classification:

G06F 15/16

US Classification:

709232

Abstract:

A distributed computer system includes a source endnode including a source process which produces message data and a send work queue having work queue elements that describe the message data for sending. A destination endnode includes a destination process and a receive work queue having work queue elements that describe where to place incoming message data. A communication fabric provides communication between the source endnode and the destination endnode. An end-to-end context is provided at the source endnode and the destination endnode storing state information to ensure the reception and sequencing of message data sent from the source endnode to the destination endnode permitting reliable datagram service between the source endnode and the destination endnode.

US Patent:

7318102, Jan 8, 2008

Filed:

May 23, 2000

Appl. No.:

09/578155

Inventors:

Michael R. Krause - Boulder Creek CA, US
Fred B. Worley - Santa Clara CA, US
Shankar G. Iyer - Cupertino CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/16

US Classification:

709230, 709227

Abstract:

A reliable datagram service is implemented with a source and destination resource (SDR). Source SDR resources, at a source device, multiplex units of work produced by at least one source application instance (AI) into a serial unit of work stream having units of work in a defined order and transmit the serial unit of work stream over a communication services/fabric. Destination SDR resources, at a destination device, receive the serial unit of work stream, demultiplex the serial unit of work stream into units of work provided to at least one destination AI, and provide a negative acknowledgement (NAK) for a unit of work received ahead of its defined order.

US Patent:

7346699, Mar 18, 2008

Filed:

May 24, 2000

Appl. No.:

09/578019

Inventors:

Michael R. Krause - Boulder Creek CA, US
Fred B. Worley - Santa Clara CA, US
Kimberly K. Scott - San Jose CA, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 15/173
G06F 15/16

US Classification:

709232, 709224

Abstract:

A reliable multicast service is operated between a source device and multiple destination devices participating in a multicast group. The source device includes a first source application instance (AI) producing a first unit of work stream, and communication services (CS). Each destination device in the multicast group includes CS, and at least one destination AI which consumes units of work. Communication services/fabric provide communication between the source device and the multiple destination devices. Multiple source and destination resources (SDRs) implement corresponding multiple reliable transport services between the source device and corresponding multiple destination devices in the multicast group for delivery of the first unit of work stream to the corresponding destination devices and guaranteeing strong ordering of the first unit of work stream received at the corresponding destination devices.

US Patent:

7404190, Jul 22, 2008

Filed:

Sep 18, 2003

Appl. No.:

10/664707

Inventors:

Michael R. Krause - Boulder Creek CA, US
Jeffrey R. Hilland - Cypress TX, US

Assignee:

Hewlett-Packard Development Company, L.P. - Houston TX

International Classification:

G06F 3/00
G06F 9/44
G06F 9/46
G06F 13/00
G06F 15/167
G06F 13/28

US Classification:

719318, 719314, 709212, 710 22

Abstract:

The disclosed embodiments relate to a method and apparatus for providing notification. The apparatus may comprise a plurality of completion queue handlers associated with a communication device. Each of the plurality of completion queue handlers may be associated with a plurality of processes. At least one completion queue may be associated with at least one of the plurality of completion queue handlers.