Section#14: Homework 6
(CS838: Topics in parallel computing, CS1221, Thu, Mar 18, 1999, 8:00-9:15 a.m.)

Communication latency II

Also today's homework asks you to solve two problems, the first one very easy.
  1. Prove that the upper bound on link congestion during the direct-exchange AAS in WH 1-port full-duplex M(z1,z2) in Subsection 14.4.2 is
    Note that the mesh uses XY-routing.
  2. Derive expression for the communication latency of an optimal combining all-to-all broadcast on a store-and-forward 1-port full-duplex T(z1,z2), where z1,z2 are odd numbers.