Accession Number:

ADA210722

Title:

Optimization Algorithms for New Computer Architectures with Applications to Personnel Assignment Models

Descriptive Note:

Annual rept. (Final) 1 May 1988-30 Apr 1989

Corporate Author:

SOUTHERN METHODIST UNIV DALLAS TX DEPT OF COMPUTER SCIENCE AND ENGINEERING

Personal Author(s):

• Kennington, Jeffery L.
• Helgason, Richard V.

Report Date:

1989-06-29

Pagination or Media Count:

97.0

Abstract:

One of the most important computer architecture innovations to appear in the market place during the last ten years is parallel processing on a shared memory multicomputer. This report presents our empirical results on a Sequent Symmetry S81 on four optimization models which are used in the area of personnel assignment. Both the detailed algorithms and computational results are presented. Contents Minimal Spanning Trees - An Empirical Investigation of Parallel Algorithms Dijkstras Two-tree Shortest Path Algorithm An Empirical Analysis of the Dense Assignment Problem and, Solving Generalized Network Problems on a Shared Memory Multiprocessor.

Descriptors:

• *COMPUTER ARCHITECTURE
• *ALGORITHMS
• *OPTIMIZATION
• NETWORKS
• COMPUTERS
• PATHS
• PARALLEL PROCESSING
• MEMORY DEVICES
• TREES
• HIGH DENSITY
• MULTIPROCESSORS
• BILLETS(PERSONNEL)
• MODELS
• COMPUTATIONS
• TIME SHARING
• EXPERIMENTAL DATA

Subject Categories:

• Operations Research
• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE