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:20260522T150119Z
LOCATION:C140/142
DTSTART;TZID=America/Chicago:20181113T103000
DTEND;TZID=America/Chicago:20181113T120000
UID:submissions.supercomputing.org_SC18_sess194@linklings.com
SUMMARY:Next-Generation Networking
DESCRIPTION:Fine-Grained, Multi-Domain Network Resource Abstraction as a F
 undamental Primitive to Enable High-Performance, Collaborative Data Scienc
 es\n\nMulti-domain network resource reservation systems are being deployed
 , driven by the demand and substantial benefits of providing predictable n
 etwork resources. However, a major lack of existing systems is their coars
 e granularity, due to the participating networks’ concern of revealing sen
 sitive inf...\n\n\nQiao Xiang (Yale University); J. Jensen Zhang, X. Tony 
 Wang, and Y. Jace Liu (Tongji University); Chin Guok (Lawrence Berkeley Na
 tional Laboratory); Franck Le (IBM); John MacAuley (Lawrence Berkeley Nati
 onal Laboratory); Harvey Newman (California Institute of Technology); and 
 Y. Richard Yang (Yale University)\n---------------------\nExploiting Idle 
 Resources in a High-Radix Switch for Supplemental Storage\n\nA general-pur
 pose switch for a high-performance network is usually designed with symmet
 ric ports providing credit-based flow control and error recovery via link-
 level retransmission. Because port buffers must be sized for the longest l
 inks and modern asymmetric network topologies have a wide range o...\n\n\n
 Matthias A. Blumrich, Nan Jiang, and Larry R. Dennison (Nvidia Corporation
 )\n---------------------\nLight-Weight Protocols for Wire-Speed Ordering\n
 \nWe describe light-weight protocols for selective packet ordering in out-
 of-order networks that carry memory traffic. The protocols are designed fo
 r heterogeneous high-performance systems, in particular, accelerated syste
 ms with endpoints that have few resources available for interfacing the ne
 twork....\n\n\nHans Eberle and Larry Dennison (Nvidia Corporation)\n\nTag:
  Architectures, Data Analytics, Networks\n\nRegistration Category: Tech Pr
 ogram Reg Pass\n\nFinalist: BP Finalist\n\nSession Chair: Madeleine Glick 
 (Columbia University)
END:VEVENT
END:VCALENDAR
