Towards high-performance computational algebra with GAP

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Behrends, R., Konovalov, A., Linton, S., Lübeck, F., & Neunhöeffer, M. (2010). Towards high-performance computational algebra with GAP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 58–61). https://doi.org/10.1007/978-3-642-15582-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free