Optimization Algorithms for New Computer Architectures with Application to Routing and Scheduling (Year 3)

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 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 AT&T KORBX system located at Scott Air Force Base. (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1990
Accession Number
ADA228542

Entities

People

  • Jeffrey L. Kennington
  • Richard V. Helgason

Organizations

  • Southern Methodist University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Facilities
  • Airlift Operations
  • Algorithms
  • Computer Architecture
  • Computer Science
  • Computers
  • Computing System Architectures
  • Engineering
  • Engineers
  • Executives
  • Floating Point Operations
  • Operations Research
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Transportation

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Operations Research
  • Parallel and Distributed Computing.