Patents by Inventor Aaron Spink

Aaron Spink 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: 7752397
    Abstract: In a cache coherency protocol multiple conflict phases may be utilized to resolve a data request conflict condition. The multiple conflict phases may avoid buffering or stalling conflict resolution, which may reduce system inefficiencies.
    Type: Grant
    Filed: January 9, 2009
    Date of Patent: July 6, 2010
    Assignee: Intel Corporation
    Inventors: Aaron Spink, Robert Beers
  • Patent number: 7536515
    Abstract: In a cache coherency protocol multiple conflict phases may be utilized to resolve a data request conflict condition. The multiple conflict phases may avoid buffering or stalling conflict resolution, which may reduce system inefficiencies.
    Type: Grant
    Filed: June 30, 2006
    Date of Patent: May 19, 2009
    Assignee: Intel Corporation
    Inventors: Aaron Spink, Robert Beers
  • Publication number: 20090119462
    Abstract: In a cache coherency protocol multiple conflict phases may be utilized to resolve a data request conflict condition. The multiple conflict phases may avoid buffering or stalling conflict resolution, which may reduce system inefficiencies.
    Type: Application
    Filed: January 9, 2009
    Publication date: May 7, 2009
    Inventors: AARON SPINK, Robert Beers
  • Publication number: 20080151894
    Abstract: An apparatus is described that routes packets to, from, and within a socket. The apparatus includes routing components that provide different functionality based upon which socket component they are connected to. One routing component is connected to an interface that communicates with the processor core of the socket.
    Type: Application
    Filed: December 22, 2006
    Publication date: June 26, 2008
    Inventors: Subramaniam Maiyuran, Aaron Spink, Nitin Agrawal
  • Publication number: 20080091963
    Abstract: Disclosed are embodiments of a method, apparatus and system for a low power state for a point-to-point link. During the low power state, the signal on both conductors of a differential transmit pair are driven to electrical idle. Analog activity detectors are enabled during the low power state and are disabled during normal power state. Exit from the low power state does not require a physical layer re-initialization sequence. Other embodiments are also described and claimed.
    Type: Application
    Filed: December 4, 2007
    Publication date: April 17, 2008
    Inventors: Naveen Cherukuri, Jeffrey Wilcox, Sanjay Dabral, Phanindra Mannava, Aaron Spink, David Dunning, Tim Frodsham, Theodore Schoenborn
  • Publication number: 20080077814
    Abstract: Disclosed are embodiments of a method, apparatus and system for a low power state for a point-to-point link. During the low power state, the signal on both conductors of a differential transmit pair are driven to electrical idle. Analog activity detectors are enabled during the low power state and are disabled during normal power state. Exit from the low power state does not require a physical layer re-initialization sequence. Other embodiments are also described and claimed.
    Type: Application
    Filed: December 4, 2007
    Publication date: March 27, 2008
    Inventors: Naveen Cherukuri, Jeffrey Wilcox, Sanjay Dabral, Phanindra Mannava, Aaron Spink, David Dunning, Tim Frodsham, Theodore Schoenborn
  • Publication number: 20080075107
    Abstract: Disclosed are embodiments of a method, apparatus and system for a low power state for a point-to-point link. During the low power state, the signal on both conductors of a differential transmit pair are driven to electrical idle. Analog activity detectors are enabled during the low power state and are disabled during normal power state. Exit from the low power state does not require a physical layer re-initialization sequence. Other embodiments are also described and claimed.
    Type: Application
    Filed: December 4, 2007
    Publication date: March 27, 2008
    Inventors: Naveen Cherukuri, Jeffrey Wilcox, Sanjay Dabral, Phanindra Mannava, Aaron Spink, David Dunning, Tim Frodsham, Theodore Schoenborn
  • Publication number: 20080005483
    Abstract: In a cache coherency protocol multiple conflict phases may be utilized to resolve a data request conflict condition. The multiple conflict phases may avoid buffering or stalling conflict resolution, which may reduce system inefficiencies.
    Type: Application
    Filed: June 30, 2006
    Publication date: January 3, 2008
    Inventors: Aaron Spink, Robert Beers
  • Publication number: 20070226596
    Abstract: A system and method for reduced power consumption communications over a physical interconnect is described. In an embodiment, an input/output circuit includes a port to receive a transmission unit via an interconnect, a combining module coupled to the port to append at least one of a first and a second indicator to the transmission unit, a first adder module to generate the first indicator, indicating that the transmission unit is a starting transmission unit of a set of related transmission units, a second adder module to generate the second indicator, indicating that the starting transmission unit of the set of related transmission units has already been received, and logic to determine at least one of the start and end boundaries of the set of related transmission units.
    Type: Application
    Filed: March 23, 2006
    Publication date: September 27, 2007
    Inventors: Robert Safranek, Aaron Spink, Selim Bilgin
  • Publication number: 20070133415
    Abstract: According to one embodiment of the invention, a credit/debit flow control mechanism performs credit initialization by a combination of standard protocol level messages (e.g., one or more flits) with encoded credit return values and the use of saturating counters.
    Type: Application
    Filed: December 13, 2005
    Publication date: June 14, 2007
    Inventor: Aaron Spink
  • Publication number: 20070088863
    Abstract: A proposal is discussed that facilitates exchanging parameters for a link layer that allows a variable number of parameters without changing a communication protocol. Likewise, the proposal allows for both components connected via the link to negotiate values for the parameters that are exchanged without a need for external agent intervention or redundancy.
    Type: Application
    Filed: September 28, 2005
    Publication date: April 19, 2007
    Inventors: Phanindra Mannava, Victor Lee, Aaron Spink
  • Publication number: 20070053350
    Abstract: In one embodiment, the present invention includes an apparatus that has multiple buffers, including a first buffer dedicated to a first virtual channel of a first virtual network and a second buffer shared among virtual channels of a second virtual network. The shared buffer may be implemented as a shared adaptive buffer, and the buffers can be controlled using different flow control schemes, such as on a packet and flit basis. Other embodiments are described and claimed.
    Type: Application
    Filed: August 24, 2005
    Publication date: March 8, 2007
    Inventors: Aaron Spink, Herbert Hum
  • Publication number: 20070047584
    Abstract: In one embodiment, the present invention includes a method for receiving a first portion of a first packet at a first agent and determining whether the first portion is an interleaved portion based on a value of an interleave indicator. The interleave indicator may be sent as part of the first portion. In such manner, interleaved packets may be sent within transmission of another packet, such as a lengthy data packet, providing improved processing capabilities. Other embodiments are described and claimed.
    Type: Application
    Filed: August 24, 2005
    Publication date: March 1, 2007
    Inventors: Aaron Spink, Herbert Hum
  • Publication number: 20060034295
    Abstract: Systems and methods of managing a link provide for receiving a remote width capability during a link initialization, the remote width capability corresponding to a remote port. A link between a local port and the remote port is operated at a plurality of link widths in accordance with the remote width capability.
    Type: Application
    Filed: May 21, 2004
    Publication date: February 16, 2006
    Inventors: Naveen Cherukuri, Aaron Spink, Phanindra Mannava, Tim Frodsham, Jeffrey Wilcox, Sanjay Dabral, David Dunning, Theodore Schoenborn
  • Publication number: 20050259696
    Abstract: Embodiments of the invention provide an algorithm for dividing a link into one or more reduced-width links. For one embodiment of the invention, a multiplexing scheme is employed to effect a bit transmission order required by a particular cyclic redundancy check. The multiplexed output bits are then swizzled on-chip to reduce on-board routing congestion.
    Type: Application
    Filed: May 21, 2004
    Publication date: November 24, 2005
    Inventors: Maurice Steinman, Rahul Shah, Naveen Cherukuri, Aaron Spink, Allen Baum, Sanjay Dabral, Tim Frodsham, David Dunning, Theodore Schoenborn
  • Publication number: 20050262368
    Abstract: Disclosed are embodiments of a method, apparatus and system for a low power state for a point-to-point link. During the low power state, the signal on both conductors of a differential transmit pair are driven to electrical idle. Analog activity detectors are enabled during the low power state and are disabled during normal power state. Exit from the low power state does not require a physical layer re-initialization sequence. Other embodiments are also described and claimed.
    Type: Application
    Filed: May 21, 2004
    Publication date: November 24, 2005
    Inventors: Naveen Cherukuri, Jeffrey Wilcox, Sanjay Dabral, Phanindra Mannava, Aaron Spink, David Dunning, Tim Frodsham, Theodore Schoenborn
  • Publication number: 20050251599
    Abstract: In one embodiment of the present invention, a method includes identifying a transaction from a first processor to a second processor of a system with a transaction identifier. The transaction identifier may have a value that is less than or equal to a maximum number of outstanding transactions between the two processors. In such manner, a transaction field for the transaction identifier may be limited to n bits, where the maximum number of outstanding transactions is less than or equal to 2n. In various embodiments, such a transaction identifier combined with a source identifier and a home node identifier may form a globally unique transaction identifier.
    Type: Application
    Filed: April 27, 2004
    Publication date: November 10, 2005
    Inventors: Herbert Hum, Aaron Spink, Robert Blankenship
  • Publication number: 20050251612
    Abstract: In one embodiment of the present invention, a method may include separating incoming transactions to an agent of a coherent system into at least a first channel, a second channel, and a third channel, based upon a type of the incoming transactions. The incoming transactions may be sent by a peer device coupled to the coherent system. By separating the transactions based on type, deadlocks may be avoided.
    Type: Application
    Filed: April 27, 2004
    Publication date: November 10, 2005
    Inventors: Kenneth Creta, Aaron Spink, Robert Blankenship
  • Publication number: 20050238055
    Abstract: A predetermined network packet is utilized for power reduction in either or both of a transmitter and receiver when information is not needed. Upon detection of the predetermined network packet type, various portions of the transmitter and/or receiver may be clock gated or powered down.
    Type: Application
    Filed: April 27, 2004
    Publication date: October 27, 2005
    Inventors: Tim Frodsham, Naveen Cherukuri, Sanjay Darbal, David Dunning, Theodore Schoenborn, Lakshminarayan Krishnamurty, Aaron Spink
  • Publication number: 20050235067
    Abstract: Systems and methods of processing write transactions provide for combining write transactions on an input/output (I/O) hub according to a protocol between the I/O hub and a processor. Data associated with the write transactions can be flushed to an I/O device without the need for proprietary software and specialized registers within the I/O device.
    Type: Application
    Filed: April 20, 2004
    Publication date: October 20, 2005
    Inventors: Kenneth Creta, Aaron Spink, Lance Hacking, Sridhar Muthrasanallur, Jasmin Ajanovic