To: J3                                                     J3/26-223r1
From: Soren Rasmussen & HPC
Subject: Edits to replace the SYNC ALL example
Date: 2026-October-28

1. Introduction
---------------

This paper contains edits to 11.7.3 SYNC ALL statement, paragraph 2, NOTE.

The issues with this example are
  1. Oversynchronizes, no obvious necessity for the first SYNC ALL.
  2. Performs a naive/non-scalable push-broadcast through a coarray, instead
     of calling CO_BROADCAST.


2. Edits to 26-007r2
--------------------

[248:12+] 11.7.3 SYNC ALL statement, paragraph 2, NOTE.

Replace the current example paragraph and code in the NOTE:

"
Here is a simple example of its use. Image 1 reads data and broadcasts it to
other images:
  REAL :: P[*]
  ...
  SYNC ALL
  IF (THIS_IMAGE()==1) THEN
    READ (*,*) P
    DO I = 2, NUM_IMAGES()
      P[I] = P
    END DO
  END IF
  SYNC ALL
"

The (unrelated) first paragraph of the Note should be preserved, or possibly
split into a separate Note.

with:

"
Here is a simple example of its use to synchronize a parallel halo exchange,
a common algorithm in scientific computing. Each image copies boundary values
from its two neighbors in a periodic one-dimensional decomposition. The first
SYNC ALL ensures that the neighbors have defined p(1:n) before the values are
copied; the second SYNC ALL ensures that all images have finished copying
before any image redefines p(1:n).

  REAL :: p(0:n+1)[*]    ! p(0) and p(n+1) hold copies of neighbor data
  INTEGER :: left, right
  right = MOD (THIS_IMAGE(), NUM_IMAGES()) + 1   ! Periodic neighbors
  left = MOD (THIS_IMAGE() - 2 + NUM_IMAGES(), NUM_IMAGES()) + 1
  ... ! Initialize the local data in p(1:n)
  SYNC ALL
  p(0) = p(n)[left]
  p(n+1) = p(1)[right]
  SYNC ALL
"