Referenced Items are not available for this document.
Parallel implementations of the computationally intensive task of solving multiple quadratic forms (MQFs) have been examined. Coupled and uncoupled parallel methods are investigated, where coupling relates to the degree of interaction among the processors. Also, the impact of partitioning a large MQF problem into smaller non-interacting subtasks is studied. Trade-offs among the implementations fo various data-size/machine-size ratios are categorized in terms of complex arithmetic operation counts, communicatino overhead, and memory storage requirements.
Published in:
Parallel Processing, 1993. ICPP 1993. International Conference on
(Volume:3
)
Date of Conference: 16-20 Aug. 1993
- Page(s):
- 37 - 46
- ISSN :
- 0190-3918
- Print ISBN:
- 0-8493-8983-6
- Conference Location :
- Syracuse, NY, USA
- Digital Object Identifier :
- 10.1109/ICPP.1993.120
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
