Exp-PIFO: Scalable and Efficient Programmable Packet Scheduling Article Swipe
Habib Mostafaei
,
Mohammad Ezzati
,
Pjl Pieter Cuijpers
,
Stefan Schmid
,
Gábor Rétvári
,
Sem Borst
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1145/3749217
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1145/3749217
Programmable packet schedulers provide great flexibility in the ordering of packet transmission. They allow network operators to optimize crucial performance metrics, such as Flow Completion Time (FCT), using strategies that adapt to changes in the characteristics of incoming traffic. A challenge in programming these devices is that they are severely limited in registers, memory, and control flow operations. The popular scheduling strategy Push-In First-Out (PIFO), for example, cannot be straightforwardly implemented because it relies on sorting packets, which is difficult to implement at line speed on current hardware. Fixed-priority approximations of PIFO, like SP-PIFO and AIFO, do have hardware implementations but generally still do not scale well in, for example, the number of memory cells being used. This paper introduces a new PIFO approximation strategy, Exp-PIFO, which prioritizes packets based on adaptive exponential prioritization criteria, called exponential bins. Exp-PIFO approximates the behavior of PIFO using only two memory cells to keep track of its state and uses a lookup table to avoid a complex control flow. We initially expected our improvement in memory and computation to come at a cost w.r.t. FCT performance compared to PIFO and its existing approximations. However, our empirical evaluation shows that Exp-PIFO sometimes even outperforms strict PIFO. We provide an explanation for this behavior and demonstrate the practical feasibility of Exp-PIFO through a proof-of-concept implementation on an Intel Tofino switch, which uses significantly less memory than comparable implementations of SP-PIFO and AIFO.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1145/3749217
- OA Status
- hybrid
- References
- 17
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4413984756
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4413984756Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1145/3749217Digital Object Identifier
- Title
-
Exp-PIFO: Scalable and Efficient Programmable Packet SchedulingWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-09-03Full publication date if available
- Authors
-
Habib Mostafaei, Mohammad Ezzati, Pjl Pieter Cuijpers, Stefan Schmid, Gábor Rétvári, Sem BorstList of authors in order
- Landing page
-
https://doi.org/10.1145/3749217Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
hybridOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.1145/3749217Direct OA link when available
- Concepts
-
Scalability, Computer science, Scheduling (production processes), Computer network, Computer architecture, Parallel computing, Distributed computing, Operating system, Engineering, Operations managementTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
17Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4413984756 |
|---|---|
| doi | https://doi.org/10.1145/3749217 |
| ids.doi | https://doi.org/10.1145/3749217 |
| ids.openalex | https://openalex.org/W4413984756 |
| fwci | 0.0 |
| type | article |
| title | Exp-PIFO: Scalable and Efficient Programmable Packet Scheduling |
| awards[0].id | https://openalex.org/G2470239544 |
| awards[0].funder_id | https://openalex.org/F4320320879 |
| awards[0].display_name | |
| awards[0].funder_award_id | SPP 2378 (project ReNO) |
| awards[0].funder_display_name | Deutsche Forschungsgemeinschaft |
| biblio.issue | CoNEXT3 |
| biblio.volume | 3 |
| biblio.last_page | 20 |
| biblio.first_page | 1 |
| topics[0].id | https://openalex.org/T10829 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Interconnection Networks and Systems |
| topics[1].id | https://openalex.org/T10714 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9998999834060669 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Software-Defined Networks and 5G |
| topics[2].id | https://openalex.org/T10054 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9995999932289124 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1708 |
| topics[2].subfield.display_name | Hardware and Architecture |
| topics[2].display_name | Parallel Computing and Optimization Techniques |
| funders[0].id | https://openalex.org/F4320320879 |
| funders[0].ror | https://ror.org/018mejw64 |
| funders[0].display_name | Deutsche Forschungsgemeinschaft |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C48044578 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6731624603271484 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q727490 |
| concepts[0].display_name | Scalability |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6462275981903076 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C206729178 |
| concepts[2].level | 2 |
| concepts[2].score | 0.522528886795044 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[2].display_name | Scheduling (production processes) |
| concepts[3].id | https://openalex.org/C31258907 |
| concepts[3].level | 1 |
| concepts[3].score | 0.4130639433860779 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[3].display_name | Computer network |
| concepts[4].id | https://openalex.org/C118524514 |
| concepts[4].level | 1 |
| concepts[4].score | 0.39503663778305054 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q173212 |
| concepts[4].display_name | Computer architecture |
| concepts[5].id | https://openalex.org/C173608175 |
| concepts[5].level | 1 |
| concepts[5].score | 0.3282494843006134 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q232661 |
| concepts[5].display_name | Parallel computing |
| concepts[6].id | https://openalex.org/C120314980 |
| concepts[6].level | 1 |
| concepts[6].score | 0.32225432991981506 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[6].display_name | Distributed computing |
| concepts[7].id | https://openalex.org/C111919701 |
| concepts[7].level | 1 |
| concepts[7].score | 0.14356616139411926 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[7].display_name | Operating system |
| concepts[8].id | https://openalex.org/C127413603 |
| concepts[8].level | 0 |
| concepts[8].score | 0.1120833158493042 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[8].display_name | Engineering |
| concepts[9].id | https://openalex.org/C21547014 |
| concepts[9].level | 1 |
| concepts[9].score | 0.06140574812889099 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1423657 |
| concepts[9].display_name | Operations management |
| keywords[0].id | https://openalex.org/keywords/scalability |
| keywords[0].score | 0.6731624603271484 |
| keywords[0].display_name | Scalability |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6462275981903076 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/scheduling |
| keywords[2].score | 0.522528886795044 |
| keywords[2].display_name | Scheduling (production processes) |
| keywords[3].id | https://openalex.org/keywords/computer-network |
| keywords[3].score | 0.4130639433860779 |
| keywords[3].display_name | Computer network |
| keywords[4].id | https://openalex.org/keywords/computer-architecture |
| keywords[4].score | 0.39503663778305054 |
| keywords[4].display_name | Computer architecture |
| keywords[5].id | https://openalex.org/keywords/parallel-computing |
| keywords[5].score | 0.3282494843006134 |
| keywords[5].display_name | Parallel computing |
| keywords[6].id | https://openalex.org/keywords/distributed-computing |
| keywords[6].score | 0.32225432991981506 |
| keywords[6].display_name | Distributed computing |
| keywords[7].id | https://openalex.org/keywords/operating-system |
| keywords[7].score | 0.14356616139411926 |
| keywords[7].display_name | Operating system |
| keywords[8].id | https://openalex.org/keywords/engineering |
| keywords[8].score | 0.1120833158493042 |
| keywords[8].display_name | Engineering |
| keywords[9].id | https://openalex.org/keywords/operations-management |
| keywords[9].score | 0.06140574812889099 |
| keywords[9].display_name | Operations management |
| language | en |
| locations[0].id | doi:10.1145/3749217 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4387290834 |
| locations[0].source.issn | 2834-5509 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 2834-5509 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Proceedings of the ACM on Networking |
| locations[0].source.host_organization | https://openalex.org/P4310319798 |
| locations[0].source.host_organization_name | Association for Computing Machinery |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319798 |
| locations[0].source.host_organization_lineage_names | Association for Computing Machinery |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings of the ACM on Networking |
| locations[0].landing_page_url | https://doi.org/10.1145/3749217 |
| locations[1].id | pmh:oai:pure.tue.nl:openaire/adc3e45f-da81-4d17-b30e-1d525968332a |
| locations[1].is_oa | True |
| locations[1].source | |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | publishedVersion |
| locations[1].raw_type | info:eu-repo/semantics/publishedVersion |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | True |
| locations[1].is_published | True |
| locations[1].raw_source_name | Mostafaei, H, Ezzati, M, Cuijpers, P J L, Schmid, S, Rétvári, G & Borst, S 2025, 'Exp-PIFO : Scalable and Efficient Programmable Packet Scheduling', Proceedings of the ACM on Networking, vol. 3, no. CoNEXT3, 17. https://doi.org/10.1145/3749217 |
| locations[1].landing_page_url | https://research.tue.nl/en/publications/adc3e45f-da81-4d17-b30e-1d525968332a |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5035910159 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-8282-1571 |
| authorships[0].author.display_name | Habib Mostafaei |
| authorships[0].countries | NL |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I83019370 |
| authorships[0].affiliations[0].raw_affiliation_string | Eindhoven University of Technology, Eindhoven, Netherlands |
| authorships[0].institutions[0].id | https://openalex.org/I83019370 |
| authorships[0].institutions[0].ror | https://ror.org/02c2kyt77 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I83019370 |
| authorships[0].institutions[0].country_code | NL |
| authorships[0].institutions[0].display_name | Eindhoven University of Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Habib Mostafaei |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Eindhoven University of Technology, Eindhoven, Netherlands |
| authorships[1].author.id | https://openalex.org/A5119538282 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Mohammad Ezzati |
| authorships[1].countries | DE |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I4577782 |
| authorships[1].affiliations[0].raw_affiliation_string | Technische Universität Berlin, Berlin, Germany |
| authorships[1].institutions[0].id | https://openalex.org/I4577782 |
| authorships[1].institutions[0].ror | https://ror.org/03v4gjf40 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I4577782 |
| authorships[1].institutions[0].country_code | DE |
| authorships[1].institutions[0].display_name | Technische Universität Berlin |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Mohammad Ezzati |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Technische Universität Berlin, Berlin, Germany |
| authorships[2].author.id | https://openalex.org/A5033505407 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-5487-4972 |
| authorships[2].author.display_name | Pjl Pieter Cuijpers |
| authorships[2].countries | NL |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I145872427, https://openalex.org/I83019370 |
| authorships[2].affiliations[0].raw_affiliation_string | Eindhoven University of Technology, Eindhoven, Netherlands and Radboud Universiteit, Nijmegen, Netherlands |
| authorships[2].institutions[0].id | https://openalex.org/I83019370 |
| authorships[2].institutions[0].ror | https://ror.org/02c2kyt77 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I83019370 |
| authorships[2].institutions[0].country_code | NL |
| authorships[2].institutions[0].display_name | Eindhoven University of Technology |
| authorships[2].institutions[1].id | https://openalex.org/I145872427 |
| authorships[2].institutions[1].ror | https://ror.org/016xsfp80 |
| authorships[2].institutions[1].type | education |
| authorships[2].institutions[1].lineage | https://openalex.org/I145872427 |
| authorships[2].institutions[1].country_code | NL |
| authorships[2].institutions[1].display_name | Radboud University Nijmegen |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Pieter J. L. Cuijpers |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Eindhoven University of Technology, Eindhoven, Netherlands and Radboud Universiteit, Nijmegen, Netherlands |
| authorships[3].author.id | https://openalex.org/A5066080641 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-7798-1711 |
| authorships[3].author.display_name | Stefan Schmid |
| authorships[3].countries | DE |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I4210133470, https://openalex.org/I4577782 |
| authorships[3].affiliations[0].raw_affiliation_string | Technische Universität Berlin, Berlin, Germany and Fraunhofer SIT, Darmstadt, Germany |
| authorships[3].institutions[0].id | https://openalex.org/I4210133470 |
| authorships[3].institutions[0].ror | https://ror.org/03qt2gs44 |
| authorships[3].institutions[0].type | facility |
| authorships[3].institutions[0].lineage | https://openalex.org/I4210133470, https://openalex.org/I4923324 |
| authorships[3].institutions[0].country_code | DE |
| authorships[3].institutions[0].display_name | Fraunhofer Institute for Secure Information Technology |
| authorships[3].institutions[1].id | https://openalex.org/I4577782 |
| authorships[3].institutions[1].ror | https://ror.org/03v4gjf40 |
| authorships[3].institutions[1].type | education |
| authorships[3].institutions[1].lineage | https://openalex.org/I4577782 |
| authorships[3].institutions[1].country_code | DE |
| authorships[3].institutions[1].display_name | Technische Universität Berlin |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Stefan Schmid |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Technische Universität Berlin, Berlin, Germany and Fraunhofer SIT, Darmstadt, Germany |
| authorships[4].author.id | https://openalex.org/A5014559047 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-5958-7817 |
| authorships[4].author.display_name | Gábor Rétvári |
| authorships[4].countries | HU |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I29770179 |
| authorships[4].affiliations[0].raw_affiliation_string | Budapest University of Technology and Economics, Budapest, Hungary |
| authorships[4].institutions[0].id | https://openalex.org/I29770179 |
| authorships[4].institutions[0].ror | https://ror.org/02w42ss30 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I29770179 |
| authorships[4].institutions[0].country_code | HU |
| authorships[4].institutions[0].display_name | Budapest University of Technology and Economics |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Gábor Rétvári |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Budapest University of Technology and Economics, Budapest, Hungary |
| authorships[5].author.id | https://openalex.org/A5067615131 |
| authorships[5].author.orcid | https://orcid.org/0000-0003-3306-6447 |
| authorships[5].author.display_name | Sem Borst |
| authorships[5].countries | NL |
| authorships[5].affiliations[0].institution_ids | https://openalex.org/I83019370 |
| authorships[5].affiliations[0].raw_affiliation_string | Eindhoven University of Technology, Eindhoven, Netherlands |
| authorships[5].institutions[0].id | https://openalex.org/I83019370 |
| authorships[5].institutions[0].ror | https://ror.org/02c2kyt77 |
| authorships[5].institutions[0].type | education |
| authorships[5].institutions[0].lineage | https://openalex.org/I83019370 |
| authorships[5].institutions[0].country_code | NL |
| authorships[5].institutions[0].display_name | Eindhoven University of Technology |
| authorships[5].author_position | last |
| authorships[5].raw_author_name | Sem Borst |
| authorships[5].is_corresponding | False |
| authorships[5].raw_affiliation_strings | Eindhoven University of Technology, Eindhoven, Netherlands |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.1145/3749217 |
| open_access.oa_status | hybrid |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Exp-PIFO: Scalable and Efficient Programmable Packet Scheduling |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10829 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Interconnection Networks and Systems |
| related_works | https://openalex.org/W2389214306, https://openalex.org/W2965083567, https://openalex.org/W4401278057, https://openalex.org/W1982914007, https://openalex.org/W2159583675, https://openalex.org/W1824242903, https://openalex.org/W1493858311, https://openalex.org/W2155470929, https://openalex.org/W2111125783, https://openalex.org/W2394465510 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1145/3749217 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4387290834 |
| best_oa_location.source.issn | 2834-5509 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 2834-5509 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Proceedings of the ACM on Networking |
| best_oa_location.source.host_organization | https://openalex.org/P4310319798 |
| best_oa_location.source.host_organization_name | Association for Computing Machinery |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319798 |
| best_oa_location.source.host_organization_lineage_names | Association for Computing Machinery |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Proceedings of the ACM on Networking |
| best_oa_location.landing_page_url | https://doi.org/10.1145/3749217 |
| primary_location.id | doi:10.1145/3749217 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4387290834 |
| primary_location.source.issn | 2834-5509 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 2834-5509 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Proceedings of the ACM on Networking |
| primary_location.source.host_organization | https://openalex.org/P4310319798 |
| primary_location.source.host_organization_name | Association for Computing Machinery |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319798 |
| primary_location.source.host_organization_lineage_names | Association for Computing Machinery |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings of the ACM on Networking |
| primary_location.landing_page_url | https://doi.org/10.1145/3749217 |
| publication_date | 2025-09-03 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W2164740236, https://openalex.org/W2117884704, https://openalex.org/W3046344355, https://openalex.org/W1994926493, https://openalex.org/W2103830109, https://openalex.org/W2124827397, https://openalex.org/W2157614013, https://openalex.org/W4387667188, https://openalex.org/W4406858650, https://openalex.org/W2968193396, https://openalex.org/W2487583538, https://openalex.org/W3190458349, https://openalex.org/W4413757026, https://openalex.org/W4254007350, https://openalex.org/W2251762352, https://openalex.org/W95608104, https://openalex.org/W2914997739 |
| referenced_works_count | 17 |
| abstract_inverted_index.A | 39 |
| abstract_inverted_index.a | 120, 157, 162, 178, 217 |
| abstract_inverted_index.We | 166, 202 |
| abstract_inverted_index.an | 204, 221 |
| abstract_inverted_index.as | 22 |
| abstract_inverted_index.at | 82, 177 |
| abstract_inverted_index.be | 68 |
| abstract_inverted_index.do | 96, 103 |
| abstract_inverted_index.in | 6, 33, 41, 51, 171 |
| abstract_inverted_index.is | 45, 78 |
| abstract_inverted_index.it | 72 |
| abstract_inverted_index.of | 9, 36, 90, 112, 142, 152, 214, 233 |
| abstract_inverted_index.on | 74, 85, 130, 220 |
| abstract_inverted_index.to | 16, 31, 80, 149, 160, 175, 184 |
| abstract_inverted_index.FCT | 181 |
| abstract_inverted_index.The | 58 |
| abstract_inverted_index.and | 54, 94, 155, 173, 186, 209, 235 |
| abstract_inverted_index.are | 48 |
| abstract_inverted_index.but | 100 |
| abstract_inverted_index.for | 65, 108, 206 |
| abstract_inverted_index.in, | 107 |
| abstract_inverted_index.its | 153, 187 |
| abstract_inverted_index.new | 121 |
| abstract_inverted_index.not | 104 |
| abstract_inverted_index.our | 169, 191 |
| abstract_inverted_index.the | 7, 34, 110, 140, 211 |
| abstract_inverted_index.two | 146 |
| abstract_inverted_index.Flow | 23 |
| abstract_inverted_index.PIFO | 122, 143, 185 |
| abstract_inverted_index.They | 12 |
| abstract_inverted_index.This | 117 |
| abstract_inverted_index.Time | 25 |
| abstract_inverted_index.come | 176 |
| abstract_inverted_index.cost | 179 |
| abstract_inverted_index.even | 198 |
| abstract_inverted_index.flow | 56 |
| abstract_inverted_index.have | 97 |
| abstract_inverted_index.keep | 150 |
| abstract_inverted_index.less | 228 |
| abstract_inverted_index.like | 92 |
| abstract_inverted_index.line | 83 |
| abstract_inverted_index.only | 145 |
| abstract_inverted_index.such | 21 |
| abstract_inverted_index.than | 230 |
| abstract_inverted_index.that | 29, 46, 195 |
| abstract_inverted_index.they | 47 |
| abstract_inverted_index.this | 207 |
| abstract_inverted_index.uses | 156, 226 |
| abstract_inverted_index.well | 106 |
| abstract_inverted_index.AIFO, | 95 |
| abstract_inverted_index.AIFO. | 236 |
| abstract_inverted_index.Intel | 222 |
| abstract_inverted_index.PIFO, | 91 |
| abstract_inverted_index.PIFO. | 201 |
| abstract_inverted_index.adapt | 30 |
| abstract_inverted_index.allow | 13 |
| abstract_inverted_index.avoid | 161 |
| abstract_inverted_index.based | 129 |
| abstract_inverted_index.being | 115 |
| abstract_inverted_index.bins. | 137 |
| abstract_inverted_index.cells | 114, 148 |
| abstract_inverted_index.flow. | 165 |
| abstract_inverted_index.great | 4 |
| abstract_inverted_index.paper | 118 |
| abstract_inverted_index.scale | 105 |
| abstract_inverted_index.shows | 194 |
| abstract_inverted_index.speed | 84 |
| abstract_inverted_index.state | 154 |
| abstract_inverted_index.still | 102 |
| abstract_inverted_index.table | 159 |
| abstract_inverted_index.these | 43 |
| abstract_inverted_index.track | 151 |
| abstract_inverted_index.used. | 116 |
| abstract_inverted_index.using | 27, 144 |
| abstract_inverted_index.which | 77, 126, 225 |
| abstract_inverted_index.(FCT), | 26 |
| abstract_inverted_index.Tofino | 223 |
| abstract_inverted_index.called | 135 |
| abstract_inverted_index.cannot | 67 |
| abstract_inverted_index.lookup | 158 |
| abstract_inverted_index.memory | 113, 147, 172, 229 |
| abstract_inverted_index.number | 111 |
| abstract_inverted_index.packet | 1, 10 |
| abstract_inverted_index.relies | 73 |
| abstract_inverted_index.strict | 200 |
| abstract_inverted_index.w.r.t. | 180 |
| abstract_inverted_index.(PIFO), | 64 |
| abstract_inverted_index.Push-In | 62 |
| abstract_inverted_index.SP-PIFO | 93, 234 |
| abstract_inverted_index.because | 71 |
| abstract_inverted_index.changes | 32 |
| abstract_inverted_index.complex | 163 |
| abstract_inverted_index.control | 55, 164 |
| abstract_inverted_index.crucial | 18 |
| abstract_inverted_index.current | 86 |
| abstract_inverted_index.devices | 44 |
| abstract_inverted_index.limited | 50 |
| abstract_inverted_index.memory, | 53 |
| abstract_inverted_index.network | 14 |
| abstract_inverted_index.packets | 128 |
| abstract_inverted_index.popular | 59 |
| abstract_inverted_index.provide | 3, 203 |
| abstract_inverted_index.sorting | 75 |
| abstract_inverted_index.switch, | 224 |
| abstract_inverted_index.through | 216 |
| abstract_inverted_index.Exp-PIFO | 138, 196, 215 |
| abstract_inverted_index.However, | 190 |
| abstract_inverted_index.adaptive | 131 |
| abstract_inverted_index.behavior | 141, 208 |
| abstract_inverted_index.compared | 183 |
| abstract_inverted_index.example, | 66, 109 |
| abstract_inverted_index.existing | 188 |
| abstract_inverted_index.expected | 168 |
| abstract_inverted_index.hardware | 98 |
| abstract_inverted_index.incoming | 37 |
| abstract_inverted_index.metrics, | 20 |
| abstract_inverted_index.optimize | 17 |
| abstract_inverted_index.ordering | 8 |
| abstract_inverted_index.packets, | 76 |
| abstract_inverted_index.severely | 49 |
| abstract_inverted_index.strategy | 61 |
| abstract_inverted_index.traffic. | 38 |
| abstract_inverted_index.Exp-PIFO, | 125 |
| abstract_inverted_index.First-Out | 63 |
| abstract_inverted_index.challenge | 40 |
| abstract_inverted_index.criteria, | 134 |
| abstract_inverted_index.difficult | 79 |
| abstract_inverted_index.empirical | 192 |
| abstract_inverted_index.generally | 101 |
| abstract_inverted_index.hardware. | 87 |
| abstract_inverted_index.implement | 81 |
| abstract_inverted_index.initially | 167 |
| abstract_inverted_index.operators | 15 |
| abstract_inverted_index.practical | 212 |
| abstract_inverted_index.sometimes | 197 |
| abstract_inverted_index.strategy, | 124 |
| abstract_inverted_index.Completion | 24 |
| abstract_inverted_index.comparable | 231 |
| abstract_inverted_index.evaluation | 193 |
| abstract_inverted_index.introduces | 119 |
| abstract_inverted_index.registers, | 52 |
| abstract_inverted_index.schedulers | 2 |
| abstract_inverted_index.scheduling | 60 |
| abstract_inverted_index.strategies | 28 |
| abstract_inverted_index.computation | 174 |
| abstract_inverted_index.demonstrate | 210 |
| abstract_inverted_index.explanation | 205 |
| abstract_inverted_index.exponential | 132, 136 |
| abstract_inverted_index.feasibility | 213 |
| abstract_inverted_index.flexibility | 5 |
| abstract_inverted_index.implemented | 70 |
| abstract_inverted_index.improvement | 170 |
| abstract_inverted_index.operations. | 57 |
| abstract_inverted_index.outperforms | 199 |
| abstract_inverted_index.performance | 19, 182 |
| abstract_inverted_index.prioritizes | 127 |
| abstract_inverted_index.programming | 42 |
| abstract_inverted_index.Programmable | 0 |
| abstract_inverted_index.approximates | 139 |
| abstract_inverted_index.approximation | 123 |
| abstract_inverted_index.significantly | 227 |
| abstract_inverted_index.transmission. | 11 |
| abstract_inverted_index.Fixed-priority | 88 |
| abstract_inverted_index.approximations | 89 |
| abstract_inverted_index.implementation | 219 |
| abstract_inverted_index.prioritization | 133 |
| abstract_inverted_index.approximations. | 189 |
| abstract_inverted_index.characteristics | 35 |
| abstract_inverted_index.implementations | 99, 232 |
| abstract_inverted_index.proof-of-concept | 218 |
| abstract_inverted_index.straightforwardly | 69 |
| cited_by_percentile_year | |
| countries_distinct_count | 3 |
| institutions_distinct_count | 6 |
| citation_normalized_percentile.value | 0.46147875 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |