Patents by Inventor Herbert Hum

Herbert Hum 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: 20090328057
    Abstract: A device and method may fetch an instruction or micro-operation for execution. An indication may be made as to whether the instruction is dependent upon any source values corresponding to a set of previously fetched instructions. A value may be stored corresponding to each source value from which the first instruction depends. An indication may be made for each of the set of sources of the instruction, whether the source depends on a previously loaded value or source, where indicating may include storing a value corresponding to the indication. The instruction may be executed after the stored values associated with the instruction indicate the dependencies are satisfied.
    Type: Application
    Filed: June 30, 2008
    Publication date: December 31, 2009
    Inventors: Sagi LAHAV, Guy Patkin, Zeev Sperber, Herbert Hum, Shih-Lien Lu, Srikanth T. Srinivasan
  • Publication number: 20090222654
    Abstract: Techniques to control power and processing among a plurality of asymmetric cores. In one embodiment, one or more asymmetric cores are power managed to migrate processes or threads among a plurality of cores according to the performance and power needs of the system.
    Type: Application
    Filed: July 22, 2008
    Publication date: September 3, 2009
    Inventors: Herbert Hum, Eric Sprangle, Doug Carmean, Rajesh Kumar
  • Publication number: 20090077360
    Abstract: In one embodiment, the present invention includes a software-controlled method of forming instruction strands. The software may include instructions to obtain code of a superblock including a plurality of basic blocks, build a dependency directed acyclic graph (DAG) for the code, sort nodes coupled by edges of the dependency DAG into a topological order, form strands from the nodes based on hardware constraints, rule constraints, and scheduling constraints, and generate executable code for the strands and store the executable code in a storage. Other embodiments are described and claimed.
    Type: Application
    Filed: September 18, 2007
    Publication date: March 19, 2009
    Inventors: Wei Liu, Lixin Su, Youfeng Wu, Herbert Hum
  • Patent number: 7506108
    Abstract: A method for resolving data request conflicts in a cache coherency protocol for multiple caching agents using requester-generated data forwards. In one embodiment, a caching agent stores information used to auto-generate a forward of data received in response to a data request.
    Type: Grant
    Filed: June 30, 2006
    Date of Patent: March 17, 2009
    Assignee: Intel Corporation
    Inventors: Robert Beers, Herbert Hum
  • Publication number: 20090019306
    Abstract: In one embodiment, the present invention includes a shared cache memory that is inclusive with other cache memories coupled to it. The shared cache memory includes error correction logic to correct an error present in a tag array of one of the other cache memories and to provide corrected tag information to replace a tag entry in the tag array including the error. Other embodiments are described and claimed.
    Type: Application
    Filed: July 11, 2007
    Publication date: January 15, 2009
    Inventors: Herbert Hum, Rajagopal K. Narayanan
  • Patent number: 7350016
    Abstract: A high speed DRAM cache architecture. One disclosed embodiment includes a multiplexed bus interface to interface with a multiplexed bus. A cache control circuit drives a row address portion of an address on the multiplexed bus interface and a command to open a memory page containing data for a plurality of ways. The cache control circuit subsequently drives a column address including at least a way indicator to the multiplexed bus interface.
    Type: Grant
    Filed: January 10, 2006
    Date of Patent: March 25, 2008
    Assignee: Intel Corporation
    Inventors: Kuljit S. Bains, Herbert Hum, John Halbert
  • Publication number: 20080005482
    Abstract: A method for resolving data request conflicts in a cache coherency protocol for multiple caching agents using requester-generated data forwards. In one embodiment, a caching agent stores information used to auto-generate a forward of data received in response to a data request.
    Type: Application
    Filed: June 30, 2006
    Publication date: January 3, 2008
    Inventors: Robert Beers, Herbert Hum
  • Publication number: 20070078879
    Abstract: A structure referred to as an Active Address Table (AAT) may be used for cache coherence conflict resolution. The AAT may function to detect conflicting coherent requests to the same address and may ensure that each requesting entity receives a copy of the requested cache line in a cache line state-maintaining manner.
    Type: Application
    Filed: September 30, 2005
    Publication date: April 5, 2007
    Inventors: Robert Safranek, Aimee Wood, Herbert Hum, Robert Beers
  • 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: 20070022279
    Abstract: An arrangement is provided for compressing microcode ROM (“uROM”) in a processor and for efficiently accessing a compressed “uROM”. A clustering-based approach may be used to effectively compress a uROM. The approach groups similar columns of microcode into different clusters and identifies unique patterns within each cluster. Only unique patterns identified in each cluster are stored in a pattern storage. Indices, which help map an address of a microcode word (“uOP”) to be fetched from a uROM to unique patterns required for the uOP, may be stored in an index storage. Typically it takes a longer time to fetch a uOP from a compressed uROM than from an uncompressed uROM. The compressed uROM may be so designed that the process of fetching a uOP (or uOPs) from a compressed uROM may be fully-pipelined to reduce the access latency.
    Type: Application
    Filed: July 20, 2005
    Publication date: January 25, 2007
    Inventors: Youfeng Wu, Sangwook Kim, Mauricio Breternitz, Herbert Hum
  • Publication number: 20070002760
    Abstract: Architectures and techniques that allow legacy pin functionality to be replaced with a “virtual wire” that may communicate information that would otherwise be communicated by a wired interface. A message may be passed between a system controller and a processor that includes a virtual wire value and a virtual wire change indicator. The virtual wire value may include a signal corresponding to one or more pins that have been eliminated from the physical interface and the virtual wire change value may include an indication of whether the virtual wire value has changed. The combination of the virtual wire value and the virtual wire change indicator may allow multiple physical pins to be replaced by message values.
    Type: Application
    Filed: June 30, 2005
    Publication date: January 4, 2007
    Inventors: Keshavan Tiruvallur, David Poisner, Herbert Hum, Frank Binns, David Hill, Robert Greiner, Raymond Tetrick
  • Publication number: 20060253657
    Abstract: Use of an import cache and/or an export directory with an agent within to respond to requests for data. The import cache stores data that has been imported through the agent. The export directory stores information related to data that has been exported through the agent. Because the import cache and the export directory only store data that has passed through the agent, not all data transferred within a system are tracked by a single import cache or export directory.
    Type: Application
    Filed: July 6, 2006
    Publication date: November 9, 2006
    Inventors: Herbert Hum, James Goodman
  • Publication number: 20060236038
    Abstract: The cache coherency protocol described herein can be used to maintain a virtual model of a system, where the virtual model does not change as the system configuration changes. In general, the virtual model is based on the assumption that each node in the system can directly communicate with some number of other nodes in the system. In one embodiment, for each cache line, the address of the cache line is used to designate a node as the “home” node and all other nodes as “peer” nodes. The protocol specifies one set of messages for communication with the line's home node and another set of messages for communication with the line's peer nodes.
    Type: Application
    Filed: June 5, 2006
    Publication date: October 19, 2006
    Inventors: Herbert Hum, James Goodman
  • Patent number: 7095342
    Abstract: In one embodiment, the present invention includes a method to compress data stored in a memory to reduce size and power consumption. The method includes segmenting each word of a code portion into multiple fields, forming tables having unique entries for each of the fields, and assigning a pointer to each of the unique entries in each of the tables. Other embodiments are described and claimed.
    Type: Grant
    Filed: March 31, 2005
    Date of Patent: August 22, 2006
    Assignee: Intel Corporation
    Inventors: Herbert Hum, Mauricio Breternitz, Jr., Youfeng Wu, Sangwook Kim
  • Publication number: 20060117129
    Abstract: A high speed DRAM cache architecture. One disclosed embodiment includes a multiplexed bus interface to interface with a multiplexed bus. A cache control circuit drives a row address portion of an address on the multiplexed bus interface and a command to open a memory page containing data for a plurality of ways. The cache control circuit subsequently drives a column address including at least a way indicator to the multiplexed bus interface.
    Type: Application
    Filed: January 10, 2006
    Publication date: June 1, 2006
    Inventors: Kuljit Bains, Herbert Hum, John Halbert
  • Patent number: 7054999
    Abstract: A high speed DRAM cache architecture. One disclosed embodiment includes a multiplexed bus interface to interface with a multiplexed bus. A cache control circuit drives a row address portion of an address on the multiplexed bus interface and a command to open a memory page containing data for a plurality of ways. The cache control circuit subsequently drives a column address including at least a way indicator to the multiplexed bus interface.
    Type: Grant
    Filed: August 2, 2002
    Date of Patent: May 30, 2006
    Assignee: Intel Corporation
    Inventors: Kuljit S. Bains, Herbert Hum, John Halbert
  • Publication number: 20050273400
    Abstract: Systems and methods of managing transactions provide for receiving a first flush command at a first I/O hub, wherein the first flush command is dedicated to non-posted transactions. One embodiment further provides for halting an inbound ordering queue of the first I/O hub with regard to non-posted transactions in response to the first flush command and flushing a non-posted transaction from an outgoing buffer of the first I/O hub to a second I/O hub while the inbound ordering queue is halted with regard to non-posted transactions.
    Type: Application
    Filed: June 2, 2004
    Publication date: December 8, 2005
    Inventors: Robert Blankenship, Robert Greiner, Herbert Hum, Kenneth Creta, Buderya Acharya
  • Publication number: 20050262250
    Abstract: The invention facilitates a messaging protocol in a multi-node system to resolve conflicts at a home node.
    Type: Application
    Filed: April 27, 2004
    Publication date: November 24, 2005
    Inventors: Brannon Batson, Ling Cen, William Welch, Herbert Hum, Seungjoon Park
  • 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