Admin: 1 revision

2011-12-12T10:06:27Z

1 revision

New page

[[Category:WG211]]

<h1>Slice, Partition, and Reforest for Data Access and Distribution</h1>
<h3>William R. Cook</h3>

One of the problems with Remote Procedure Calls (RPC) is that they are
<i>latency additive</i>, meaning that two calls F(G(x)) take twice as long
as a single call to a combined procedure FG(x). We introduce a new
<tt>batch</tt> statement used by clients to compose remote calls into a
single batch for remote execution, with support for sequential composition,
conditionals and loops. More interestingly, batches allow client and remote
computations to be mixed together. The remote computations in a batch are
separated from the location computations and executed in a single remote
service call. The partition is computed using a binding location analysis
similar to binding time analysis. Finally, the primitive data transfered to
and from the remote server is sent in bulk as an intermediate tree structure
defined by <i>reforestation</i>, a new concept that is the inverse of
deforestation. For traditional distributed object systems (RMI and CORBA),
batches obviate the need for proxies and allow Data Transfer Objects and
Server Facades to be created on the fly for fine-grained server interfaces.
Batches are also equivalent to document-oriented Web Services, but provide a
simpler and more flexible programming model. Finally, we suggest that
batches may be an ideal interface to databases. In conclusion, the batch statement is a general-purpose programming construct for program partitioning and reforestation with many applications.

* [[Media:2009-Batches-WG211.pdf | 2009-Batches-WG211.pdf ]]: Slides

==File Attachments==

*[[Media:2009-Batches-WG211.pdf | 2009-Batches-WG211.pdf]]

WG211/M7Cook - Revision history

Admin: 1 revision