MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Mul-T: a high-performance parallel Lisp
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Leapfrogging: a portable technique for implementing efficient futures
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Parallel programming in OpenMP
Parallel programming in OpenMP
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
IEEE Transactions on Parallel and Distributed Systems
Cilk: efficient multithreaded computing
Cilk: efficient multithreaded computing
Graph partitioning for high-performance scientific simulations
Sourcebook of parallel computing
The HPC Challenge (HPCC) benchmark suite
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
STAPL: an adaptive, generic parallel C++ library
LCPC'01 Proceedings of the 14th international conference on Languages and compilers for parallel computing
OpenTS: an outline of dynamic parallelization approach
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Asynchronous Language and System of Numerical Algorithms Fragmented Programming
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Hi-index | 0.00 |
T-system is a tool for parallel computing developed at the PSI RAS. The most recent implementation is available on both Linux and Windows platforms. The paper is dedicated to one of important T-system aspects -- ability to change parallelism granule size at runtime. The technique is available, primarily, for recursive programs, but it's possible to extent it to non-recursive ones as well. In the latter case, we employ C++ template"traits"for program transformation. The technique is shown to reduce overhead incurred by runtime support library dramatically.