Information Sciences: an International Journal
Active messages: a mechanism for integrated communication and computation
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Programming models for irregular applications
ACM SIGPLAN Notices - Workshop on languages, compilers and run-time environments for distributed memory multiprocessors
Weak ordering—a new definition
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
A Parallel Completion Procedure for Term Rewriting Systems
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A fine-grained parallel completion procedure
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Efficient support for irregular applications on distributed-memory machines
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
A case study of multi-threaded Gröbner basis completion
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Experiences with non-numeric applications on multithreaded architectures
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
BOS is boss: a case for bulk-synchronous object systems
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Ace: a language for parallel programming with customizable protocols
ACM Transactions on Computer Systems (TOCS)
A hierarchical load-balancing framework for dynamic multithreaded computations
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Runtime Support and Compilation Methods for User-Specified Irregular Data Distributions
IEEE Transactions on Parallel and Distributed Systems
View Caching: Efficient Software Shared Memory for Dynamic Computations
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A quasi-barrier technique to improve performance of an irregular application
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Supporting High Level Programming with High Performance: The Illinois Concert System
HIPS '97 Proceedings of the 1997 Workshop on High-Level Programming Models and Supportive Environments (HIPS '97)
A Parallel Solution to the Cutting Stock Problem for a Cluster of Workstations
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Parallel sparse LU factorization on second-class message passing platforms
Proceedings of the 19th annual international conference on Supercomputing
The design and evaluation of a shared object system for distributed memory machines
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
The Clause-Diffusion Methodology For Distributed Deduction
Fundamenta Informaticae
| Hi-index | 0.00 |
Parallelism with irregular patterns of data, communication and computation is hard to manage efficiently. In this paper we present a case study of the Gro¨bner basis problem, a symbolic algebra application. We developed an efficient parallel implementation using the following techniques. First, a sequential algorithm was rewritten in a transition axiom style, in which computation proceeds by non-deterministic invocations of guarded statements at multiple processors. Next, the algebraic properties of the problem were studied to modify the algorithm to ensure correctness in spite of locally inconsistent views of the share data structures. This was used to design data structures with very little overhead for maintaining consistency. Finally, an application-specific scheduler was designed and tuned to get good performance. Our distributed memory implementation achieves impressive speedups.