OR Forum—Perspectives on Parallel Computing

G. A. P. Kindervater, J. K. Lenstra and A. H. G. Rinnooy Kan
Additional contact information
G. A. P. Kindervater: Erasmus University, Rotterdam, The Netherlands
J. K. Lenstra: Eindhoven University of Technology, Eindhoven, The Netherlands
A. H. G. Rinnooy Kan: Erasmus University, Rotterdam, The Netherlands

Operations Research, 1989, vol. 37, issue 6, 985-990

Abstract: Operations research is one problem domain that is likely to benefit from advances in parallel computing. We briefly review what has been achieved in recent years and try to sketch what may be expected in the near future. We argue that the lack of uniformity in available architectures is the main obstacle for the breakthrough of parallel computing. Also, formal techniques will have to be developed for the design and implementation of efficient parallel algorithms, and more realism will be required in theoretical models of parallel computation.

Keywords: analysis of algorithms: parallel complexity; computers/computer science: parallel architectures; programming: parallel integer and nonlinear optimization (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.6.985 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:6:p:985-990

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().