Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandra, R., Menon, R., Dagum, L., Kohr, D., Maydan, D., McDonald, J.: Parallel Programming in OpenMP. Morgan Kaufmann, San Francisco (2000)
Schloegel, K., Karypis, G., Kumar, V.: Graph Partitioning for High-Performance Scientific Simulations. In: Dongarra, J., et al. (eds.) Sourcebook of parallel computing, Morgan Kaufmann, San Francisco (2003)
Kranz, D., Halstead, R., Mohr, E.: Mul-T, A High-Performance Parallel Lisp ACM SIGPLAN 1989 Conference on Programming Language Design and Implementation, Portland, OR, pp. 81–90 (June 1989)
Mohr, E., Kranz, D., Halstead, R.: Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs IEEE Trans. Parallel Distrib. Syst. 2(3), 264–280 (1991)
Wagner, D., Calder, B.: Leapfrogging: a portable technique for implementing efficient futures. In: Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Halstead, R.: MULTILISP: a language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems (TOPLAS) 7(4), 501–538 (1985)
Zhang, L., Krintz, C., Soman, S.: Efficient Support of Fine-grained Futures in Java International Conference on Parallel and Distributed Computing Systems (PDCS), Dallas, TX (November 2006)
Loidl, H-W., Trinder, P.W., Butz, C.: Tuning Task Granularity and Data Locality of Data Parallel GpH Programs. Parallel Processing Letters 11(4), 471–486 (2001)
Loidl, H.-W.: Granularity in Large-Scale Parallel Functional Programming PhD. Thesis. University of Glasgow (March 1998) Available online, http://www.dcs.gla.ac.uk/~hwloidl/publications/PhD.ps.gz
Alt, M.: Coding Considerations Practical Methods to Maximum Efficiency for Intel Itanium Architecture Intel Corp. (2004)
Abramov, S., Adamovich, A.I., Inyukhin, A., Moskovsky, A., Roganov, V., Shevchuk, E., Yu, S., Vodomerov, A.: OpenTS: An Outline of Dynamic Parallelization Approach. In: Malyshkin, V. (ed.) PaCT 2005. LNCS, vol. 3606, pp. 303–312. Springer, Heidelberg (2005)
Talia, D.: Advances in Programming Languages for Parallel Computing in Annual Review of Scalable Computing, Yuen C.K., pp. 28–58 (2000)
Stroustrup, B.: The Design and Evolution of C++ Addison-Wesley (2004) (in Russian translation: Piter, St.Petersburg 2007)
Intel Thread Building Blocks, Intel Corp., http://www.intel.com/cd/software/products/asmo-na/eng/294797.htm
An, P., et al.: An Adaptive, Generic Parallel C++ Library Wkshp. In: Dietz, H.G. (ed.) LCPC 2001. LNCS, vol. 2624, pp. 193–208. Springer, Heidelberg (2003)
Bischof, H., Gorlatch, S., Leshchinskiy, R.: DatTel: A Data-parallel C++ Template Library. In: HLPP 2003 Second International Workshop on High-Level Parallel Programming and Applications, June 15-17, 2003, Paris, France (2003)
Chiba, S.: A Metaobject Protocol for C++. In: Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), pp. 285–299 (October 1995)
McNamara, B., Smaragdakis, Y.: Functional Programming in C++. In: The 2000 International Conference on Functional Programming (ICFP), September 2000, Montreal, Canada, pp. 18–20 (2000)
Abelson, H., Sussman, G.J.: Structure and Interpretation of Computer Programs. MIT Press, Cambridge (1996)
Randall, K.H.: Cilk: Efficient Multithreaded Computing. Ph. D. Thesis, MIT Department of Electrical Engineering and Computer Science (June 1998)
Luszczek, P., Bailey, D., Dongarra, J., Kepner, J., Lucas, R., Rabenseifner, R., Takahashi, D.: The HPC Challenge (HPCC) Benchmark Suite SC06 Conference Tutorial, IEEE, US, Tampa, Florida (November 12, 2006)
Kuszmaul, B.: A Cilk Response to the HPC Challenge (Class 2) SC06 Conference, IEEE, USA, Tampa, Florida (November 13-16, 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moskovsky, A., Roganov, V., Abramov, S. (2007). Parallelism Granules Aggregation with the T-System. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2007. Lecture Notes in Computer Science, vol 4671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73940-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-73940-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73939-5
Online ISBN: 978-3-540-73940-1
eBook Packages: Computer ScienceComputer Science (R0)