One-dimensional optimization on multiprocessor systems

Authors:
Mark A. Franklin;Norman L. Soong
Affiliations:
Departments of Electrical Engineering and Computer Science, Washington University, St, Louis, MO;Sperry-Univac, Blue Bell, PA
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 7
Cited 0

Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems

Journal of the ACM (JACM)
Computer Interconnection Structures: Taxonomy, Characteristics, and Examples

ACM Computing Surveys (CSUR)
A Survey of Parallel Machine Organization and Programming

ACM Computing Surveys (CSUR)
Optimal Searching Algorihtms for Parallel Pipelined Computers

Proceedings of the Sagamore Computer Conference on Parallel Processing
The design and analysis of algorithms for asynchronous multiprocessors.

The design and analysis of algorithms for asynchronous multiprocessors.
Performance evaluation of multiple processor systems.

Performance evaluation of multiple processor systems.
Parallel Solution of Ordinary Differential Equations

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper presents a straightforward approach to determining how best to utilize an MIMD multiprocessor in the solution of one-dimensional optimization problems involving continuous unimodal functions and nongradient search techniques. A methodology is presented which allows one to consider a variety of speedup functions which may occur in parallel function and systems evaluation. It is shown how the best of two parallel optimization strategies can be determined for a given accuracy, number of processors, and speedup function.