International Business Machines Corporation

Globalfoundries Inc.

Jeffrey A Stuecheli

Guy L Guthrie

William John Starke

Derek E Williams

Benjiman L Goodman

Michael Steven Siegel

Eric Eugene Retter

Bartholomew Blaner

Stephen J Powell

James Stephen Fields, Jr

John Steven Dodson

Hugh Shen

Lakshminarayana Baba Arimilli

Bernard Charles Drerup

Charles Francis Marino

Robert H Bell, Jr

Jody B Joyner

Phillip G Williams

John David Irish

Karthick Rajamani

Hillery C Hunter

David Michael Daly

Mark Andrew Brittain

David John Krolak

Aaron Christoph Sawdey

Warren Edward Maule

Ganesh Balakrishnan

Kenneth Michael Valk

Praveen S Reddy

Lonny Lambrecht

Leo James Clark

Ronald Nick Kalla

Paul Allen Ganfield

Francis Patrick O'Connell

Michael Stephen Floyd

William Eric Hall

Robert Alan Cargnoni

John Bruce Carter

Robert Christopher Dixon

Miles Robert Dooley

Richard Nicholas

John J Reilly

David W Cummings

John Thomas Hollaway, Jr

Malcolm Scott Ware

Bruce Gerard Mealey

Sanjeev Ghai

Bradly George Frey

Gregory Scott Still

Jentje Leenstra

Guerney D H Hunt

John Barry Griswell, Jr

Thomas L Jeremiah

Ram Raghavan

Vicente Enrique Chung

Paul Mackerras

Jay Gerald Heaslip

Hung Qui Le

Steven R Carlough

Bulent Abali

Bryan J Lloyd

Brian King Flachs

Peter Anthony Sandon

Piyush Chunilal Patel

Brian Thomas Vanderpool

Steven Leonard Roberts

Charles David Wait

Hien Le

Thomas R Puzak

Jie Zheng

Curtis Carl Wollbrink

David A Campbell

Kenneth Anthony Lauricella

Yiftach Benjamini

Jason Nathaniel Dale

Albert Thomas Williams

Frederick Jacob Ziegler

Didier R Louis

Jonathan R Jackson

Daniel Mark Dreps

Charles Ray Johns

Daniel Christopher Worledge

John Kenneth DeBrosse

Richard James Eickemeyer

David Allen Hrusecky

Eric N Lais

Richard Loise Arndt

Jason Frederick Cantin

Yaoqing Gao

Robert Dov Herzl

Joab Daniel Henderson

Robert Allen Cordes

James Francis Mikos

Kimberly Marie Fernsler

Alvan Wing Ng

Etai Adar

George William Daly, Jr

Steven Powell

Luke Murray

Michael James Mack

A destination host includes a processor core, a system fabric, a memory system, and a link controller communicatively coupled to the system fabric and configured to be communicatively coupled, via a communication link, to a source host with which the destination host is non-coherent. The destination host migrates, via the communication link, a state of a logical partition from the source host to the destination host and page table entries for translating addresses of a dataset of the logical partition from the source host to the destination host. After migrating the state and page table entries, the destination host initiates execution of the logical partition on the processor core while at least a portion of the dataset of the logical partition resides in the memory system of the source host and migrates, via the communication link, the dataset of the logical partition to the memory system of the destination host.

Memory migration within a multi-host data processing environment

A system and method for managing energy consumption of one or more processor cores in a multicore processing device. The method includes translating each activity level of the one or more processor cores to a respective charge value. The method also includes generating, at least partially subject to each translated charge value, one or more charge replenishment requests associated with the one or more processor cores. The method further includes transmitting the one or more charge replenishment requests to a pending queue prior to a delay queue.

Current prediction-based instruction throttling control

A processing unit includes a processor core and an associated cache memory. The cache memory establishes a reservation of a hardware thread of the processor core for a store target address and services a store-conditional request of the processor core by conditionally updating the shared memory with store data based on the whether the hardware thread has a reservation for the store target address. The cache memory receives a hint associated with the store-conditional request indicating an intent of the store-conditional request. The cache memory protects the store target address against access by any conflicting memory access request during a protection window extension following servicing of the store-conditional request. The cache memory establishes a first duration for the protection window extension based on the hint having a first value and establishes a different second duration for the protection window extension based on the hint having a different second value.

Variable protection window extension for a target address of a store-conditional request

A system and method for managing energy consumption of one or more processor cores in a multicore processing device. The method includes recording an activity level of one or more processor cores within a multicore processing device and translating each activity level of the one or more processor cores to a respective charge value. The method also includes generating, at least partially subject to each translated charge value, one or more charge replenishment requests associated with the one or more processor cores. The method further includes determining the one or more charge replenishment requests exceeds a power delivery capacity to the multicore processing device. The method also includes regulating the processing activity of the one or more processor cores to decrease a power consumption for the one or more processing cores.

A coherent data processing system includes a system fabric communicatively coupling a plurality of coherence participants and fabric control logic. The fabric control logic quantifies congestion on the system fabric based on coherence messages associated with commands issued on the system fabric. Based on the congestion on the system fabric, the fabric control logic determines a rate of request issuance applicable to a set of coherence participants among the plurality of coherence participants. The fabric control logic issues at least one rate command to set a rate of request issuance to the system fabric of the set of coherence participants.

Controlling issue rates of requests of varying broadcast scopes in a data processing system

A data processing system includes system memory and a plurality of processor cores each supported by a respective one of a plurality of vertical cache hierarchies. A first vertical cache hierarchy records information indicating communication of cache lines between the first vertical cache hierarchy and others of the plurality of vertical cache hierarchies. Based on selection of a victim cache line for eviction, the first vertical cache hierarchy determines, based on the recorded information, whether to perform a lateral castout of the victim cache line to another of the plurality of vertical cache hierarchies rather than to system memory and selects, based on the recorded information, a second vertical cache hierarchy among the plurality of vertical cache hierarchies as a recipient of the victim cache line via a lateral castout. Based on the determination, the first vertical cache hierarchy performs a castout of the victim cache line.

Targeting of lateral castouts in a data processing system

A memory-referent instruction is executed to calculate a target effective address (EA) of a corresponding memory-referent request. An array entry in an upper level cache is allocated, and the EA is specified in a corresponding EA directory entry. While in-flight, the memory-referent request is buffered in a queue in association with a pointer to the entry in the EA directory. Based on receiving a translation invalidation request requesting invalidation of an address translation in a translation structure, the processor core walks the EA directory, determines the EA in the entry matches an address range specified by the translation invalidation request, and, based on the match, precisely marks the memory-referent request using the pointer to the EA directory entry. Based on the marking, the translation invalidation request is permitted to complete with reference to the processor core only after the memory-referent request has drained from the processing unit.

Marking in-flight requests affected by translation entry invalidation in a data processing system

A technique for operating a data processing system that implements a split transaction coherency protocol that has an address tenure and a data tenure includes receiving, at a data source, a command (that includes an address tenure for requested data) that is issued from a data sink. The data source issues a response that indicates data associated with the address tenure is available to be transferred to the data sink during a data tenure. In response to determining that the data is available subsequent to issuing the response, the data source issues a first data packet to the data sink that includes the data during the data tenure. In response to determining that the data is not available subsequent to issuing the response, the data source issues a second data packet to the data sink that includes a data header that indicates the data is unavailable.

Split transaction coherency protocol in a data processing system

In a data processing environment, a communication interface of a second host data processing system receives, from a first host data processing system, a host command in a first command set. The host command specifies a memory access to a memory coupled to the second host data processing system. The communication interface translates the host command into a command in a different second command set emulating coupling of an attached functional unit to the communication interface. The communication interface presents the second command to a host bus protocol interface of the second host data processing system. Based on receipt of the second command, the host bus protocol interface initiates, on a system fabric of the second host data processing system, a host bus protocol memory access request specifying the memory access.

Multifunction communication interface supporting memory sharing among data processing systems

A system and associated processes may perform a memory access operation that includes receiving a data packet comprising a command of a type of a plurality of types of commands. The processes may include initiating a decoding of a first portion of the command, and automatically speculating as to the type of the command. Based on the speculation as to the type of the command, a bank activate command may be generated before the data packet is entirely decoded or received.

Speculative bank activate dynamic random access memory (DRAM) scheduler

Translation lookaside buffer (TLB) invalidation using virtual addresses is provided. A cache is searched for a virtual address matching the input virtual address. Based on a matching virtual address in the cache, the corresponding cache entry is invalidated. The load/store queue is searched for a set and a way corresponding to the set and the way of the invalidated cache entry. Based on an entry in the load/store queue matching the set and the way of the invalidated cache entry, the entry in the load/store queue is marked as pending. Indicating a completion of the TLB invalidate instruction is delayed until all pending entries in the load/store queues are complete.

Dynamic translation lookaside buffer (TLB) invalidation using virtually tagged cache for load/store operations

An integrated circuit includes a first communication interface for communicatively coupling the integrated circuit with a coherent data processing system, a second communication interface for communicatively coupling the integrated circuit with an accelerator unit including an accelerator functional unit and an effective address-based accelerator cache for buffering copies of data from the system memory of the coherent data processing system, and a real address-based directory inclusive of contents of the accelerator cache. The real address-based directory assigns entries based on real addresses utilized to identify storage locations in the system memory. The integrated circuit includes request logic that, responsive to receipt on the first communication interface of a translation entry invalidation request, issues to the accelerator unit via the second communication interface an invalidation request that identifies an entry in the effective address-based accelerator cache to be invalidated utilizing a host tag identifying a storage location in the real address-based directory.

Translation invalidation in a translation cache serving an accelerator

An integrated circuit includes a first communication interface for communicatively coupling the integrated circuit with a coherent data processing system, a second communication interface for communicatively coupling the integrated circuit with an accelerator unit including an effective address-based accelerator cache for buffering copies of data from a system memory, and a real address-based directory inclusive of contents of the accelerator cache. The real address-based directory assigns entries based on real addresses utilized to identify storage locations in the system memory. The integrated circuit further includes request logic that communicates memory access requests and request responses with the accelerator unit. The request logic, responsive to receipt from the accelerator unit of a read-type request specifying an aliased second effective address of a target cache line, provides a request response including a host tag indicating that the accelerator unit has associated a different first effective address with the target cache line.

Integrated circuit and data processing system supporting address aliasing in an accelerator

A method, computer program product, and a computer system are disclosed for processing information in a processor that in one or more embodiments includes setting a threshold number of free Effective to Real Address Translation (ERAT) cache entries in an ERAT cache; determining whether a total number of free ERAT cache entries is less than or equal to the threshold number of free ERAT cache entries; allocating, in response to determining that the total number of free entries is less than or equal to the threshold number, one or more active ERAT cache entries to be speculatively checked in to a memory management unit (MMU); and speculatively checking in the one or more active ERAT cache entries to the MMU.

Speculative checkin of ERAT cache entries

Growing community of inventors

Austin, TX, United States of America

Jeffrey A Stuecheli