Abstract
We present the project of parallelising the computational algebra system GAP. Our design aims to make concurrency facilities available for GAP users, while preserving as much of the existing codebase (about one million lines of code) with as few changes as possible without requiring users (a large percentage of which are domain experts in their fields without necessarily having a background in parallel programming) to have to learn complicated parallel programming techniques. To this end, we preserve the appearance of sequentiality on a per-thread basis by containing each thread within its own data space. Parallelism is made possible through the notion of migrating objects out of one thread’s data space into that of another one, allowing threads to interact.
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
Bacon, D.F., Konuru, R., Murthy, C., Serrano, M.: Thin locks: featherweight synchronization for java. In: PLDI 1998: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, pp. 258–268. ACM, New York (1998)
Behrends, R., Konovalov, A., Linton, S., Lübeck, F., Neunhöffer, M.: Parallelising the computational algebra system GAP. Extended abstract. In: PASCO 2010 (accepted 2010)
Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe programming: preventing data races and deadlocks. In: Proceedings of the 17th ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications. ACM SIGPLAN Notices, vol. 37(11), pp. 211–230. ACM, New York (2002)
The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.4.12 (2008), http://www.gap-system.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behrends, R., Konovalov, A., Linton, S., Lübeck, F., Neunhöeffer, M. (2010). Towards High-Performance Computational Algebra with GAP. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-15582-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15581-9
Online ISBN: 978-3-642-15582-6
eBook Packages: Computer ScienceComputer Science (R0)