Making Systems More Robust with Flexible RPC Lookup
Russell Power

TL;DR
This paper proposes extending RPC name resolution to simplify distributed system design, reducing boilerplate code and increasing robustness by improving how applications resolve service names.
Contribution
It introduces a novel approach to enhance RPC lookup mechanisms, making distributed systems more resilient and easier to develop without extensive boilerplate code.
Findings
Reduced boilerplate code in distributed applications
Improved robustness of service name resolution
Simplified application development process
Abstract
Modern distributed systems use names everywhere. Lockservices such as Chubby and ZooKeeper provide an effective mechanism for mapping from application names to server instances, but proper usage of them requires a large amount of error-prone boiler-plate code. Application programmers often try to write wrappers to abstract away this logic, but it turns out there is a more general and easier way of handling the issue. We show that by extending the existing name resolution capabilities of RPC libraries, we can remove the need for such annoying boiler-plate code while at the same time making our services more robust.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Parallel Computing and Optimization Techniques · Advanced Data Storage Technologies
