- •Contents
- •List of Figures
- •List of Tables
- •Acknowledgments
- •Introduction to MPI
- •Overview and Goals
- •Background of MPI-1.0
- •Background of MPI-1.1, MPI-1.2, and MPI-2.0
- •Background of MPI-1.3 and MPI-2.1
- •Background of MPI-2.2
- •Who Should Use This Standard?
- •What Platforms Are Targets For Implementation?
- •What Is Included In The Standard?
- •What Is Not Included In The Standard?
- •Organization of this Document
- •MPI Terms and Conventions
- •Document Notation
- •Naming Conventions
- •Semantic Terms
- •Data Types
- •Opaque Objects
- •Array Arguments
- •State
- •Named Constants
- •Choice
- •Addresses
- •Language Binding
- •Deprecated Names and Functions
- •Fortran Binding Issues
- •C Binding Issues
- •C++ Binding Issues
- •Functions and Macros
- •Processes
- •Error Handling
- •Implementation Issues
- •Independence of Basic Runtime Routines
- •Interaction with Signals
- •Examples
- •Point-to-Point Communication
- •Introduction
- •Blocking Send and Receive Operations
- •Blocking Send
- •Message Data
- •Message Envelope
- •Blocking Receive
- •Return Status
- •Passing MPI_STATUS_IGNORE for Status
- •Data Type Matching and Data Conversion
- •Type Matching Rules
- •Type MPI_CHARACTER
- •Data Conversion
- •Communication Modes
- •Semantics of Point-to-Point Communication
- •Buffer Allocation and Usage
- •Nonblocking Communication
- •Communication Request Objects
- •Communication Initiation
- •Communication Completion
- •Semantics of Nonblocking Communications
- •Multiple Completions
- •Non-destructive Test of status
- •Probe and Cancel
- •Persistent Communication Requests
- •Send-Receive
- •Null Processes
- •Datatypes
- •Derived Datatypes
- •Type Constructors with Explicit Addresses
- •Datatype Constructors
- •Subarray Datatype Constructor
- •Distributed Array Datatype Constructor
- •Address and Size Functions
- •Lower-Bound and Upper-Bound Markers
- •Extent and Bounds of Datatypes
- •True Extent of Datatypes
- •Commit and Free
- •Duplicating a Datatype
- •Use of General Datatypes in Communication
- •Correct Use of Addresses
- •Decoding a Datatype
- •Examples
- •Pack and Unpack
- •Canonical MPI_PACK and MPI_UNPACK
- •Collective Communication
- •Introduction and Overview
- •Communicator Argument
- •Applying Collective Operations to Intercommunicators
- •Barrier Synchronization
- •Broadcast
- •Example using MPI_BCAST
- •Gather
- •Examples using MPI_GATHER, MPI_GATHERV
- •Scatter
- •Examples using MPI_SCATTER, MPI_SCATTERV
- •Example using MPI_ALLGATHER
- •All-to-All Scatter/Gather
- •Global Reduction Operations
- •Reduce
- •Signed Characters and Reductions
- •MINLOC and MAXLOC
- •All-Reduce
- •Process-local reduction
- •Reduce-Scatter
- •MPI_REDUCE_SCATTER_BLOCK
- •MPI_REDUCE_SCATTER
- •Scan
- •Inclusive Scan
- •Exclusive Scan
- •Example using MPI_SCAN
- •Correctness
- •Introduction
- •Features Needed to Support Libraries
- •MPI's Support for Libraries
- •Basic Concepts
- •Groups
- •Contexts
- •Intra-Communicators
- •Group Management
- •Group Accessors
- •Group Constructors
- •Group Destructors
- •Communicator Management
- •Communicator Accessors
- •Communicator Constructors
- •Communicator Destructors
- •Motivating Examples
- •Current Practice #1
- •Current Practice #2
- •(Approximate) Current Practice #3
- •Example #4
- •Library Example #1
- •Library Example #2
- •Inter-Communication
- •Inter-communicator Accessors
- •Inter-communicator Operations
- •Inter-Communication Examples
- •Caching
- •Functionality
- •Communicators
- •Windows
- •Datatypes
- •Error Class for Invalid Keyval
- •Attributes Example
- •Naming Objects
- •Formalizing the Loosely Synchronous Model
- •Basic Statements
- •Models of Execution
- •Static communicator allocation
- •Dynamic communicator allocation
- •The General case
- •Process Topologies
- •Introduction
- •Virtual Topologies
- •Embedding in MPI
- •Overview of the Functions
- •Topology Constructors
- •Cartesian Constructor
- •Cartesian Convenience Function: MPI_DIMS_CREATE
- •General (Graph) Constructor
- •Distributed (Graph) Constructor
- •Topology Inquiry Functions
- •Cartesian Shift Coordinates
- •Partitioning of Cartesian structures
- •Low-Level Topology Functions
- •An Application Example
- •MPI Environmental Management
- •Implementation Information
- •Version Inquiries
- •Environmental Inquiries
- •Tag Values
- •Host Rank
- •IO Rank
- •Clock Synchronization
- •Memory Allocation
- •Error Handling
- •Error Handlers for Communicators
- •Error Handlers for Windows
- •Error Handlers for Files
- •Freeing Errorhandlers and Retrieving Error Strings
- •Error Codes and Classes
- •Error Classes, Error Codes, and Error Handlers
- •Timers and Synchronization
- •Startup
- •Allowing User Functions at Process Termination
- •Determining Whether MPI Has Finished
- •Portable MPI Process Startup
- •The Info Object
- •Process Creation and Management
- •Introduction
- •The Dynamic Process Model
- •Starting Processes
- •The Runtime Environment
- •Process Manager Interface
- •Processes in MPI
- •Starting Processes and Establishing Communication
- •Reserved Keys
- •Spawn Example
- •Manager-worker Example, Using MPI_COMM_SPAWN.
- •Establishing Communication
- •Names, Addresses, Ports, and All That
- •Server Routines
- •Client Routines
- •Name Publishing
- •Reserved Key Values
- •Client/Server Examples
- •Ocean/Atmosphere - Relies on Name Publishing
- •Simple Client-Server Example.
- •Other Functionality
- •Universe Size
- •Singleton MPI_INIT
- •MPI_APPNUM
- •Releasing Connections
- •Another Way to Establish MPI Communication
- •One-Sided Communications
- •Introduction
- •Initialization
- •Window Creation
- •Window Attributes
- •Communication Calls
- •Examples
- •Accumulate Functions
- •Synchronization Calls
- •Fence
- •General Active Target Synchronization
- •Lock
- •Assertions
- •Examples
- •Error Handling
- •Error Handlers
- •Error Classes
- •Semantics and Correctness
- •Atomicity
- •Progress
- •Registers and Compiler Optimizations
- •External Interfaces
- •Introduction
- •Generalized Requests
- •Examples
- •Associating Information with Status
- •MPI and Threads
- •General
- •Initialization
- •Introduction
- •File Manipulation
- •Opening a File
- •Closing a File
- •Deleting a File
- •Resizing a File
- •Preallocating Space for a File
- •Querying the Size of a File
- •Querying File Parameters
- •File Info
- •Reserved File Hints
- •File Views
- •Data Access
- •Data Access Routines
- •Positioning
- •Synchronism
- •Coordination
- •Data Access Conventions
- •Data Access with Individual File Pointers
- •Data Access with Shared File Pointers
- •Noncollective Operations
- •Collective Operations
- •Seek
- •Split Collective Data Access Routines
- •File Interoperability
- •Datatypes for File Interoperability
- •Extent Callback
- •Datarep Conversion Functions
- •Matching Data Representations
- •Consistency and Semantics
- •File Consistency
- •Random Access vs. Sequential Files
- •Progress
- •Collective File Operations
- •Type Matching
- •Logical vs. Physical File Layout
- •File Size
- •Examples
- •Asynchronous I/O
- •I/O Error Handling
- •I/O Error Classes
- •Examples
- •Subarray Filetype Constructor
- •Requirements
- •Discussion
- •Logic of the Design
- •Examples
- •MPI Library Implementation
- •Systems with Weak Symbols
- •Systems Without Weak Symbols
- •Complications
- •Multiple Counting
- •Linker Oddities
- •Multiple Levels of Interception
- •Deprecated Functions
- •Deprecated since MPI-2.0
- •Deprecated since MPI-2.2
- •Language Bindings
- •Overview
- •Design
- •C++ Classes for MPI
- •Class Member Functions for MPI
- •Semantics
- •C++ Datatypes
- •Communicators
- •Exceptions
- •Mixed-Language Operability
- •Problems With Fortran Bindings for MPI
- •Problems Due to Strong Typing
- •Problems Due to Data Copying and Sequence Association
- •Special Constants
- •Fortran 90 Derived Types
- •A Problem with Register Optimization
- •Basic Fortran Support
- •Extended Fortran Support
- •The mpi Module
- •No Type Mismatch Problems for Subroutines with Choice Arguments
- •Additional Support for Fortran Numeric Intrinsic Types
- •Language Interoperability
- •Introduction
- •Assumptions
- •Initialization
- •Transfer of Handles
- •Status
- •MPI Opaque Objects
- •Datatypes
- •Callback Functions
- •Error Handlers
- •Reduce Operations
- •Addresses
- •Attributes
- •Extra State
- •Constants
- •Interlanguage Communication
- •Language Bindings Summary
- •Groups, Contexts, Communicators, and Caching Fortran Bindings
- •External Interfaces C++ Bindings
- •Change-Log
- •Bibliography
- •Examples Index
- •MPI Declarations Index
- •MPI Function Index
448 |
CHAPTER 13. I/O |
1In addition, calls to routines in this chapter may raise errors in other MPI classes, such
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
as MPI_ERR_TYPE.
MPI_ERR_FILE
MPI_ERR_NOT_SAME
MPI_ERR_AMODE
MPI_ERR_UNSUPPORTED_DATAREP
MPI_ERR_UNSUPPORTED_OPERATION
MPI_ERR_NO_SUCH_FILE
MPI_ERR_FILE_EXISTS
MPI_ERR_BAD_FILE
MPI_ERR_ACCESS
MPI_ERR_NO_SPACE
MPI_ERR_QUOTA
MPI_ERR_READ_ONLY
MPI_ERR_FILE_IN_USE
MPI_ERR_DUP_DATAREP
MPI_ERR_CONVERSION
MPI_ERR_IO
Invalid le handle
Collective argument not identical on all processes, or collective routines called in a di erent order by di erent processes Error related to the amode passed to
MPI_FILE_OPEN
Unsupported datarep passed to
MPI_FILE_SET_VIEW
Unsupported operation, such as seeking on a le which supports sequential access only File does not exist
File exists
Invalid le name (e.g., path name too long) Permission denied
Not enough space Quota exceeded
Read-only le or le system
File operation could not be completed, as the le is currently open by some process Conversion functions could not be registered because a data representation identi-er that was already de ned was passed to
MPI_REGISTER_DATAREP
An error occurred in a user supplied data conversion function.
Other I/O error
Table 13.3: I/O Error Classes
34 |
13.9 |
Examples |
|
|
|
35 |
|
|
36 |
13.9.1 |
Double Bu ering with Split Collective I/O |
37
This example shows how to overlap computation and output. The computation is performed
38
by the function compute_buffer().
39
40/*=========================================================================
41*
42
43
44
45
46
47
48
* |
Function: |
double_buffer |
* |
|
|
*Synopsis:
*void double_buffer(
* |
MPI_File fh, |
** IN |
|
* |
MPI_Datatype buftype, |
** |
IN |
* |
int bufcount |
** |
IN |
13.9. EXAMPLES |
449 |
*)
*Description:
*Performs the steps to overlap computation with a collective write
*by using a double-buffering technique.
* |
|
|
|
* |
Parameters: |
|
|
* |
fh |
previously opened MPI file handle |
|
* |
buftype |
MPI datatype for memory layout |
|
* |
|
(Assumes a compatible view has been set on fh) |
|
* |
bufcount |
# buftype elements to transfer |
|
* |
------------------------------------------------------------------------ |
|
*/ |
/* |
this macro switches which buffer "x" is pointing to */ |
||
#define TOGGLE_PTR(x) (((x)==(buffer1)) ? (x=buffer2) : (x=buffer1)) |
|||
void double_buffer( MPI_File |
fh, MPI_Datatype buftype, int bufcount) |
||
{ |
|
|
|
|
MPI_Status status; |
|
/* status for MPI calls */ |
|
float *buffer1, *buffer2; |
/* buffers to hold results */ |
|
|
float *compute_buf_ptr; |
|
/* destination buffer */ |
|
|
|
/* for computing */ |
|
float *write_buf_ptr; |
|
/* source for writing */ |
|
int done; |
|
/* determines when to quit */ |
/* buffer initialization */ buffer1 = (float *)
malloc(bufcount*sizeof(float)) ;
buffer2 = (float *)
|
malloc(bufcount*sizeof(float)) ; |
|
|
compute_buf_ptr |
= buffer1 ; |
/* initially point to |
buffer1 */ |
write_buf_ptr |
= buffer1 ; |
/* initially point to |
buffer1 */ |
/* DOUBLE-BUFFER prolog: |
|
|
|
* compute buffer1; then initiate writing buffer1 |
to disk |
||
*/ |
|
|
|
compute_buffer(compute_buf_ptr, bufcount, &done); |
|
||
MPI_File_write_all_begin(fh, write_buf_ptr, bufcount, buftype); |
|||
/* DOUBLE-BUFFER steady state: |
|
|
|
* Overlap writing old results from buffer pointed |
to by write_buf_ptr |
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
*with computing new results into buffer pointed to by compute_buf_ptr. 44
*
*There is always one write-buffer and one compute-buffer in use
*during steady state.
*/
45
46
47
48
1
2
3
450 |
CHAPTER 13. I/O |
while (!done) {
TOGGLE_PTR(compute_buf_ptr);
compute_buffer(compute_buf_ptr, bufcount, &done);
4MPI_File_write_all_end(fh, write_buf_ptr, &status);
5TOGGLE_PTR(write_buf_ptr);
6MPI_File_write_all_begin(fh, write_buf_ptr, bufcount, buftype);
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
}
/* DOUBLE-BUFFER epilog:
* wait for final write to complete. */
MPI_File_write_all_end(fh, write_buf_ptr, &status);
/* buffer cleanup */ free(buffer1); free(buffer2);
}
13.9.2 Subarray Filetype Constructor
|
|
|
|
|
|
|
|
|
|
|
Process 0 |
|
|
|
Process 2 |
||
|
|
|
|
|
||||
|
|
|
|
|
|
|
|
|
34 |
|
Process 1 |
|
Process 3 |
35 |
|
|
|
|
36
37
Figure 13.4: Example array le layout
38Assume we are writing out a 100x100 2D array of double precision oating point num-
39bers that is distributed among 4 processes such that each process has a block of 25 columns
40(e.g., process 0 has columns 0-24, process 1 has columns 25-49, etc.; see Figure 13.4). To
41create the letypes for each process one could use the following C program (see Section 4.1.3
42on page 87):
43
double subarray[100][25];
44
MPI_Datatype filetype;
45
int sizes[2], subsizes[2], starts[2];
46
int rank;
47
48
13.9. EXAMPLES |
451 |
|||
|
|
|
|
|
|
|
|
|
|
|
MPI_DOUBLE |
|
|
|
Holes |
|
|
|
|
||
|
|
|
|
|
|
Figure 13.5: Example local array letype for process 1
MPI_Comm_rank(MPI_COMM_WORLD, &rank); sizes[0]=100; sizes[1]=100; subsizes[0]=100; subsizes[1]=25; starts[0]=0; starts[1]=rank*subsizes[1];
MPI_Type_create_subarray(2, sizes, subsizes, starts, MPI_ORDER_C, MPI_DOUBLE, &filetype);
Or, equivalently in Fortran:
double precision subarray(100,25) integer filetype, rank, ierror
integer sizes(2), subsizes(2), starts(2)
call MPI_COMM_RANK(MPI_COMM_WORLD, rank, ierror) sizes(1)=100
sizes(2)=100
subsizes(1)=100
subsizes(2)=25
starts(1)=0
starts(2)=rank*subsizes(2)
call MPI_TYPE_CREATE_SUBARRAY(2, sizes, subsizes, starts, & MPI_ORDER_FORTRAN, MPI_DOUBLE_PRECISION, & filetype, ierror)
The generated letype will then describe the portion of the le contained within the process's subarray with holes for the space taken by the other processes. Figure 13.5 shows the letype created for process 1.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
452 |
CHAPTER 13. I/O |
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48