BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230124T171522Z
LOCATION:C148
DTSTART;TZID=America/Chicago:20221113T135200
DTEND;TZID=America/Chicago:20221113T135600
UID:submissions.supercomputing.org_SC22_sess425_ws_whpc109@linklings.com
SUMMARY:Optimizing the Bruck Algorithm for All-to-All Communication
DESCRIPTION:Workshop\n\nOptimizing the Bruck Algorithm for All-to-All Comm
 unication\n\nFan\n\nIn this work, we focus on efficiently generalizing the
  Bruck algorithm to non-uniform all-to-all data exchange. We present two a
 lternative techniques for extending the Bruck algorithm to support non-uni
 form data distributions: padded Bruck and two-phase Bruck. In padded Bruck
 , we convert the non-uniform communication pattern into a uniform one by p
 adding data messages into equal-sized buffers. Our other implementation, t
 he two-phase Bruck, uses a meta-data exchange phase and a monolithic worki
 ng buffer to facilitate non-uniform all-to-all data exchange. Moreover, we
  also performed experimental investigation of the tunable Bruck algorithm 
 with varying radix-r. We demonstrated that the Bruck algorithm with r = sq
 rt(P) (P : total number of processes) is the most effective in most cases.
 \n\nSession Format: Recorded\n\nTag: Diversity Equity Inclusion (DEI), Edu
 cation and Training and Outreach\n\nRegistration Category: Workshop Reg Pa
 ss
END:VEVENT
END:VCALENDAR