SP-PIFO
SP-PIFO copied to clipboard
nsg-ethz
Approximating Push-In First-Out Behaviors using Strict-Priority Queues
SP-PIFO: Approximating Push-In First-Out Behaviors
using Strict-Priority Queues
This repository contains the code used in SP-PIFO, which was presented at NSDI'20.
What can I find in this repo?
-
java_codecontains the Java-based implementation of SP-PIFO, which is built on top of NetBench. We have used this implementation to evaluate SP-PIFO performance when approximating well-known scheduling objectives under realistic traffic workloads. This is the code used for the evaluation in Section 4.2, Section 6.1 and Appendix A. -
p4_codecontains the P4_16 code to run SP-PIFO on programmable switches.
The code can be directly deployed on a software switch (e.g., P4 behavioral model in Mininet), or adapted to be executed on a hardware switch (e.g., Barefoot Tofino). This is the code used to make the plots of Section 6.2.
Contact
Please, send us an e-mail to: [email protected] or [email protected],
- If you are interested in collaborating with the project.
- If you are having issues when trying to run the experiments described on the paper.
- If you happen to find a bug.
- If you have any other question or concern :)
nsg-ethz