2020-07-19 - Optimize metric encoding in Prometheus Rust client library drastically reducing memory allocations in hot-path.
2020-07-14 - Port partially lock-free Prometheus histogram implementation to the Prometheus Rust client library making histogram observe calls atomic across collect calls.
2020-06-19 - Implement lookups over disjoint paths based on the extension research paper S/Kademlia in the Rust libp2p Kademlia implementation. (See as well libp2p forum post including a summary and benchmarks.)
2020-05-08 - Maintainer of the Rust Prometheus client library.
2019-10-06 - Maintainer of the Rust libp2p implementation.
2019-01-16 to 2019-08-02 - Maintainer of Kubernetes kube-state-metrics.
2019-01-15 - Joining Kubernetes organisation.
2019-01-11 - Kubernetes kube-state-metrics performance optimization dividing CPU usage by a factor of 6 and memory and response time by a factor of 3 through introducing an intelligent Prometheus metric cache in the code hot path and optimizing memory allocations during response generation.
2018-08-17 - Initiate and organize distributed systems book club covering distributed and decentralized systems research and their real-world applications.
2018-08-13 to 2020-01-06 - Maintainer of Prometheus Alertmanager.
2017-11-12 to 2020-03-13 - Part of Prometheus organisation.
Kurose, J. F., & Ross, K. W. (2017). Computer networking: a top-down approach (Vol. 7). Boston, USA: Addison Wesley.
Herlihy, Maurice, and Nir Shavit. The Art of Multiprocessor Programming, revised first edition. Morgan Kaufmann, 2012.
Kleppmann, M. (2017). Designing data-intensive applications: The big ideas behind reliable, scalable, and maintainable systems. " O’Reilly Media, Inc.".
Klabnik, Steve, and Carol Nichols. The Rust Programming Language. No Starch Press, 2018.
Ferguson, Niels, Bruce Schneier, and Tadayoshi Kohno. “Cryptography engineering.” Design Princi (2010).
Gregg, B. (2013). Systems performance: enterprise and the cloud. Pearson Education.
Brady, Edwin. Type-driven development with Idris. Manning Publications Company, 2017.
Cooper, Keith, and Linda Torczon. Engineering a compiler. Elsevier, 2011.
Cox-Buday, Katherine. Concurrency in Go: Tools and Techniques for Developers. " O’Reilly Media, Inc.", 2017.
Lipovaca, M. (2011). Learn you a haskell for great good!: a beginner’s guide. no starch press.
Grigorik, I. (2013). High Performance Browser Networking: What every web developer should know about networking and web performance. " O’Reilly Media, Inc.".
Tanenbaum, A. S., & Van Steen, M. (2017). Distributed systems: principles and paradigms.
Love, R. (2005). Linux Kernel Development (Novell Press). Novell Press.
Beyer, B., Jones, C., Petoff, J., & Murphy, N. R. (2016). Site Reliability Engineering: How Google Runs Production Systems. " O’Reilly Media, Inc.".
Silberschatz, Abraham, Henry F. Korth, and Shashank Sudarshan. Database system concepts. Vol. 7. New York: McGraw-Hill, 2019.
Howard, Heidi. (2018). Distributed consensus revised.
Yin, Maofan, et al. “Hotstuff: Bft consensus in the lens of blockchain." arXiv preprint arXiv:1803.05069 (2018).
Fischer, Michael J., Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. No. MIT/LCS/TR-282. Massachusetts Inst of Tech Cambridge lab for Computer Science, 1982.
Castro, Miguel, and Barbara Liskov. “Practical Byzantine fault tolerance." OSDI. Vol. 99. No. 1999. 1999.
Chan, Benjamin Y., and Elaine Shi. “Streamlet: Textbook Streamlined Blockchains." IACR Cryptol. ePrint Arch. 2020 (2020): 88.
Levandoski, Justin J., David B. Lomet, and Sudipta Sengupta. “The Bw-Tree: A B-tree for new hardware platforms." 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 2013.
Thomson, Alexander, et al. “Calvin: fast distributed transactions for partitioned database systems." Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. ACM, 2012.
Hendler, Danny, Nir Shavit, and Lena Yerushalmi. “A scalable lock-free stack algorithm." Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures. 2004.
Hart, Thomas Edward. Comparative performance of memory reclamation strategies for lock-free and concurrently-readable data structures. University of Toronto, 2005.
Kogan, Alex, and Erez Petrank. “A methodology for creating fast wait-free data structures." ACM SIGPLAN Notices. Vol. 47. No. 8. ACM, 2012.
Herlihy, Maurice, Victor Luchangco, and Mark Moir. “Obstruction-free synchronization: Double-ended queues as an example." 23rd International Conference on Distributed Computing Systems, 2003. Proceedings.. IEEE, 2003.
Lamport, Leslie. “Time, clocks, and the ordering of events in a distributed system." Communications of the ACM 21.7 (1978): 558-565.
Chandy, K. Mani, and Leslie Lamport. “Distributed snapshots: Determining global states of distributed systems." ACM Transactions on Computer Systems (TOCS) 3.1 (1985): 63-75.
Shapiro, Marc, et al. “A comprehensive study of convergent and commutative replicated data types." (2011).
Cardwell, Neal, et al. “BBR: Congestion-based congestion control." Queue 14.5 (2016): 20-53.
Shreedhar, Madhavapeddi, and George Varghese. “Efficient fair queuing using deficit round-robin." IEEE/ACM Transactions on networking 4.3 (1996): 375-385.
Van Renesse, Robbert, et al. “Efficient reconciliation and flow control for anti-entropy protocols." proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware. ACM, 2008.
Vyzovitis, Dimitris, et al. “GossipSub: Attack-Resilient Message Propagation in the Filecoin and ETH2. 0 Networks." arXiv preprint arXiv:2007.02754 (2020).
Leitao, Joao, Jose Pereira, and Luis Rodrigues. “Epidemic broadcast trees." 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE, 2007.
Maymounkov, Petar, and David Mazieres. “Kademlia: A peer-to-peer information system based on the xor metric." International Workshop on Peer-to-Peer Systems. Springer, Berlin, Heidelberg, 2002.
Baumgart, Ingmar, and Sebastian Mies. “S/kademlia: A practicable approach towards secure key-based routing." 2007 International Conference on Parallel and Distributed Systems. IEEE, 2007.
Das, Abhinandan, Indranil Gupta, and Ashish Motivala. “Swim: Scalable weakly-consistent infection-style process group membership protocol." Proceedings International Conference on Dependable Systems and Networks. IEEE, 2002.
Bortnikov, Edward, et al. “Brahms: Byzantine resilient random membership sampling." Computer Networks 53.13 (2009): 2340-2359.