Home Program SOSR Award Register Local Info Travel Grant Visa Info Call for Papers/Demos/Posters Anti-Harassment Policy Child Care Organizers
Precise Time-synchronization in the Data-Plane using Programmable Switching ASICs
Pravein Govindan Kannan (School of Computing, National University of Singapore),
Raj Joshi (School of Computing, National University of Singapore),
Mun Choon Chan (School of Computing, National University of Singapore),
Pravein Govindan Kannan (School of Computing, National University of Singapore)
After a journey that has lasted over a decade, the next frontier of SDN extends the notion of programmability to the data plane, creating new opportunities for infusing intelligence into the network. This raises a fundamental question: what kinds of computation should be performed in the network?
We discuss the opportunities and challenges for co-designing data center distributed systems with their network layer. We believe that the time has finally come for pushing selected computations to execute in-network. However, in-network computation tasks must be judiciously crafted to match the limitations of the network machine architecture of programmable devices. We identify concrete applications and demonstrate the potential benefits of in-network computation, serving as an accelerator to modern data center workloads.
Bio:Marco does not know what the next big thing will be. But he's sure that our next-gen computing and networking infrastructure must be a viable platform for it and avoid stifling innovation. Marco's research area is cloud computing, distributed systems and networking. His current interest is in designing better systems support for AI/ML and provide practical implementations deployable in the real-world.
Marco is an assistant professor in Computer Science at KAUST. Marco obtained his Ph.D. from the University of Genoa in 2009 after spending the last year as a visiting student at the University of Cambridge, Computer Laboratory. He was a postdoctoral researcher at EPFL from 2009 to 2012 and after that a senior research scientist for one year at Deutsche Telekom Innovation Labs & TU Berlin. Before joining KAUST, he was an assistant professor at UCLouvain. He also held positions at Intel, Microsoft and Google.
Short
Christopher Leet (Yale University), Shenshen Chen (Tongji University), Kai Gao (Sichuan University), Yang Richard Yang (Yale University)
Long
Pravein Govindan Kannan (School of Computing, National University of Singapore), Raj Joshi (School of Computing, National University of Singapore), Mun Choon Chan (School of Computing, National University of Singapore), Pravein Govindan Kannan (School of Computing, National University of Singapore)
Short
Theo Jepsen (Università della Svizzera italiana and Barefoot Networks), Daniel Alvarez (Barefoot Networks), Nate Foster (Cornell University and Barefoot Networks), Changhoon Kim (Barefoot Networks), Jeongkeun Lee (Barefoot Networks), Masoud Moshref (Barefoot Networks), Robert Soule (Università della Svizzera italiana and Barefoot Networks)
Short
Vitalii Demianiuk (IMDEA Networks Institute), Kirill Kogan (IMDEA Networks Institute)
Long
Ayyoob Hamza (UNSW Sydney), Hassan Habibi (Gharakheili UNSW Sydney), Theophilus A. Benson (Brown University), Vijay Sivaraman (UNSW Sydney)
Long
Zirak Zaheer (University of Utah), Hyunseok Chang (Nokia Bell Labs), Sarit Mukherjee (Nokia Bell Labs), Jacobus Van der Merwe (University of Utah)
Emerging networking architectures are allowing for flexible and reconfigurable packet processing at line rate both at the switch and the NIC. Despite their promising new functionality, programmable switches and NICs are not all-powerful; they have limited state, support limited types of operations, and limit per-packet computation in order to operate at line rate. In this talk, I will describe how to mask resource limitations using approximation techniques and new scheduling algorithms and how to build a general framework for exposing in-network computing capability to distributed applications. In addition to presenting case studies of optimizing networked systems, I will reflect on the role of programmable dataplanes in datacenter computing.
Short
Anduo Wang (Temple University), Zhijia Chen (Temple Unviersity), Tony Yang (Johns Hopkins University), Minlan Yu (Harvard University)
Long
Vasudevan Nagendra (Stony Brook University), Arani Bhattacharya (Stony Brook University), Anshul Gandhi (Stony Brook University), Samir Das (Stony Brook University)
Short
Yikai Lin (University of Michigan), Yuru Shao (University of Michigan), Xiao Zhu (University of Michigan), Junpeng Guo (University of Michigan), Kira Barton (University of Michigan), Z. Morley Mao (University of Michigan)
Short
Adrien Wion (Thales/Telecom ParisTech), Mathieu Bouet (Thales), Luigi Iannone (Telecom ParisTech), Vania Conan (Thales)
Long
Aisha Syed (University of Utah), Bilal Anwer (AT&T Research), Vijay Gopalakrishnan (AT&T Research), Jacobus Van der Merwe (University of Utah)
Short
Dingming Wu (Rice University), Weitao Wang (Rice University), Ang Chen (Rice University), T. S. Eugene Ng (Rice University)
Short
Vijay Sivaraman (UNSW Sydney), Sharat Chandra Madanapalli (UNSW Sydney), Himal Kumar (Canopus Networks), Hassan Habibi Gharakheili (UNSW Sydney)
Long
Richard Sanger (University of Waikato), Matthew Luckie (University of Waikato), Richard Nelson (University of Waikato)
Long
Krzysztof Rusek (AGH University of Science and Technology) José Suárez-Varela (Universitat Politècnica de Catalunya), Albert Mestres (Universitat Politècnica de Catalunya), Pere Barlet-Ros (Universitat Politècnica de Catalunya), Albert Cabellos-Aparicio (Universitat Politècnica de Catalunya)