ANALYZING UPDATE CONDITIONS FOR SHARED VARIABLE DIRECTORY INFORMATION IN A PARALLEL COMPUTER

• US 20140173205A1
• Filed: 02/13/2013
• Published: 06/19/2014
• Est. Priority Date: 12/18/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: ARCHER, CHARLES J., CAREY, JAMES E., SANDERS, PHILIP J., SMITH, BRIAN E.
• Granted Patent: US 9,262,243 B2
• Time in Patent Office: Days
• US Class Current: 711/121
• CPC Class Codes: G06F 2209/547 Messaging middleware
• CPC Class Codes: G06F 8/453 Data distribution
• CPC Class Codes: G06F 9/544 Buffers; Shared memory; Pipes
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

Methods, parallel computers, and computer program products for analyzing update conditions for shared variable directory (SVD) information in a parallel computer are provided. Embodiments include a runtime optimizer receiving a compare-and-swap operation header. The compare-and-swap operation header includes an SVD key, a first SVD address, and an updated first SVD address. The first SVD address is associated with the SVD key in a first SVD associated with a first task. Embodiments also include the runtime optimizer retrieving from a remote address cache associated with the second task, a second SVD address indicating a location within a memory partition associated with the first SVD in response to receiving the compare-and-swap operation header. Embodiments also include the runtime optimizer determining whether the second SVD address matches the first SVD address and transmitting a result indicating whether the second SVD address matches the first SVD address.

Claims

1. A method of analyzing update conditions for shared variable directory (SVD) information in a parallel computer, the parallel computer comprising a plurality of threads of execution, the threads organized into tasks, the parallel computer further comprising memory partitioned to provide each thread with a private memory and a shared memory, the method comprising:

receiving, by a runtime optimizer of a second task, a compare-and-swap operation header, the compare-and-swap operation header including an SVD key, a first SVD address, and an updated first SVD address, wherein the first SVD address is associated with the SVD key in a first SVD associated with a first task;

in response to receiving the compare-and-swap operation header, retrieving from a remote address cache associated with the second task, by the runtime optimizer, a second SVD address indicating a location within a memory partition associated with the first SVD;

determining, by the runtime optimizer, whether the second SVD address matches the first SVD address; and

transmitting, by the runtime optimizer, a result indicating whether the second SVD address matches the first SVD address.

2. The method of claim 1 further comprising:

receiving from a plurality of threads, other results, each result indicating whether an SVD address associated with the SVD key in a particular remote address cache associated with a particular task matches the first SVD address;

if the results indicate that at least one of the SVD addresses does not match the first SVD address, updating, by the runtime optimizer, the remote address cache of the second task such that a previously sum-checked SVD address is used to correspond with the SVD key within the remote address cache of the second task; and

if the results indicate that all of the SVD addresses match the first SVD address, updating, by the runtime optimizer, the remote address cache of the second task such that the updated first SVD address is used to correspond with the SVD key within the remote address cache.

3. The method of claim 1 further comprising creating, by the runtime optimizer, an individual compare-and-swap operation message header for each entry of the second SVD.

4. The method of claim 3 wherein creating an individual compare-and-swap operation message header for each entry of the second SVD includes selecting a header type and data schedule for each individual compare-and-swap operation message header.

5. The method of claim 1 further comprising broadcasting to the plurality of threads, by the runtime optimizer, the compare-and-swap operation message header.

6. The method of claim 5 wherein broadcasting to the plurality of threads, by the runtime optimizer, the compare-and-swap operation message header includes transmitting an active message using a parallel active message interface (PAMI).

7-20. -20. (canceled)