Patents by Inventor Harry Stefan Barowski

Harry Stefan Barowski 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: 6986027
    Abstract: This invention is a method and system for hybrid prediction of load addresses and/or values. The new scheme for value prediction provides prediction based on last values and strides, as well as context prediction, without the use of a sophisticated switching scheme between several predictors. The system collects patterns of deltas of subsequent values instead of the values itself in a first table. Thus, a last value prediction can be achieved by predicting a ‘pattern’ of just one stride equal to zero. A stride predictor uses a pattern of one constant stride. And a certain pattern of values is modeled by recording the pattern of deltas between the values and adding the deltas to the last value. The switching scheme is inherently included in the system itself and operates basically by immediate evaluation of counters in the pattern history table.
    Type: Grant
    Filed: May 24, 2001
    Date of Patent: January 10, 2006
    Assignee: International Business Machines Corporation
    Inventors: Harry Stefan Barowski, Rolf Hilgendorf
  • Patent number: 6968476
    Abstract: The present invention relates to data processing systems with built-in error recovery from a given checkpoint. In order to checkpoint more than one instruction per cycle it is proposed to collect updates of a predetermined maximum number of register contents performed by a respective plurality of CISC/RISC instructions in a buffer (CSB)(60) for checkpoint states, whereby a checkpoint state comprises as many buffer slots as registers can be updated by said plurality of CISC instructions and an entry for a Program Counter value associated with the youngest external instruction of said plurality, and to update an Architected Register Array (ARA)(64) with freshly collected register data after determining that no error was detected in the register data after completion of said youngest external instruction of said plurality of external instructions.
    Type: Grant
    Filed: June 26, 2002
    Date of Patent: November 22, 2005
    Assignee: International Business Machines Corporation
    Inventors: Harry Stefan Barowski, Hartmut Schwermer, Hans-Werner Tast
  • Publication number: 20030005265
    Abstract: The present invention relates to data processing systems with built-in error recovery from a given checkpoint. In order to checkpoint more than one instruction per cycle it is proposed to collect updates of a predetermined maximum number of register contents performed by a respective plurality of CISC/RISC instructions in a buffer (CSB)(60) for checkpoint states, whereby a checkpoint state comprises as many buffer slots as registers can be updated by said plurality of CISC instructions and an entry for a Program Counter value associated with the youngest external instruction of said plurality, and to update an Architected Register Array (ARA)(64) with freshly collected register data after determining that no error was detected in the register data after completion of said youngest external instruction of said plurality of external instructions.
    Type: Application
    Filed: June 26, 2002
    Publication date: January 2, 2003
    Applicant: International Business Machines Corporation
    Inventors: Harry Stefan Barowski, Hartmut Schwermer, Hans-Werner Tast
  • Publication number: 20020023204
    Abstract: This invention is a method and system for hybride prediction of load addresses and/or values. The new scheme for value prediction allows to predict last values, strides as well as values out of context without the use of a sophisticated switching scheme between several predictors. The system collects patterns of deltas of subsequent values instead of the values itself in a first table (40). Thus, a last value prediction can be achieved by predicting a ‘pattern’ of just one stride which is zero. A stride predictor uses a pattern of one constant stride. And a certain pattern of values is modelled by recording the pattern of deltas between the values and adding the deltas to the last value. The switching scheme inherently includes the system itself and operates basically by immediate evaluation of counters in the pattern history table (44).
    Type: Application
    Filed: May 24, 2001
    Publication date: February 21, 2002
    Applicant: International Business Machines Corporation
    Inventors: Harry Stefan Barowski, Rolf Hilgendorf