Patents by Inventor Mark S. Hefty

Mark S. Hefty 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).

  • Publication number: 20130262613
    Abstract: One embodiment provides a method for receiving subnet administration (SA) data using a remote direct memory access (RDMA) transfer. The method includes formatting, by a network node element, an SA data query with an RDMA-capable flag; configuring, by the network node element, a reliably-connected queue pair (RCQP) to receive an RDMA transfer from a subnet manager in communication with the network node element on an RDMA-capable network; and allocating, by the network node element, an RDMA write target buffer to receive the SA data using an RDMA transfer from the subnet manager in response to the SA data query.
    Type: Application
    Filed: March 26, 2013
    Publication date: October 3, 2013
    Inventor: Mark S. Hefty
  • Patent number: 7143410
    Abstract: A host system is provided with a shared resource (such as work queues and completion queues); multiple processors arranged to access the shared resource; and an operating system arranged to allow multiple processors to perform work on the shared resource concurrently while supporting updates of the shared resource. Such an operating system may comprise a synchronization algorithm for synchronizing multiple threads of operation with a single thread so as to achieve mutual exclusion between multiple threads performing work on the shared resource and a single thread updating or changing the state of the shared resource without requiring serialization of all threads.
    Type: Grant
    Filed: March 31, 2000
    Date of Patent: November 28, 2006
    Assignee: Intel Corporation
    Inventors: Jerrie L. Coffman, Mark S. Hefty, Fabian S. Tillier
  • Patent number: 6735174
    Abstract: Methods and systems for flow control over channel-based switched fabric connections between a first side and a second side. At least one posted receive buffer is stored in a receive buffer queue at the first side. A number of credits is incremented based on the at least one posted receive buffer. The second side is notified of the number of credits. A number of send credits is incremented at the second side based on the number of credits. A message is sent from the second side to the first side if the number of send credits is larger than or equal to two or the number of send credits is equal to one and a second number of credits is larger than or equal to one. The second number of credits is based on at least one second posted receive buffer at the second side. Therefore, communication of messages between the first side and the second side is prevented from deadlocking.
    Type: Grant
    Filed: March 29, 2000
    Date of Patent: May 11, 2004
    Assignee: Intel Corporation
    Inventors: Mark S. Hefty, Jerrie L. Coffman
  • Publication number: 20040076116
    Abstract: Methods and systems for flow control over channel-based switched fabric connections between a first side and a second side. At least one posted receive buffer is stored in a receive buffer queue at the first side. A number of credits is incremented based on the at least one posted receive buffer. The second side is notified of the number of credits. A number of send credits is incremented at the second side based on the number of credits. A message is sent from the second side to the first side if the number of send credits is larger than or equal to two or the number of send credits is equal to one and a second number of credits is larger than or equal to one. The second number of credits is based on at least one second posted receive buffer at the second side. Therefore, communication of messages between the first side and the second side is prevented from deadlocking.
    Type: Application
    Filed: October 16, 2003
    Publication date: April 22, 2004
    Inventors: Mark S. Hefty, Jerrie L. Coffman
  • Patent number: 6718370
    Abstract: A host system is provided one or more hardware adapters; multiple work queues each configured to send and receive message data via said one or more hardware adapters; multiple completion queues each configured to coalesce completions from multiple work queues belonging to a single hardware adapters; and a completion queue management mechanism configured to check for completions across multiple completion queues in the context of either a single thread or multiple threads of operation.
    Type: Grant
    Filed: March 31, 2000
    Date of Patent: April 6, 2004
    Assignee: Intel Corporation
    Inventors: Jerrie L. Coffman, Mark S. Hefty, Fabian S. Tillier
  • Patent number: 6553438
    Abstract: Methods and system for a message resource pool with asynchronous and synchronous modes of operation. One or more buffers, descriptors, and message elements are allocated for a user. Each element is associated with one descriptor and at least one buffer. The allocation is performed by the message resource pool. The buffers and the descriptors are registered with a unit management function by the message resource pool. Control of an element and associated descriptor and at least one buffer is passed from the message resource pool to the user upon request by the user. The control of the element and associated descriptor and at least one buffer is returned from the user to the message resource pool once use of the element and associated descriptor and at least one buffer by the user has completed.
    Type: Grant
    Filed: April 24, 2000
    Date of Patent: April 22, 2003
    Assignee: Intel Corporation
    Inventors: Jerrie L. Coffman, Mark S. Hefty, Fabian S. Tillier
  • Publication number: 20020087720
    Abstract: A system, method and computer program to enable the transmission and reception of messages between nodes in a communications network. This system, method and computer program operate using a flow control message header having a message sent field and a message limit field. The message limit field would indicate the maximum number of messages a transmitting node may send to a receiving node. The message sent field would indicate the number of messages that have been sent. By using these field and keeping track of the messages sent and received it is possible for this system, method and computer program to insure that a receiving node has adequate memory space to receive messages and to identify when a message is dropped during a transmission and provide additional memory space to compensate for such a dropped message.
    Type: Application
    Filed: December 28, 2000
    Publication date: July 4, 2002
    Inventors: Arlin R. Davis, Mark S. Hefty