International Business Machines Corporation

Samsung Electronics Co., Ltd.

International Business Corporation

Andrew Thomas Tauferner

Thomas M Gooding

Todd Alan Inglett

Michael E Aho

Cory Lappi

Ruth Janine Poole

Brant L Knudson

Michael B Mundy

Dong Chen

Philip Heidelberger

Noel A Eisley

Russel Roy Garvey

Mark Gregory Megerian

Josep Cors

Kyle Alan Lucke

Andrew T Koch

Leon Edward Gregg

Clifton Malcolm Nock

Eric G Thiemann

James Lawrence Tilbury

Tanveer Zubair

Randall Scott Nelson

Daniel Joseph Strauss

Frances E Stewart

James Loo

Douglas Joseph

Thomas Leo Haze

Scott J Timmerman

Rolf Riesen

Matthew Wolf

Robert Wisniewski

David Lombard

Anthony Martin Mueller

Robert Peter Crowley

Lisa Shaine-Marie Wellman

Jai Dayal

A method to address memory in nodes of a distributed memory system includes partitioning the memory in each node into one or more memory blocks available for a global memory pool. The method also includes combining, in response to a request to address memory in the global memory pool, a global bit from a global page table with a physical address to generate a global virtual address. The global bit indicates whether the memory is local or remote. The method also includes translating, using global access tuple (GAT) tables, the global virtual address to a global physical address, and addressing a memory block in the global memory pool based on the global physical address.

Very large address space using extended page tables

Determining instruction execution history in a debugger, including: retrieving, from an instruction cache, cache data that includes an age value for each cache line in the instruction cache; sorting, by the age value for each cache line, entries in the instruction cache; retrieving, using an address contained in each cache line, one or more instructions associated with the address contained in each cache line; and displaying the one or more instructions.

Determining instruction execution history in a debugger

Method, system, and computer program product for randomizing entropy on a parallel computing system using network arithmetic logic units (ALUs). In one embodiment, network ALUs on nodes of the parallel computing system pseudorandomly modify entropy data during broadcast operations through application of arithmetic and/or logic operations. That is, each compute node's ALU may modify the entropy data during broadcasts, thereby mixing, and thus improving, the entropy data with every hop of entropy data packets from one node to another. At each compute node, the respective ALUs may further deposit modified entropy data in, e.g., local entropy pools such that software running on the compute nodes and needing entropy data may fetch it from the entropy pools. In some embodiments, entropy data may be broadcast via dedicated packets or included in unused portions of existing broadcast packets.

Method of entropy randomization on a parallel computer

Method for performing an operation, the operation including, responsive to receiving a file system request at a file system, retrieving a first entropy pool element from the file system, and inserting, at the file system, the first entropy pool element into a network packet sent from the file system responsive to the file system request.

Method of entropy distribution on a parallel computer

Method, system, and computer program product for performing an operation, the operation including, responsive to receiving a file system request at a file system, retrieving a first entropy pool element from the file system, and inserting, at the file system, the first entropy pool element into a network packet sent from the file system responsive to the file system request.

Calculating a checksum utilizing inactive networking components in a computing system, including: identifying, by a checksum distribution manager, an inactive networking component, wherein the inactive networking component includes a checksum calculation engine for computing a checksum; sending, to the inactive networking component by the checksum distribution manager, metadata describing a block of data to be transmitted by an active networking component; calculating, by the inactive networking component, a checksum for the block of data; transmitting, to the checksum distribution manager from the inactive networking component, the checksum for the block of data; and sending, by the active networking component, a data communications message that includes the block of data and the checksum for the block of data.

Calculating a checksum with inactive networking components in a computing system

Remote direct memory access ('RDMA') in a parallel computer, the parallel computer including a plurality of nodes, each node including a messaging unit, including: receiving an RDMA read operation request that includes a virtual address representing a memory region at which to receive data to be transferred from a second node to the first node; responsive to the RDMA read operation request: translating the virtual address to a physical address; creating a local RDMA object that includes a counter set to the size of the memory region; sending a message that includes an DMA write operation request, the physical address of the memory region on the first node, the physical address of the local RDMA object on the first node, and a remote virtual address on the second node; and receiving the data to be transferred from the second node.

Remote direct memory access ('RDMA') in a parallel computer

A method for persistent data storage on a computer system with a kernel by retrieving configuration information regarding a system operation request and then deciding based on the configuration information whether to execute it with special persistent storage or to not do so. The configuration information may be stored on a central node or may be encoded onto any of the nodes. The special persistent storage may be a database. The method may further be implemented by a computer program product. It also may be implemented on a computer system.

Configurable persistent storage on a computer system using a database

Power throttling may be used to conserve power and reduce heat in a parallel computing environment. Compute nodes in the parallel computing environment may be organized into groups based on, for example, whether they execute tasks of the same job or receive power from the same converter. Once one of compute nodes in the group detects that a parameter (i.e., temperature, current, power consumption, etc.) has exceeded a first threshold, power throttling on all the nodes in the group may be activated. However, before deactivating power throttling, a plurality of parameters associated with the group of compute nodes may be monitored to ensure they are all below a second threshold. If so, the power throttling for all of the compute nodes is deactivated.

Adaptive recovery for parallel reactive power throttling

A parallel computer system adds entropy to improve the quality of random number generation by using parity errors as a source of entropy because parity errors are influenced by external forces such as cosmic ray bombardment, alpha particle emission, and other random or near-random events. By using parity errors and associated information to generate entropy, the quality of random number generation in a parallel computer system is increased.

Adding entropy for improved random number generation in a computer system

Growing community of inventors

Rochester, MN, United States of America

Andrew Thomas Tauferner