Satin: Efficient Parallel Divide-and-Conquer in Java

  title={Satin: Efficient Parallel Divide-and-Conquer in Java},
  author={Rob van Nieuwpoort and Thilo Kielmann and Henri E. Bal},
Satin is a system for running divide and conquer programs on distributed memory systems (and ultimately on wide-area metacomputing systems). Satin extends Java with three simple Cilk-like primitives for divide and conquer programming. The Satin compiler and runtime system cooperate to implement these primitives efficiently on a distributed system, using work stealing to distribute the jobs. Satin optimizes the overhead of local jobs using on-demand serialization, which avoids copying and… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 29 extracted citations

DIFOJO: a Java fork/join framework for heterogeneous networks

13th Euromicro Conference on Parallel, Distributed and Network-Based Processing • 2005
View 6 Excerpts
Method Support
Highly Influenced

Parallel skeletons for divide-and-conquer and branch-and-bound techniques

Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings. • 2003
View 1 Excerpt
Highly Influenced

Hierarchical Load Balancing for Charm++ Applications on Large Supercomputers

2010 39th International Conference on Parallel Processing Workshops • 2010
View 1 Excerpt

52 Citations

Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 23 references

A Java fork/join framework

Java Grande • 2000
View 2 Excerpts