Summary
In this chapter we will survey the techniques of the design of algorithms that effectively solve the computational problems of the previous chapters on parallel computers, reaching a substantial (and frequently dramatic) acceleration of the known sequential algorithms. In some cases this requires us to revise the sequential case approach or even to change it completely. We systematically review the state of the art in this area, in particular, the computational complexity estimates, the algorithms supporting them, and the major techniques for the design of effective parallel algorithms. We include several recent research results and techniques, particularly in sections 4 and 6 and in the appendices. The results of Appendices B and C on computing a maximal independent subset of a vector set and the techniques of the design of parallel algorithms demonstrated in Appendix A may be of interest for the designers of combinatorial and graph algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bini, D., Pan, V.Y. (1994). Parallel Polynomial and Matrix Computations. In: Polynomial and Matrix Computations. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0265-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0265-3_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6686-0
Online ISBN: 978-1-4612-0265-3
eBook Packages: Springer Book Archive