International Business Machines Corporation

Globalfoundries Inc.

Hans Boettiger

Thilo Maurer

Malcolm Scott Ware

Charles Robert Lefurgy

Martin Ohmacht

Wesley Michael Felter

Kai-Ting Amy Wang

Yaoqing Gao

Peter Altevogt

David J Sudlik

Graham W Ewart

James T Mulvey

Lutz Stiege

Patricia A Healy

Gregory T Reid

Code versioning for enabling transactional memory region promotion may include receiving a portion of candidate source code; outlining the portion of candidate source code received for parallel execution; wrapping a critical region with entry and exit routines to enter into a speculation sub-process, wherein the entry and exit routines also gather conflict statistics at run time; and generating an outlined code portion comprising multiple loop versions using a processor.

Code versioning for enabling transactional memory promotion

A computer implemented method for prefetching data for a processor into a first memory, wherein in a recording mode, a prefetching unit for a processor performs the steps of a method. The method includes: receiving one or more first addresses from the processor; filtering the one or more first addresses; providing a recording-list including the filtered one or more first addresses; receiving at least one second address from the processor; receiving a playback-list including all or a subset of the first addresses of the recording-list; comparing the at least one second address with each of the first addresses in the playback-list for identifying a matching address; if a matching address is identified, fetching data from a second memory; and transferring the fetched data to a first memory.

List-based prefetching

A computer implemented method for prefetching data. The method includes: receiving one or more addresses by a prefetching unit upon execution of an enqueuing command in a first piece of program logic; enqueuing each of the received addresses to a recording-list; identifying one of the positions in the recording-list as jump position; providing the identified jump position to a frame-shifter; using a sub-list of the recording-list defined by a shiftable frame as a playback-list; executing a frame-shift command which triggers the frame-shifter to shift the frame in dependence on the jump position to provide an updated playback-list; fetching data identified by the updated playback-list from a second memory; and transferring the fetched data to a first memory.

Processor instruction based data prefetching

A method for autonomous dynamic voltage (v) and frequency (f) scaling (DVFS) of a microprocessor, wherein autonomous detection of phases of high microprocessor workload and prediction of their duration is performed (PID). The microprocessor frequency (f) will be temporarily increased (LUT) to an appropriate safe value (even beyond its nominal frequency) consistent with technological and ambient constraints in order to improve performance when the computer system comprising the microprocessor benefits most, while during phases of low microprocessor workload its frequency (f) and voltage (v) will be decreased to save energy. This technique exploits hidden performance capabilities and improves the total performance of a computer system without compromising operational stability. No additional hardware such as service processors is needed for contemporary computer systems supporting performance counters and DFVS already. The invention allows significantly increasing the total computer system performance with only minimal impact on power (P, P) consumption.

Method for autonomous dynamic voltage and frequency scaling of microprocessors

A method is disclosed for instructing a computing system to unwind a program call stack that lacks explicit Stack Frame Backchain Pointers, including finding the called function's entry point, determining the return point in the calling function, placing a NOP instruction at the return point that contains embedded information about what type of call was used, and backing up in storage by an amount determined by using the address of the called function's entry point to locate the static data item containing the called function's DSA size.

Method for unwinding a program call stack

Growing community of inventors

Tuebingen, Germany

Hans Boettiger