• Zach Tellman on Shape Decomposition for Multi-channel Distance Fields

    Mini Ramon Nogueira on BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data - https://sameeragarwal.github.io/blinkdb_eurosys13.pdf Ramon's Bio Ramon is a software engineer with a passion for making large systems easier to understand and operate. He currently works at Google on OpenCensus: an open source metrics and distributed tracing library for microservices. Previous hits include iCloud storage APIs at Apple, and startups in London and Johannesburg Main Talk Zach Tellman on Shape Decomposition for Multi-channel Distance Fields - https://dspace.cvut.cz/bitstream/handle/10467/62770/F8-DP-2015-Chlumsky-Viktor-thesis.pdf Zach's Bio Zach consults on the design of distributed systems and APIs. He has written "Elements of Clojure", a book which tries to put words to what most experienced engineers already know, and is working on a tool for exploratory data processing.

  • Gwen Shapira on Peeking Behind the Curtains of Serverless Frameworks

    Mini Michael Kehoe on Democratically Finding The Cause of Packet Drops - https://arxiv.org/pdf/1802.07222.pdf Michael's Bio Michael Kehoe is a Staff SRE at LinkedIn who works on building scalable monitoring infrastructure, reliability principles and incident management. Michael previously interned at NASA Ames on their PhoneSat project. Michael's key interests lie in network engineering and automation. --- Main Talk Gwen Schapira on Peeking Behind the Curtains of Serverless Frameworks - https://www.usenix.org/system/files/conference/atc18/atc18-wang-liang.pdf Gwen's Bio Gwen Shapira is a principal data architect at Confluent, previously an engineer at Cloudera. She's committer of the Apache Kafka project and author of "Kafka - the definitive guide".

  • Aaron Goldman on Chord

    GitHub HQ 3.0

    Mini Max Seiden on Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals https://arxiv.org/pdf/cs/0701155.pdf In under 15 pages, this paper describes the first principles of OLAP with such clarity and foresight that, over 20 years later, it's direct contributions are still highly relevant to anyone building products and technologies in the analytics space. Max's Bio Max is a systems engineer with a deep interest in making information accessible to anyone with a question. He's currently at Sigma Computing, where he spends most of his time hacking on query compilation, optimization, and code generation. Before Sigma, he was at Platfora (now Workday) working on data cubes and materialized views using Spark, MapReduce, and the bundle-of-joy that is the Hadoop Ecosystem. Max received a bachelors in computer science from the University of Michigan. When he isn't writing code, you can hear him playing 🎷 in @thefellswoop (instagram) --- Main Talk Aaron Goldman on Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications https://www.cc.gatech.edu/classes/AY2007/cs7260_spring/papers/chord.pdf This is a foundational paper in the area of Distributed Hash Tables (DHTs). Chord is a Key/Value store that guarantees queries make a logarithmic number hops and that keys are well balanced. This DHT paper should be in the mine of anyone building large-scale fault tolerant systems. Aaron's Bio Aaron Goldman did his graduate work at the Georgia Institute of Technology where he studied Electrical and Computer Engineering. He has worked on radar systems for the US Department of Defense, Anti Abuse at Google, and Runtime Application Self Protection at tCell. In his spare time he is building a new internet out of immutable data.

  • Sean T. Allen on Life Beyond Distributed Transactions: An Apostate’s Opinion

    Main Talk In 2007, Pat Helland published “Life Beyond Distributed Transactions: An Apostate’s Opinion,” in which he conducts a thought experiment on how to design a distributed database that can scale almost infinitely. While the paper explicitly addresses distributed database design, I'll show that the ideas are far more widely applicable, particularly in scaling stateful applications. In particular, how we implemented some of the ideas from the paper in our distributed stream processor Wallaroo. https://queue.acm.org/detail.cfm?ref=rss&id=3025012 --- Sean T. Allen is VP of Engineering at Wallaroo Labs and a member of the Pony core team. His turn-ons include programming languages, distributed computing, Hiwatt amplifiers, and Fender Telecasters. His turn-offs include mayonnaise, stirring yogurt, and sloppy code. He is one of the authors of Storm Applied. ---

  • Hold for June PWL SF

    GitHub HQ 3.0

  • Scott Vokes on An Efficient Context-Free Parsing Algorithm

    Mini Ori Berenstein on The Slab Allocator https://www.usenix.org/legacy/publications/library/proceedings/bos94/full_papers/bonwick.a Ori's Bio Ori was once evicted from the womb. The experience was unpleasant, and he has never forgiven the world for it. Today, he spends most of his time waving fingers over keyboards in order to inject magic into microwaves. Follow Ori at https://twitter.com/oribernstein --- Main Talk Scott Vokes on "An Efficient Context-Free Parsing Algorithm" by Jay Earley (Communications of the ACM, 1970) http://citeseerx.ist.psu.edu/viewdoc/summary?doi= Scott tells us: This paper introduces the Earley algorithm, which is a fully general parsing algorithm: it's able to parse _any_ context-free grammar, including many too ambiguous or recursive for other parsers to handle without careful restructuring. Instead, it takes ambiguity in stride, and is even able to handle many realistic grammars in linear time. I’ll provide a quick overview of parsing terminology along the way, present the main ideas of the paper (and warn about an infamous bug), and show how it also supports use cases like syntax auto-completion and error messages. Finally, I'll introduce some other important papers that build on it -- understanding the core algorithm unlocks a whole family tree of parsing approaches. There will be a few resources for people who want to learn more about parsing in general, not just generalized parsing. Scott's Bio Among other things, Scott Vokes is the author of theft, a property-based testing library for C. He works on the Compiler Engineering team at Fastly, where he helps make fast things safe, and safe things fast. He's previously worked on embedded systems, compilers, distributed storage systems, and architectural design software, but has always built testing tools along the way. Outside of computers, Scott loves cooking, bicycling, and electronics. He lives in Grand Rapids, MI. Follow Scott at https://twitter.com/silentbicycle ---

  • David Calavera on The QUIC Transport Protocol

    GitHub HQ 3.0

    Mini Omoju Miller on "All The Cool Kids, How Do They Fit In? Popularity and Demographic Biases in RecommenderEvaluation and Effectiveness" (http://proceedings.mlr.press/v81/ekstrand18b/ekstrand18b.pdf) Omoju Bio Omoju is a Senior Machine Learning Data Scientist with Github. She has over a decade of experience in computational intelligence. In the past, she has co-led the non-profit investment in Computer Science Education for Google and served as a volunteer advisor to the Obama administration’s White House Presidential Innovation Fellows. --- Main Talk David Calavera on "The QUIC Transport Protocol: Design and Internet-Scale Deployment": https://research.google.com/pubs/pub46403.html David's Bio David Calavera is the CTO of Netlify, where he and his team are building the best platform for deploying and automating modern web projects. Previously, he was a core member of the Docker Engine project, where he helped developers build the container engine that started the container revolution. David also built enterprise tools for GitHub and has contributed to numerous open source projects, including Go, JRuby, and many others.

  • Cathie Yun on Bulletproofs: Short Proofs for Confidential Transactions and More

    Mini Alan Karp on Comparing Information Without Leaking It. https://www.stat.berkeley.edu/users/aldous/157/Papers/fagin.pdf Alan's Bio Alan got a Ph.D. in Astronomy and was an assistant professor of physics at Dartmouth until he figured out his job was that of a small businessman whose money came from writing grant proposals. After that, he did 15 to life at IBM doing large scale scientific and parallel computing. He then joined HP Labs, where he worked on a variety of projects including being one of the architects of the HP/Intel Itanium processor; E-speak, a platform that was called "web services before there were web services;" Polaris, a virus safe computing environment for Windows; and several other demonstrations that systems can be made more functional and more usable by adding security. After 20+ years, HP Labs came to its senses and kicked him out, but he bamboozled HP Enterprise Services into hiring him. There he designed a Cloud Access Security Broker that was cancelled, resulting in the team being laid off. Alan tried being retired, but didn't like it, so now he's working for Earth Computing, a startup bringing to market a new way to build datacenters. Alan is an IBM licensed keypunch operator. In his spare time, he tends to his late wife's collection of 1,307 candles. --- Main Talk Cathie Yun on "Bulletproofs: Short Proofs for Confidential Transactions and More" https://crypto.stanford.edu/bulletproofs/ Cathie tells us: "Bulletproofs is exciting because it enables us to do faster zero knowledge range proofs, making it more feasible to implement practical confidential assets for blockchain transactions!" Cathie's bio Cathie Yun is a software engineer working on applied cryptography at Chain. She received her bachelor's and master's degrees in computer science from MIT, with a focus on computer systems engineering. When she isn't designing better blockchain protocols, she can be found climbing mountains and practicing aerial silks.

  • Kolton Andrus On Designing and Deploying Internet Scale Services

    Mini Peter Bourgon on CASPaxos: Replicated State Machines without logs https://arxiv.org/pdf/1802.07000.pdf Peter's Bio Peter Bourgon is a distributed systems engineer who has seen things. He's the author of Go kit, a toolkit for microservices; and OK Log, a distributed logging system. He's currently driving the engineering observability initiative within Fastly. Main Talk Kolton Andrus On Designing and Deploying Internet Scale services https://www.usenix.org/legacy/event/lisa07/tech/full_papers/hamilton/hamilton.pdf Kolton's Bio Kolton (https://twitter.com/KoltonAndrus) is co-founder and CEO of Gremlin. Previously he was a Chaos Engineer at Netflix improving streaming reliability and operating the Edge services. He designed and built F.I.T., Netflix’s failure injection service. Prior he improved the performance and reliability of the Amazon Retail website. At both companies he has served as a ‘Call Leader’, managing the resolution of company-wide incidents. Kolton is passionate about building resilient systems, primarily as it lets him break things for fun and profit.