February 2011 - mpi-forum - mailman3.cels.anl.gov

March 28-30, 2011 meeting logistics
by Graham, Richard L. 23 Feb '11

23 Feb '11

Registration for the March meeting is on-line now. We did get a hotel block at the same Residence Inn downtown that we used last time. The nightly rate is $128, with a cutoff of March 9th. As a reminder, if you want meeting time, please let me know ï¿½ I will update the agenda as requests come in. Rich

1 0

slides from the meeting
by Jeff Squyres 21 Feb '11

21 Feb '11

Please send me any slides that you presented at the SJC meeting. Thanks! -- Jeff Squyres jsquyres(a)cisco.com For corporate legal information go to: http://www.cisco.com/web/about/doing_business/legal/cri/

1 0

Cisco building 1 today!
by Jeff Squyres (jsquyres) 09 Feb '11

09 Feb '11

Don't forget - we're in cisco building 1 today; *not* the same building as yesterday. Sent from my PDA. No type good.

1 0

Re: [Mpi-forum] No projector today
by Pavan Balaji 09 Feb '11

09 Feb '11

Argh! This is what I'll be presenting: https://svn.mpi-forum.org/trac/mpi-forum-web/attachment/wiki/MPI3Hybrid/ei-… On 02/09/2011 09:29 AM, Jeff Squyres wrote: > It appears that there is no projector in the meeting room today -- sorry! > > Whoever is presenting today, please ensure that your slides or text or whatever it is that you're presenting is available for everyone to download and view on their laptops. > > Thanks. > -- Pavan Balaji http://www.mcs.anl.gov/~balaji

1 0

No projector today
by Jeff Squyres 09 Feb '11

09 Feb '11

It appears that there is no projector in the meeting room today -- sorry! Whoever is presenting today, please ensure that your slides or text or whatever it is that you're presenting is available for everyone to download and view on their laptops. Thanks. -- Jeff Squyres jsquyres(a)cisco.com For corporate legal information go to: http://www.cisco.com/web/about/doing_business/legal/cri/

1 0

Re: [Mpi-forum] Sparse / neighborhood topology ticket 258
by Torsten Hoefler 09 Feb '11

09 Feb '11

Hello all, I just uploaded a new version to the ticket. This version includes all fixes I received from Jeff and Fab. Thank you very much for the reviews! Based on Rolf's comment, I added a longer description that clearly defines the order of elements in the send/recv buffers. https://svn.mpi-forum.org/trac/mpi-forum-web/ticket/258 Please review! Thanks & All the Best, Torsten -- bash$ :(){ :|:&};: --------------------- http://www.unixer.de/ ----- Torsten Hoefler | Performance Modeling and Simulation Lead Blue Waters Directorate | University of Illinois (UIUC) 1205 W Clark Street | Urbana, IL, 61801 NCSA Building | +01 (217) 244-7736

1 0

Re: [Mpi-forum] Sparse / neighborhood topology ticket 258
by Torsten Hoefler 09 Feb '11

09 Feb '11

Rolf, > please make a straw-vote-decision TODAY about the two variants > in this email. I myself prefer variant A. FYI: We had a discussion about this at the Forum and decided for various reasons for variant A. We also decided that the communication behaves exactly as a communication with MPI_PROC_NULL would. I.e., the buffers are not changed. > The current text does not include a precise definition of the > sequence of the neighbors. It is in the current draft (the part in brackets is pending a grammar-edit). For both operations, the sequence is clearly defined and variant A is implicit. We can make it more explicit but the definition right now is clear (variant A). I'll finish my pending edits and then we can see if we want to add more clarifying text. Best, Torsten > I recommend to add such a definition before the Rationale in Sect. 7.6. > > New text: > The sequence of the neighbors is defined > - in a Cartesian topology by the order of the dimensions, > and in each dimension, first the neighbor in the negative > direction and then in the positive direction with displacement 1. > If such a neighbor does not exist, i.e., at the border > in the case of a non-periodic virtual grid dimension > (i.e., periods[...]==false), then > (VARIANT A) > this neighbor is MPI_PROC_NULL and it is still part of the > sequence of neighbors, but the corresponding buffer portion > is not communicated. The values of indegree and outdegree > in the communication routines are 2*ndims with ndims defined > defined in MPI_CART_CREATE. > (VARIANT B) > this neighbor is not part of the sequence of neighbors. > The values of indegree and outdegree > in the communication routines are 2*ndims (with ndims defined > defined in MPI_CART_CREATE), reduced by the number of > non-existing neighbors. > (END OF VARIANTS) > The sequence of incoming and outgoing neighbors is identical. > - in a general graph topology, the sequence of neighbors > in each process is defined through the list of neighbors > for this process as defined in the arguments index and edges > in MPI_GRAPH_CREATE, which is identical to the sequence > returned by MPI_GRAPH_NEIGHBORS. > The values of indegree and outdegree in the communication > routines are identical to nneighbors returned by > MPI_GRAPH_NEIGHBOR_COUNT in each process for its own rank. > The sequence of incoming and outgoing neighbors is identical. > - in a distributed graph topology, the sequence of neighbors > in each process is returned by MPI_DIST_GRAPH_NEIGHBORS. > The values of indegree and outdegree in the communication > routines are identical to the values returned by > MPI_DIST_GRAPH_NEIGHBORS_COUNT. > If the distributed graph topology was created by > MPI_DIST_GRAPH_CREATE_ADJACENT, then the sequence > of incoming and outgoing neighbors is > identical to the sequence that was defined in > MPI_DIST_GRAPH_CREATE_ADJACENT. > > With this detailled definition, the following remark in parentheses > in 7.6.1 and 7.6.2 can be removed: > (the order of neighbors is returned by the neighborhood > query functions or for Cartesian communicators, it is in > the order of the dimensions, in each dimension first the > negative and then the positive direction) > > Torsten, please return the decision, Variant A or B. -- bash$ :(){ :|:&};: --------------------- http://www.unixer.de/ ----- Torsten Hoefler | Performance Modeling and Simulation Lead Blue Waters Directorate | University of Illinois (UIUC) 1205 W Clark Street | Urbana, IL, 61801 NCSA Building | +01 (217) 244-7736

1 0

Re: [Mpi-forum] Sparse / neighborhood topology ticket 258
by William Gropp 09 Feb '11

09 Feb '11

I also vote for variant A. Bill On Feb 9, 2011, at 6:10 AM, Rolf Rabenseifner wrote: > Dear all, > > please make a straw-vote-decision TODAY about the two variants > in this email. I myself prefer variant A. > > The current text does not include a precise definition of the > sequence of the neighbors. > I recommend to add such a definition before the Rationale in Sect. > 7.6. > > New text: > The sequence of the neighbors is defined > - in a Cartesian topology by the order of the dimensions, > and in each dimension, first the neighbor in the negative > direction and then in the positive direction with displacement 1. > If such a neighbor does not exist, i.e., at the border > in the case of a non-periodic virtual grid dimension > (i.e., periods[...]==false), then > (VARIANT A) > this neighbor is MPI_PROC_NULL and it is still part of the > sequence of neighbors, but the corresponding buffer portion > is not communicated. The values of indegree and outdegree > in the communication routines are 2*ndims with ndims defined > defined in MPI_CART_CREATE. > (VARIANT B) > this neighbor is not part of the sequence of neighbors. > The values of indegree and outdegree > in the communication routines are 2*ndims (with ndims defined > defined in MPI_CART_CREATE), reduced by the number of > non-existing neighbors. > (END OF VARIANTS) > The sequence of incoming and outgoing neighbors is identical. > - in a general graph topology, the sequence of neighbors > in each process is defined through the list of neighbors > for this process as defined in the arguments index and edges > in MPI_GRAPH_CREATE, which is identical to the sequence > returned by MPI_GRAPH_NEIGHBORS. > The values of indegree and outdegree in the communication > routines are identical to nneighbors returned by > MPI_GRAPH_NEIGHBOR_COUNT in each process for its own rank. > The sequence of incoming and outgoing neighbors is identical. > - in a distributed graph topology, the sequence of neighbors > in each process is returned by MPI_DIST_GRAPH_NEIGHBORS. > The values of indegree and outdegree in the communication > routines are identical to the values returned by > MPI_DIST_GRAPH_NEIGHBORS_COUNT. > If the distributed graph topology was created by > MPI_DIST_GRAPH_CREATE_ADJACENT, then the sequence > of incoming and outgoing neighbors is > identical to the sequence that was defined in > MPI_DIST_GRAPH_CREATE_ADJACENT. > > With this detailled definition, the following remark in parentheses > in 7.6.1 and 7.6.2 can be removed: > (the order of neighbors is returned by the neighborhood > query functions or for Cartesian communicators, it is in > the order of the dimensions, in each dimension first the > negative and then the positive direction) > > Torsten, please return the decision, Variant A or B. > > Best regards > Rolf > > > -- > Dr. Rolf Rabenseifner . . . . . . . . . .. email rabenseifner(a)hlrs.de > High Performance Computing Center (HLRS) . phone ++49(0)711/685-65530 > University of Stuttgart . . . . . . . . .. fax ++49(0)711 / 685-65832 > Head of Dpmt Parallel Computing . . . www.hlrs.de/people/rabenseifner > Nobelstr. 19, D-70550 Stuttgart, Germany . (Office: Allmandring 30) > _______________________________________________ > mpi-forum mailing list > mpi-forum(a)lists.mpi-forum.org > http://lists.mpi-forum.org/mailman/listinfo.cgi/mpi-forum William Gropp Deputy Director for Research Institute for Advanced Computing Applications and Technologies Paul and Cynthia Saylor Professor of Computer Science University of Illinois Urbana-Champaign

1 0

Re: [Mpi-forum] Sparse / neighborhood topology ticket 258
by Michael Raymond 09 Feb '11

09 Feb '11

I would vote for variant A as I think it's more consistent with the rest of the MPI standard and I think it'd be easier for application developers to use. Rolf Rabenseifner wrote: > Dear all, > > please make a straw-vote-decision TODAY about the two variants > in this email. I myself prefer variant A. > > The current text does not include a precise definition of the > sequence of the neighbors. > I recommend to add such a definition before the Rationale in Sect. 7.6. > > New text: > The sequence of the neighbors is defined > - in a Cartesian topology by the order of the dimensions, > and in each dimension, first the neighbor in the negative > direction and then in the positive direction with displacement 1. > If such a neighbor does not exist, i.e., at the border > in the case of a non-periodic virtual grid dimension > (i.e., periods[...]==false), then > (VARIANT A) > this neighbor is MPI_PROC_NULL and it is still part of the > sequence of neighbors, but the corresponding buffer portion > is not communicated. The values of indegree and outdegree > in the communication routines are 2*ndims with ndims defined > defined in MPI_CART_CREATE. > (VARIANT B) > this neighbor is not part of the sequence of neighbors. > The values of indegree and outdegree > in the communication routines are 2*ndims (with ndims defined > defined in MPI_CART_CREATE), reduced by the number of > non-existing neighbors. > (END OF VARIANTS) > The sequence of incoming and outgoing neighbors is identical. > - in a general graph topology, the sequence of neighbors > in each process is defined through the list of neighbors > for this process as defined in the arguments index and edges > in MPI_GRAPH_CREATE, which is identical to the sequence > returned by MPI_GRAPH_NEIGHBORS. > The values of indegree and outdegree in the communication > routines are identical to nneighbors returned by > MPI_GRAPH_NEIGHBOR_COUNT in each process for its own rank. > The sequence of incoming and outgoing neighbors is identical. > - in a distributed graph topology, the sequence of neighbors > in each process is returned by MPI_DIST_GRAPH_NEIGHBORS. > The values of indegree and outdegree in the communication > routines are identical to the values returned by > MPI_DIST_GRAPH_NEIGHBORS_COUNT. > If the distributed graph topology was created by > MPI_DIST_GRAPH_CREATE_ADJACENT, then the sequence > of incoming and outgoing neighbors is > identical to the sequence that was defined in > MPI_DIST_GRAPH_CREATE_ADJACENT. > > With this detailled definition, the following remark in parentheses > in 7.6.1 and 7.6.2 can be removed: > (the order of neighbors is returned by the neighborhood > query functions or for Cartesian communicators, it is in > the order of the dimensions, in each dimension first the > negative and then the positive direction) > > Torsten, please return the decision, Variant A or B. > > Best regards > Rolf > > -- Michael A. Raymond Message Passing Toolkit Team Silicon Graphics Inc (651) 683-3434

1 0

Re: [Mpi-forum] Sparse / neighborhood topology ticket 258
by Rolf Rabenseifner 09 Feb '11

09 Feb '11

Dear all, please make a straw-vote-decision TODAY about the two variants in this email. I myself prefer variant A. The current text does not include a precise definition of the sequence of the neighbors. I recommend to add such a definition before the Rationale in Sect. 7.6. New text: The sequence of the neighbors is defined - in a Cartesian topology by the order of the dimensions, and in each dimension, first the neighbor in the negative direction and then in the positive direction with displacement 1. If such a neighbor does not exist, i.e., at the border in the case of a non-periodic virtual grid dimension (i.e., periods[...]==false), then (VARIANT A) this neighbor is MPI_PROC_NULL and it is still part of the sequence of neighbors, but the corresponding buffer portion is not communicated. The values of indegree and outdegree in the communication routines are 2*ndims with ndims defined defined in MPI_CART_CREATE. (VARIANT B) this neighbor is not part of the sequence of neighbors. The values of indegree and outdegree in the communication routines are 2*ndims (with ndims defined defined in MPI_CART_CREATE), reduced by the number of non-existing neighbors. (END OF VARIANTS) The sequence of incoming and outgoing neighbors is identical. - in a general graph topology, the sequence of neighbors in each process is defined through the list of neighbors for this process as defined in the arguments index and edges in MPI_GRAPH_CREATE, which is identical to the sequence returned by MPI_GRAPH_NEIGHBORS. The values of indegree and outdegree in the communication routines are identical to nneighbors returned by MPI_GRAPH_NEIGHBOR_COUNT in each process for its own rank. The sequence of incoming and outgoing neighbors is identical. - in a distributed graph topology, the sequence of neighbors in each process is returned by MPI_DIST_GRAPH_NEIGHBORS. The values of indegree and outdegree in the communication routines are identical to the values returned by MPI_DIST_GRAPH_NEIGHBORS_COUNT. If the distributed graph topology was created by MPI_DIST_GRAPH_CREATE_ADJACENT, then the sequence of incoming and outgoing neighbors is identical to the sequence that was defined in MPI_DIST_GRAPH_CREATE_ADJACENT. With this detailled definition, the following remark in parentheses in 7.6.1 and 7.6.2 can be removed: (the order of neighbors is returned by the neighborhood query functions or for Cartesian communicators, it is in the order of the dimensions, in each dimension first the negative and then the positive direction) Torsten, please return the decision, Variant A or B. Best regards Rolf -- Dr. Rolf Rabenseifner . . . . . . . . . .. email rabenseifner(a)hlrs.de High Performance Computing Center (HLRS) . phone ++49(0)711/685-65530 University of Stuttgart . . . . . . . . .. fax ++49(0)711 / 685-65832 Head of Dpmt Parallel Computing . . . www.hlrs.de/people/rabenseifner Nobelstr. 19, D-70550 Stuttgart, Germany . (Office: Allmandring 30)

1 0