Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Theo Jepsen"'
Publikováno v:
Proceedings of the VLDB Endowment. 15:3682-3685
Modern DBMS engines can achieve unprecedented transaction processing speeds thanks to the invention of clever data structures, concurrency schemes, and improvements in CPU and memory subsystems. However, developing realistic and efficient networked c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0062e454018cb9135d11132a3759093
https://doi.org/10.14778/3554821.3554874
https://doi.org/10.14778/3554821.3554874
Publikováno v:
Proceedings of the SIGCOMM '22 Poster and Demo Sessions.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c7942fef12d382b12a34cf79959ef5e
https://doi.org/10.1145/3546037.3546064
https://doi.org/10.1145/3546037.3546064
Publikováno v:
CoNEXT
In this paper, we explore how programmable data planes can naturally provide a higher-level of service to user applications via a new abstraction called packet subscriptions. Packet subscriptions generalize forwarding rules, and can be used to expres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e687af004935dc6d465997929f5b65b
https://doi.org/10.1145/3386367.3431315
https://doi.org/10.1145/3386367.3431315
Autor:
Theo Jepsen, Nate Foster, Masoud Moshref, Alvarez Daniel A, Jeongkeun Lee, Changhoon Kim, Robert Soulé
Publikováno v:
SOSR
This paper presents PPS, a system for locating occurrences of string keywords stored in the payload of packets using a programmable network ASIC. The PPS compiler first converts keywords into Deterministic Finite Automata (DFA) representations, and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::579ffe8b303f211a6db22a04837bcd98
https://doi.org/10.1145/3314148.3314356
https://doi.org/10.1145/3314148.3314356
Publikováno v:
HotNets
In this paper, we explore how programmable data planes can provide a higher-level of service to user applications via a new abstraction called packet subscriptions. Packet subscriptions generalize forwarding rules, and can be used to express both tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3eca1467387931cd6238cda092fa8305
https://doi.org/10.1145/3286062.3286092
https://doi.org/10.1145/3286062.3286092
Publikováno v:
NetCompute@SIGCOMM
Optimistic concurrency control (OCC) is inefficient for high-contention workloads. When concurrent transactions conflict, an OCC system wastes CPU resources verifying transactions, only to abort them. This paper presents a new system, called Network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd4c1234a1f31a0a49c634217b388701
https://doi.org/10.1145/3229591.3229597
https://doi.org/10.1145/3229591.3229597
Publikováno v:
SOSR
This paper explores the question: what abstractions are needed to support a more general form of stateful processing in programmable forwarding planes? It argues that we should look for clues from the domain of stream processing. As a case study, it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3aaf6c8391f0b6e28634dde384c51d32
https://doi.org/10.1145/3185467.3185494
https://doi.org/10.1145/3185467.3185494
Publikováno v:
SOSR
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d0a1748784e1873575ff31d89a624f9
https://doi.org/10.1145/3050220.3060603
https://doi.org/10.1145/3050220.3060603