Patents by Inventor Christopher Wilkerson

Christopher Wilkerson 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: 20100082905
    Abstract: Methods and apparatus relating to disabling one or more cache portions during low voltage operations are described. In some embodiments, one or more extra bits may be used for a portion of a cache that indicate whether the portion of the cache is capable at operating at or below Vccmin levels. Other embodiments are also described and claimed.
    Type: Application
    Filed: September 30, 2008
    Publication date: April 1, 2010
    Inventors: Christopher Wilkerson, Muhammad M. Khellah, Vivek De, Ming Zhang, Jaume Abella, Javier Carretero Casado, Pedro Chaparro Monferrer, Xavier Vera, Antonio Gonzalez
  • Publication number: 20090172283
    Abstract: Methods and apparatus to reduce minimum operating voltage through a hybrid cache design are described. In one embodiment, a cache with different size bit cells may be used, e.g., to reduce minimum operating voltage of an integrated circuit device that includes the cache and possibly other logic (such as a processor). Other embodiments are also described.
    Type: Application
    Filed: December 31, 2007
    Publication date: July 2, 2009
    Inventors: Muhammad M. Khellah, Christopher Wilkerson, Alaa R. Alameldeen, Bibiche M. Geuskens, Tanay Karnik, Vivek De, Gunjan H. Pandya
  • Publication number: 20060277398
    Abstract: A method and apparatus for setting aside a long-latency micro-operation from a reorder buffer is disclosed. In one embodiment, a long-latency micro-operation would conventionally stall a reorder buffer. Therefore a secondary buffer may be used to temporarily store that long-latency micro-operation, and other micro-operations depending from it, until that long-latency micro-operation is ready to execute. These micro-operations may then be reintroduced into the reorder buffer for execution. The use of poisoned bits may be used to ensure correct retirement of register values merged from both pre- and post-execution of the micro-operations which were set aside in the secondary buffer.
    Type: Application
    Filed: June 3, 2005
    Publication date: December 7, 2006
    Inventors: Haitham Akkary, Ravi Rajwar, Srikanth Srinivasan, Christopher Wilkerson
  • Patent number: 6954848
    Abstract: After an instruction loads data into a register at a first time, the register is monitored to see if it is read in a next clock cycle. When the data is not read in the next clock cycle, the instruction is classified as a slowable instruction. An instruction address associated with the instruction is used to update a history table. The history table stores information to indicate if an instruction is a slowable instruction or a non-slowable instruction. When the instruction address of the instruction is encountered at a second time, the history table is used to determine if the instruction is slowable or non-slowable.
    Type: Grant
    Filed: January 2, 2002
    Date of Patent: October 11, 2005
    Assignee: Intel Corporation
    Inventors: Ryan Rakvic, Christopher Wilkerson, Bryan Black, Edward Grochowski, John Shen, Edward Brekelbaum
  • Publication number: 20050015555
    Abstract: A method and apparatus for determining replacement candidate cache lines, and for correlated prefetching, is disclosed. In one embodiment, a predictor determines whether a cache line that has a relative age older than a selected max-age is referenced fewer times than a threshold value. If so, then that cache line may be selected for replacement. In another embodiment, a correlating prefetcher may prefetch a cache line when it is found to be correlated to a cache line resident in a lower-order cache.
    Type: Application
    Filed: July 16, 2003
    Publication date: January 20, 2005
    Inventor: Christopher Wilkerson
  • Publication number: 20050010740
    Abstract: Apparatus and methods for addressing predicting useful in high-performance computing systems. The present invention provides novel correlation prediction tables. In one embodiment, correlation prediction tables of the present invention contain an entered key for each successor value entered into the correlation table. In a second embodiment, correlation prediction tables of the present invention utilize address offsets for both the entered keys and entered successor values.
    Type: Application
    Filed: August 12, 2004
    Publication date: January 13, 2005
    Inventors: Wayne Wong, Christopher Wilkerson
  • Publication number: 20030126412
    Abstract: After an instruction loads data into a register at a first time, the register is monitored to see if it is read in a next clock cycle. When the data is read in a next clock cycle, the instruction is classified as a slowable instruction. An instruction address associated with the instruction is used to update a history table. The history table stores information to indicate if an instruction is a slowable instruction or a non-slowable instruction. When the instruction address of the instruction is encountered at a second time, the history table is used to determine if the instruction is slowable or non-slowable.
    Type: Application
    Filed: January 2, 2002
    Publication date: July 3, 2003
    Inventors: Ryan Rakvic, Christopher Wilkerson, Bryan Black, Edward Grochowski, John Shen, Edward Brekelbaum