Satin extends Java with Cilk like primitives that make it very convenient for the programmer to write divide and conquer style programs. Unlike manager/worker programs, divide-and-conquer algorithms operate by recursively dividing a problem into smaller subproblems. This recursive subdivision goes on until the remaining subproblem becomes trivial to solve. After solving subproblems, their results are recursively recombined until the final solution is assembled. Due to it’s hierarchical nature, the divide-and-conquer model maps cleanly to grid systems, which also tend to have an hierarchical structure. Satin contains a efficient and simple load-balancing algorithm, Cluster-aware Random Stealing (CRS), which outperforms existing load- balancing strategies on multi-cluster systems. In addition, Satin also provides efficient fault-tolerance, malleability (e.g. the ability to cope with dynamically changing number of processors) and migration in a way that is transparent to the application.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Zhang, Lingli; Krintz, Chandra: As-if-serial exception handling semantics for Java futures (2009)
- Cung, Van Dot; Danjean, Vincent; Dumas, Jean-Guillaume; Gautier, Thierry; Huard, Guillaume; Raffin, Bruno; Rapine, Christophe; Roch, Jean-Louis; Trystram, Denis: Adaptive and hybrid algorithms: classification and illustration on triangular system solving (2006)
- Li, Zhen; Parashar, Manish: A decentralized computational infrastructure for Grid-based parallel asynchronous iterative applications (2006)
- Li, Zhen; Parashar, Manish: A decentralized computational infrastructure for grid-based parallel asynchronous iterative applications (2006)
Further publications can be found at: http://www.cs.vu.nl/ibis/papers.html#satin