Optimization algorithms for new computer architectures with application to routing and scheduling (Year 3). Final report, 1 May 1989-30 September 1990

Technical Report · Mon Oct 01 04:00:00 EDT 1990

OSTI ID:5927692

Kennington, J L; Helgason, R V

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 new algorithms for a variety of network models along with empirical analysis on both sequential and parallel computers. An empirical study on the AT and T KORBX system is also presented. This system uses eight processors each of which has vector capability. Our research program objective is to develop and empirically test new parallel algorithms and software for a wide variety of optimization problems. The problems studied this past year include the shortest path problem, the assignment problem, the semi-assignment problem, the transportation problem, and the generalized network problem. Algorithms for all of these models have been developed and empirically tested on a variety of computers. In addition, we worked with the Military Airlift Command to test the ATT KORBX system located at Scott Air Force Base.

• Research Organization: Southern Methodist Univ., Dallas, TX (USA). Dept. of Computer Science and Engineering
• OSTI ID: 5927692
• Report Number(s): AD-A-228542/7/XAB; SMU--5-25104D; CNN: AFOSR-87-0199
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTER NETWORKS
COMPUTERS
DATA
DATA PROCESSING
DOCUMENT TYPES
EXPERIMENTAL DATA
INFORMATION
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
MEMORY DEVICES
MILITARY FACILITIES
NUMERICAL DATA
OPTIMIZATION
PARALLEL PROCESSING
PROCESSING
PROGRAMMING
PROGRESS REPORT
REAL TIME SYSTEMS
ROUTING
TASK SCHEDULING
VECTOR PROCESSING