Speaker: Matthew Yurkewych
<br>
<br>
Title: Optimal Schedules for Some Common Computation-Dags on the Internet
<br>
<br>
Within the framework of the W-O Pebble Game - an abstract model for the
process of scheduling a computation dag on the Internet - we derive
strategies for scheduling three common families of computation-dags that
minimize the likelihood of the gridlock that can occur when a computation
stalls pending the return of intermediate results by remote participants.  
We show that the strategies can produce schedules that (nearly) minimize
the memory requirements of computations, even as they minimize the
likelihood of gridlock.

This talk will highlight results from the paper bearing the same title, 
co-authored by Arnold Rosenberg and myself.