Patents by Inventor Michael Steven Siegel
Michael Steven Siegel has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8281075Abstract: A technique for triggering a system bus write command with user code includes identifying a specific store-type instruction in a user instruction sequence. The specific store-type instruction is converted into a specific request-type command, which is configured to include core permission controls (that are stored in core configuration registers of a processor core by a trusted kernel) and user created data (stored in a cache memory). Slave devices are configured through register space (that is only accessible by the trusted kernel) with respective slave permission controls. The specific request-type command is then transmitted from the cache memory, via a system bus. In this case, the slave devices that receive the specific request-type command process the specific request-type command when the core permission controls are the same as the respective slave permission controls. The trusted kernel may be included in a hypervisor or an operating system.Type: GrantFiled: April 14, 2009Date of Patent: October 2, 2012Assignee: International Business Machines CorporationInventors: Lakshminarayana Baba Arimilli, Brian Mitchell Bass, David Wayne Cummings, Bernard Charles Drerup, Guy Lynn Guthrie, Ronald Nick Kalla, Hugh Shen, Michael Steven Siegel, William John Starke, Derek Edward Williams
-
Patent number: 8230117Abstract: A technique for maintaining input/output (I/O) command ordering on a bus includes assigning a channel identifier to I/O commands of an I/O stream. In this case, the channel identifier indicates the I/O commands belong to the I/O stream. A command location indicator is assigned to each of the I/O commands. The command location indicator provides an indication of which one of the I/O commands is a start command in the I/O stream and which of the I/O commands are continue commands in the I/O stream. The I/O commands are issued in a desired completion order. When a first one of the I/O commands does not complete successfully, the I/O commands in the I/O stream are reissued on the bus starting at the first one of the I/O commands that did not complete successfully.Type: GrantFiled: April 9, 2009Date of Patent: July 24, 2012Assignee: International Business Machines CorporationInventors: George William Daly, Jr., Guy Lynn Guthrie, Ross Boyd Leavens, Joseph Gerald McDonald, Michael Steven Siegel, William John Starke, Derek Edward Williams
-
Patent number: 8170024Abstract: A method, apparatus and computer program product are provided for implementing a pointer and stake model for frame alteration code in a network processor. A current pointer and a stake are provided for a packet selected for transmit. The current pointer is maintained for tracking a current position for frame alteration operations in the packet. The stake is maintained for tracking a start of a current header for frame alteration operations in the packet. The current pointer is used by frame alteration code instructions to specify a sequence of operations relative to the current pointer. The specified frame alteration sequence is compact in terms of code size to operate on data within a small window of bytes. Advance pointer instructions allow the current and stake pointers to be advanced an arbitrary number of bytes into the packet.Type: GrantFiled: November 5, 2007Date of Patent: May 1, 2012Assignee: International Business Machines CorporationInventors: Kerry Christopher Imming, John David Irish, Joseph Franklin Logan, Tolga Ozguner, Michael Steven Siegel
-
Patent number: 8130650Abstract: The decision within a packet processing device to transmit a newly arriving packet into a queue to await further processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to a threshold. The outcome of the update is adjustment up or down of the transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.Type: GrantFiled: July 17, 2008Date of Patent: March 6, 2012Assignee: International Business Machines CorporationInventors: James Johnson Allen, Jr., Brian Mitchell Bass, Gordon Taylor Davis, Clark Debs Jeffries, Jitesh Ramachandran Nair, Ravinder Kumar Sabhikhi, Michael Steven Siegel, Rama Mohan Yedavalli
-
Patent number: 7984038Abstract: Novel data structures, methods and apparatus for finding the longest prefix match search when searching tables with variable length patterns or prefixes. To find the exact match or the best matching prefix, patterns have to be compared a bit at a time until the exact or first match is found. This requires ānā number of comparisons or memory accesses to identify the closest matching pattern. The trees are built in such a way that the matching result is guaranteed to be a best match, whether it is an exact match or a longest prefix match. Using the trail of all the birds and associated prefix lengths enables determination of the correct prefix result from the trail. By construction, the search tree provides the best matching prefix at or after the first compare during walking of the trail or tree.Type: GrantFiled: April 15, 2008Date of Patent: July 19, 2011Assignee: International Business Machines CorporationInventors: Brian Mitchell Bass, Jean Louis Calvignac, Marco C. Heddes, Antonios Maragkos, Piyush Chunilal Patel, Michael Steven Siegel, Fabrice Jean Verplanken
-
Patent number: 7953077Abstract: A method and system for identifying a data structure associated with a packet of data. A processor internal to a packet processor may extract one or more fields in a packet header field of a received packet of data to generate a search key. The internal processor may then be configured to select which table, e.g., routing table, quality of service table, filter table, needs to be accessed using the search key in order to process the received packet of data. A determination may then be made by the internal processor as to whether a CAM or a hash table and a Patricia Tree are used to identify the data structure associated with the received packet of data. Based on table definitions in a register, the internal processor may make such a determination.Type: GrantFiled: July 17, 2006Date of Patent: May 31, 2011Assignee: International Business Machines CorporationInventors: Jean Louis Calvignac, Gordon Taylor Davis, Marco Heddes, Michael Steven Siegel
-
Patent number: 7917908Abstract: In an ordered semaphore management system a pending state allows threads not competing for a locked semaphore to bypass one or more threads waiting for the same locked semaphore. The number of pending levels determines the number of consecutive threads vying for the same locked semaphore which can be bypassed. When more than one level is provided the pending levels are prioritized in the queued order.Type: GrantFiled: June 12, 2008Date of Patent: March 29, 2011Assignee: International Business Machines CorporationInventors: Steven Kenneth Jenkins, Ross Boyd Leavens, Robert Brian Likovich, Jr., Wesley Erich Queen, Michael Steven Siegel
-
Patent number: 7899069Abstract: A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.Type: GrantFiled: May 3, 2008Date of Patent: March 1, 2011Assignee: International Business Machines CorporationInventors: Brahmanand Kumar Gorti, Marco Heddes, Clark Debs Jeffries, Andreas Kind, Michael Steven Siegel
-
Patent number: 7872968Abstract: A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.Type: GrantFiled: December 8, 2006Date of Patent: January 18, 2011Assignee: International Business Machines CorporationInventors: Brahmanand Kumar Gorti, Marco Heddes, Clark Debs Jeffries, Andreas Kind, Michael Steven Siegel
-
Patent number: 7865697Abstract: A mechanism enabling a processor in a multiprocessor complex to function as a coprocessor to execute a specific function. The method includes a mechanism for activating a coprocessor to function as a coprocessor as well as a mechanism to execute a coprocessor request on the system. The present invention also provides a mechanism for efficient processor to processor communication for processors coupled to a common bus. Overall system performance is enhanced by significantly reducing the use of hardware interrupts for processor to processor communication.Type: GrantFiled: February 27, 2008Date of Patent: January 4, 2011Assignee: International Business Machines CorporationInventors: Zorik Machulsky, Julian Satran, Leah Shalev, Michael Steven Siegel, Gregory Scott Still, James Xenidis
-
Patent number: 7826399Abstract: A design structure is provided for a slotted ring network, in which a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.Type: GrantFiled: March 5, 2008Date of Patent: November 2, 2010Assignee: International Business Machines CorporationInventors: Timothy Hume Heil, Michael Steven Siegel, Jeffrey R. Summers, Steven Paul VanderWiel
-
Patent number: 7826476Abstract: A Resource Reservation System includes a Token Generation Unit (TGU) which generates and circulates among nodes of a communications system a Slotted Token (SLT) message having sub-fields to carry identification number for each input port in a node and the resource available for each input port. On receiving the message the Resource Control Unit (RCU) in each node can write port identification number, available resource in appropriate sub-fields of the SLT message, and reserve resources in other nodes by adjusting information in the sub-field associated with the other nodes.Type: GrantFiled: August 16, 2006Date of Patent: November 2, 2010Assignee: International Business Machines CorporationInventors: Mohammad Peyravian, Mark Anthony Rinaldi, Ravinder Kumar Sabhikhi, Michael Steven Siegel
-
Publication number: 20100262735Abstract: A technique for triggering a system bus write command with user code includes identifying a specific store-type instruction in a user instruction sequence. The specific store-type instruction is converted into a specific request-type command, which is configured to include core permission controls (that are stored in core configuration registers of a processor core by a trusted kernel) and user created data (stored in a cache memory). Slave devices are configured through register space (that is only accessible by the trusted kernel) with respective slave permission controls. The specific request-type command is then transmitted from the cache memory, via a system bus. In this case, the slave devices that receive the specific request-type command (via the system bus) process the specific request-type command when the core permission controls are the same as the respective slave permission controls.Type: ApplicationFiled: April 14, 2009Publication date: October 14, 2010Applicant: INTERNATIONAL BUISNESS MACHINES CORPORATIONInventors: Lakshminarayana Baba Arimilli, Brian Mitchell Bass, David Wayne Cummings, Bernard Charles Drerup, Guy Lynn Guthrie, Ronald Nick Kalla, Hugh Shen, Michael Steven Siegel, William John Starke, Derek Edward Williams
-
Publication number: 20100262720Abstract: A technique for maintaining input/output (I/O) command ordering on a bus includes assigning a channel identifier to I/O commands of an I/O stream. In this case, the channel identifier indicates the I/O commands belong to the I/O stream. A command location indicator is assigned to each of the I/O commands. The command location indicator provides an indication of which one of the I/O commands is a start command in the I/O stream and which of the I/O commands are continue commands in the I/O stream. The I/O commands are issued in a desired completion order. When a first one of the I/O commands does not complete successfully, the I/O commands in the I/O stream are reissued on the bus starting at the first one of the I/O commands that did not complete successfully.Type: ApplicationFiled: April 9, 2009Publication date: October 14, 2010Applicant: INTERNATIONAL BUISNESS MACHINES CORPORATIONInventors: George William Daly, JR., Guy Lynn Guthrie, Ross Boyd Leavens, Joseph Gerald McDonald, Michael Steven Siegel, William John Starke, Derek Edward Williams
-
Patent number: 7760669Abstract: In a slotted ring network, a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.Type: GrantFiled: June 27, 2006Date of Patent: July 20, 2010Assignee: International Business Machines CorporationInventors: Timothy Hume Heil, Michael Steven Siegel, Jeffrey R. Summers, Steven Paul VanderWiel
-
Patent number: 7646709Abstract: The decision within a packet processing device to transmit a newly arriving packet into a queue to await processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to thresholds and also comparing present queue occupancy to previous queue occupancy. The outcome of the update is a new transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.Type: GrantFiled: November 15, 2006Date of Patent: January 12, 2010Assignee: International Business Machines CorporationInventors: Clark Debs Jeffries, Jitesh Ramachandran Nair, Michael Steven Siegel, Rama Mohan Yedavalli
-
Patent number: 7620048Abstract: An apparatus is disclosed for transporting control information in a communications system. The apparatus comprises a network processor, a control point processor operatively coupled to the network processor, and a guided frame generated by the control point processor. The guided frame comprises a first section in which frame control information is placed and is used by the network processor to update at least one control register within the network processor; a second section carrying correlators assigned by the control point processor to correlate guided frame responses with their requests; a third section carrying one or a sequence of guided commands; and an End delimiter guided command.Type: GrantFiled: June 14, 2005Date of Patent: November 17, 2009Assignee: International Business Machines CorporationInventors: Brian Mitchell Bass, Jean Louis Calvignac, Anthony Matteo Gallo, Marco C. Heddes, Sridhar Rao, Michael Steven Siegel, Brian Alan Youngman, Fabrice Jean Verplanken
-
Patent number: 7590057Abstract: A control sub system, a plurality of interface processors, a plurality of media interfaces a plurality of queues are operatively coupled and responsive to a control signal to move data from a memory to a selected one of the plurality of queues.Type: GrantFiled: June 14, 2005Date of Patent: September 15, 2009Assignee: International Business Machines CorporationInventors: Brian Mitchell Bass, Jean Louis Calvignac, Anthony Matteo Gallo, Marco C. Heddes, Sridhar Rao, Michael Steven Siegel, Brian Alan Youngman, Fabrice Jean Verplanken
-
Publication number: 20090216998Abstract: A novel and useful mechanism enabling a processor in a multiprocessor complex to function as a coprocessor to execute a specific function. The method includes a mechanism for activating a coprocessor to function as a coprocessor as well as a mechanism to execute a coprocessor request on the system. The present invention also provides a mechanism for efficient processor to processor communication for processors coupled to a common bus. Overall system performance is enhanced by significantly reducing the use of hardware interrupts for processor to processor communication.Type: ApplicationFiled: February 27, 2008Publication date: August 27, 2009Inventors: Zorik Machulsky, Julian Satran, Leah Shalev, Michael Steven Siegel, Gregory Scott Still, James Xenidis
-
Publication number: 20080273464Abstract: The decision within a packet processing device to transmit a newly arriving packet into a queue to await further processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to a threshold. The outcome of the update is adjustment up or down of the transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.Type: ApplicationFiled: July 17, 2008Publication date: November 6, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James Johnson Allen, Brian Mitchell Bass, Gordon Taylor Davis, Clark Debs Jeffries, Jitesh Ramachandran Nair, Ravinder Kumar Sabhikhi, Michael Steven Siegel, Rama Mohan Yedavalli