Patents by Inventor BRENDAN VOGE

BRENDAN VOGE 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: 20050198522
    Abstract: Methods and apparatus in a partitionable computing system. A first link controller is associated with a first partition. A second link controller is associated with a second partition. A computing element communicated with link controllers to establish or deny communication between the partitions.
    Type: Application
    Filed: January 12, 2004
    Publication date: September 8, 2005
    Inventors: Mark Shaw, Vipul Gandhi, Gregg Lesartre, Brendan Voge
  • Publication number: 20050162830
    Abstract: An electronic system comprises an enclosure and a backplane coupled inside the enclosure. The backplane has a plurality of slots capable of receiving a plurality of modules of various number and functionality. The modules include power modules, cooling modules, and function modules that are capable of plug insertion into the backplane slots. The backplane receives power and signal connections from external to the enclosure via the modules rather than internal cabling.
    Type: Application
    Filed: January 27, 2004
    Publication date: July 28, 2005
    Applicant: Hewlett-Packard Development Company, L.P.
    Inventors: Michael Wortman, Brendan Voge
  • Publication number: 20050154869
    Abstract: A partitionable computer system and method of operating the same is disclosed. The partitionable computer system has a state machine, a processor, and a device controller. The state machine can be configured to monitor the status of a partition of the partitionable computer system. The information provided by the state machine can be used to provide security within the partitionable computing system.
    Type: Application
    Filed: January 12, 2004
    Publication date: July 14, 2005
    Inventors: Mark Shaw, Vipul Gandhi, Leon Hong, Gary Gostin, Craig Warner, Paul Bouchier, Todd Kjos, Guy Kuntz, Richard Powers, Bryan Stephenson, Ryan Weaver, Brian Johnson, Glen Edwards, Brendan Voge, Gregg Lesartre
  • Publication number: 20010001873
    Abstract: A cache memory replacement algorithm replaces cache lines based on the likelihood that cache lines will not be needed soon. A cache memory in accordance with the present invention includes a plurality of cache lines that are accessed associatively, with a count entry associated with each cache line storing a count value that defines a replacement class. The count entry is typically loaded with a count value when the cache line is accessed, with the count value indicating the likelihood that the contents of cache lines will be needed soon. In other words, data which is likely to be needed soon is assigned a higher replacement class, while data that is more speculative and less likely to be needed soon is assigned a lower replacement class. When the cache memory becomes full, the replacement algorithm selects for replacement those cache lines having the lowest replacement class.
    Type: Application
    Filed: July 31, 1998
    Publication date: May 24, 2001
    Applicant: HEWLETT-PACKARD COMPANY
    Inventors: JOHN A. WICKERAAD, STEPHEN B. LYLE, BRENDAN VOGE