Stephen A Jay, 50548 S Bradford St, North Andover, MA 01845

6901463, May 31, 2005

Mar 5, 2003

10/382163

Stephen A. Jay - Chelmsford MA, US
Mark R. Johnson - Merrimack NH, US

Sun Microsystems, Inc. - Santa Clara CA

G06F013/00

710 52, 710 24, 710310, 709106, 370412

A method for linking work requests in a work queue with entries on a queue of completed requests. For each work queue, a tracking list is created. Each tracking list is linked to one queue of completed requests. When a work request is added to a given work queue, an entry is added to the associated tracking list. The entry in the tracking list contains all of the information needed to uniquely associate a completion queue entry to the work request that caused the completion queue entry. When a completion queue entry is retrieved from the completion queue, the tracking list for the work queue is searched for an entry corresponding to the completion queue entry. The work request that caused the completion queue entry is then identified from the information in the tracking list entry.

6917970, Jul 12, 2005

Mar 9, 2001

09/802628

Stephen A. Jay - Woburn MA, US
Srinivas Madhur - Westford MA, US
Mark R. Johnson - Nashua NH, US
Diana C. Klashman - Milford MA, US

Sun Microsystems, Inc. - Santa Clara CA

G06F015/177

709220

After a reset on a bus, the topologies of nodes on the bus before and after the reset are accessed to identify nodes that are new to the bus. A host identifies itself in both the new topology data and the old topology data. Referring to the connectedness between ports of a node and other ports in the new topology, similarly connected nodes in the old topology are identified as matching. Identifying data present in the old data can be assigned to the corresponding node in the new data. Any nodes in the new tree lacking a matching node will require requests over the bus to obtain its identification data.

7295525, Nov 13, 2007

Sep 11, 2003

10/660196

Jeremy N. Shapiro - Brighton MA, US
Stephen A. Jay - Chelmsford MA, US

Sun Microsystems, Inc. - Santa Clara CA

H04L 12/28
H04L 12/56
H04J 3/26

370256, 370400, 370401, 370432

A system and method for efficiently managing membership in a multicast communication group. The system may comprise any number of end nodes (e. g. , channel adapters, network interface adapters) and routing nodes (e. g. , switches), and the method may be implemented by a processor coupled to any node. Each node in a network may be a member of the multicast group and/or the multicast tree (MCT) that routes the group's multicast communications. A node need not be a member of the group to be a member of the tree. Network links included in the multicast tree (MCT) are a subset of a network minimum spanning tree (MST). When a node is added to the group, the minimum spanning tree (MST) is searched from that node until a node within the multicast tree (MCT) is found. Each time a member is removed from the group, the multicast tree (MCT) is pruned to reduce unneeded communications.

7448044, Nov 4, 2008

Feb 2, 2005

11/050138

Stephen T. Rust - Newton MA, US
Stephen A. Jay - Chelmsford MA, US

Sun Microsystems, Inc. - Santa Clara CA

G06F 13/00

719314, 709203, 709217, 709223, 709231

Systems and methods are described for providing queue pair numbers for a queue pair to more effectively track and manage the frequency of use and re-use of queue pair numbers on a queue pair context basis in an InfiniBand™ device. The present invention uses a counter for each queue pair context to set the changeable portion of the queue pair number. A reference count for each queue pair context is also used to track the quantity of queue pair numbers currently allocated to a queue pair context. The present invention sets, tracks and manages the values of the counter and the reference count for each queue pair context in conjunction with queue pair operations to provide a systematic queue pair numbering scheme. By tracking and/or setting values of the counter and reference count for a queue pair context, the present invention re-uses queue pair numbers efficiently and in a predictable and repeatable manner.

7480735, Jan 20, 2009

Sep 11, 2003

10/659942

Jeremy N. Shapiro - Brighton MA, US
Stephen A. Jay - Chelmsford MA, US

Sun Microsystems, Inc. - Santa Clara CA

G06F 15/173

709241, 709238, 709242, 370238, 370255, 370256

A system and method for routing between nodes in a network or subnet. An end node is associated with multiple identifiers for routing purposes, and therefore multiple paths may exist between two end nodes. Network nodes and components (e. g. , switches) are grouped into fault zones. Each physical enclosure of network entities may comprise a separate fault zone. For each zone through which a path between two nodes passes, a weight is calculated equal to the number of paths between the nodes that traverse that zone. Path weights are calculated for each path between the nodes, equal to the sum of the weights of each zone in the path. To improve network fault tolerance, new paths may be designed to avoid fault zones and existing paths with high weights. Instead of fault zones, other criteria may be used to assign weights, such as mean time between failures (MTBF), cost, speed, etc.

8201179, Jun 12, 2012

May 4, 2006

11/417427

Glenn A. Dearth - Groton MA, US
Stephen A. Jay - Chelmsford MA, US

Oracle America, Inc. - Redwood City CA

G06F 9/46

718104, 718100, 718107

A method for controlling sharing of resources in a multi-threaded environment includes entering a finite state machine state sequence; controlling resource-sharing threads using the finite state machine state sequence; and exiting the finite state machine state sequence when shared resource control is complete. A multi-threaded shared resource control system includes a finite state machine configured to control multi-threaded access to shared resources; a plurality of producer threads regulated by the finite state machine; and a plurality of consumer threads regulated by the finite state machine. A non-transitory computer usable medium having computer readable program code embodied therein for causing a computer system to execute a method for controlling sharing of resources in a multi-threaded environment includes entering a finite state machine state sequence; controlling resource-sharing threads using the finite state machine state sequence; and exiting the finite state machine state sequence when shared resource control is complete.

2002012, Sep 12, 2002

Mar 9, 2001

09/803531

Srinivas Madhur - Westford MA, US
Mark Johnson - Nashua NH, US
Stephen Jay - Woburn MA, US
Diana Klashman - Milford MA, US

G06F009/00
G06F009/24
G06F015/177

713/001000

A method of reading configuration ROM in a serial bus device reads only portions of the ROM that are organized in a directory structure. Typically, the configuration ROM follows the IEEE 1212 and/or 1394 standards and uses an IEEE 1394 bus. Based on the information read from the configuration ROM, a connecting computer can determine the appropriate device driver to use for communications with the device.