Leveraging the Bandwidth/Latency Tradeoffs of Modern Networks via Software Abstraction

Friday, November 4, 2011 - 11:15am - 12:15pm

Computer Science - Seminar Event

Location: Torgerson 2150

The speaker is Prof. Eli Tilevich from the Department of Computer Science at Virginia Tech. The abstract of his talk is as follows: As computing is becoming increasingly distributed, network programming has come to the forefront of developing computing applications. Modern networks are characterized by continuously expanding bandwidths, with latencies remaining the main performance bottleneck. As a result, distributed applications must effectively leverage the bandwidth/latency tradeoffs of modern networks to achieve the requisite performance. Unfortunately, the Remote Procedure Call (RPC)—the foundation of the majority of distributed programming abstractions—is inefficient when invoking multiple remote operations. Furthermore, numerous proposals to optimize latency within traditional RPC have side-effects that are often as bad as the problem they are meant to solve. In this talk, I will present an alternative to RPC—Remote Batch Invocation (RBI)—that offers language support for explicit client-defined remote batches. A Remote Batch statement combines remote and local execution: all the remote code is executed in a single round-trip to the server, in which all data sent to the server and results from the batch are communicated in bulk. In addition to effectively batching remote calls, RBI seamlessly supports iteration, conditionals, and local handling of remote exceptions. RBI enables large-granularity, stateless remote interactions, characteristic of cloud computing, thereby offering a convenient and efficient software abstraction for developing modern distributed applications.

Contact: T. M. Murali
Email: murali@cs.vt.edu
Phone: 5402318534

Website


View Full Calendar ->