Service By Enhancing IPVS with eBPF Agenda 目录 01 Problems with K8s Service How to optimize 02 Comparison with industry Performance measurement 03 04 Future work 05 06 Lessons from eBPF What is K8s Service plane • Stably runs for two decades • Support rich scheduling algorithm • Cons • Performance cost caused by conntrack • Some bugs How to optimize • Guidelines • Use less CPU instructions to secure • V.S Taobao IPVS SNAT patch • Bypass conntrack/iptables • Less modification to kernel Comparison with industry • Pitfalls • Performance of clusters of the same configure may differ • Performance

signed/unsigned mismatch • warning: comparison of integers of different signs: 'short' and 'unsigned int' [-Wsign-compare] • This prints false 🙀9 Integer Comparison Functions • GH-621 implemented by separate T • Scenarios (see P0019R8): • Distinct single-threaded and multi-threaded parts • Pay the cost for atomic operations only when necessary • Distinct non-conflicting and conflicting parts • Layout

aString; }; Data d { .aString = "Hello" };48 Spaceship Operator <=>  Official name: three-way comparison operator  Three-way: comparing 2 objects and then comparing result with 0  (a <=> b) < 0 <=>  Common case:  auto X::operator<=>(const Y&) const = default;  Compiler generates all 6 comparison operators to compare X with Y (memberwise)  Advanced:  Non-defaulted (then you also need cout << "greater"; } if (result == strong_ordering::equal) { cout << "equal"; }  Or using named comparison functions: if (is_lt(result)) { cout << "less"; } if (is_gt(result)) { cout << "greater"; }

to write tests Single code base for both platforms Extended gesture and action support Image comparison Device management Reporting nativescript-dev-appium Installation npm install nativescript-dev-appium waitForNotExist() getAttribute() source() size() location() exists() text() Typings Async/Await Image Comparison driver.compareScreen("page.png"); Open source cloud builds - Sauce Labs nativescript-facebook

No Yes Rust, Golang Yes No No KVM Amazon Nabla+runnc Yes No C, Golang Yes No No None IBM OCI Comparison kata- runtime runc runsc container container Pod QEMU VMM Firecracker VMM Rust-VMM container Sentry KVM/ptrace File Access OCI Implementation Limited Syscall H O S T K E R N E L Comparison Solution Typical Software Bullet Point Rule-based Sandbox RunC Needs to work with SELinux,

https://www.tbrk.org/ 1.3 FOSS EDA Overview I. Background  https://en.wikipedia.org/wiki/Comparison_of_EDA_software  https://semiwiki.com/wikis/industry-wikis/eda-open-source-tools-wiki/  ht

Correlated Subqueries Отсутствие оптимизаций JOIN 18 • Не учитывается сортировка таблицы для JOIN • Нет cost based optimizer для переупорядочивания JOIN • Нет grace hash алгоритма для JOIN • Нет shuffle для

directly on user’s data. ➔ More users, more incomings. The decentralization could probably reduce the cost, so you may get more profits. ➔ More profits, more network nodes coming. They can share the profits

return 42; }Lessons learned • Path-sensitive analysis is powerful, but power comes at a cost • We are actively looking into ways to make analysis more precise • There are a large set of checks

rules Optimization rules: MATCH -> pushdown Planning Strategies Graph Execution Code Gen JIT Cost model Storage backend （ Property Graph KV store ） Pushdown filter Cypher (a)-[:LIKES]->(b) 计算下推：面向图应用特征设计