\section{Future Directions}

The next step is to take the partitioning, placement and routing methods
described here and incorporate them into a complete implementation
of sparse matrix-vector product on iWarp.
The addition of an inner-product operation will enable us to
implement a complete conjugate-gradient solver for finite-element
calculations.

Another target architecture for this approach is the Connection Machine
CM-5.  The routing methods used on this machine make issues of placement
and routing less important, but partitioning is still an important issue.
% Check with Guy about what should go here.
% Submitted version accidentally included comment to co-authors.

Finally, we are also looking into other implementations of the separator-based
partitioning described in Section 2, including a portable data-parallel 
implementation in NESL.


