[Swift-commit] r3921 - text/parco10submission

[noreply at svn.ci.uchicago.edu]

Author: dsk
Date: 2011-01-08 19:38:14 -0600 (Sat, 08 Jan 2011)
New Revision: 3921

Modified:
   text/parco10submission/paper.tex
Log:
a small change


Modified: text/parco10submission/paper.tex
===================================================================
--- text/parco10submission/paper.tex	2011-01-09 01:32:32 UTC (rev 3920)
+++ text/parco10submission/paper.tex	2011-01-09 01:38:14 UTC (rev 3921)
@@ -1539,7 +1539,7 @@
 scheduling Coasters workers using the standard job submission
 techniques and employing an internal IP network.
 
-In order to achieve automatic parallelization in Swift, we ubiquitously employ futures and lightweight threads, which result in eager and massive parallelism but which has a large cost in terms of space and internal object management. We are exploring several alternatives to optimize this tradeoff and increase Swift scalability to ever larger task graphs. The solution space here includes ``lazy futures (whose computation is delayed until a value is first needed)'' and distributed task graphs with multiple, distributed evaluation engines running on separate compute nodes.
+In order to achieve automatic parallelization in Swift, we ubiquitously employ futures and lightweight threads, which results in eager and massive parallelism but which has a large cost in terms of space and internal object management. We are exploring several alternatives to optimize this tradeoff and increase Swift scalability to ever larger task graphs. The solution space here includes ``lazy futures (whose computation is delayed until a value is first needed)'' and distributed task graphs with multiple, distributed evaluation engines running on separate compute nodes.
 
 \subsection{Filesystem access optimizations}