Thin locks: featherweight synchronization for Java
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Ownership types for safe programming: preventing data races and deadlocks
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Efficient Parallel Programming with Algorithmic Skeletons
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Software transactional memory: why is it only a research toy?
Communications of the ACM - Remembering Jim Gray
Towards high-performance computational algebra with GAP
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
| Hi-index | 0.00 |
We report on the project of parallelising GAP, a system for computational algebra. Our design aims to make concurrency facilities available for GAP users, while preserving as much of the existing code base (about one million lines of code) with as few changes as possible and without requiring users---a large percentage of whom 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 and via limited use of lockable shared data spaces.