The P4 language enables a range of new network applications. However, it is still far from easy to implement and optimize P4 programs for PISA hardware. Programmers must engage in a tedious "trial and error"process wherein they write their program (guessing it will fit within the hardware) and then check by compiling it. If it fails, they repeat the process. In this paper, we argue that programmers should define elastic data structures that stretch automatically to make use of available switch resources. We present P4All, an extension of P4 that supports elastic switch programming. Elastic data structures also make P4All modules reusable across different applications and hardware targets, where resource needs and constraints may vary.Our design is oriented around use of symbolic primitives (integers that may take on a range of possible values at compile time), arrays, and loops. We show how to use these primitive mechanisms to build a range of reusable libraries such as hash tables, Bloom filters, sketches, and key-value stores. We also explain the important role that elasticity plays in modular programming, and we allow programmers to declare utility functions that control the relative share of data-plane resources apportioned to each module.
|Title of host publication||HotNets 2020 - Proceedings of the 19th ACM Workshop on Hot Topics in Networks|
|Publisher||Association for Computing Machinery, Inc|
|Number of pages||7|
|State||Published - 4 Nov 2020|
|Event||19th ACM Workshop on Hot Topics in Networks, HotNets 2020 - Virtual, Online, United States|
Duration: 4 Nov 2020 → 6 Nov 2020
|Name||HotNets 2020 - Proceedings of the 19th ACM Workshop on Hot Topics in Networks|
|Conference||19th ACM Workshop on Hot Topics in Networks, HotNets 2020|
|Period||4/11/20 → 6/11/20|
Bibliographical noteFunding Information:
This work is supported by DARPA under Dispersed Computing HR0011-17-C-0047 and NSF under FMiTF-1837030 and CNS-1703493.
© 2020 ACM.