Optimal Selection Theory for Superconcurrency

Abstract

This paper describes a mathematical programming approach to finding an optimal, heterogeneous suite of processors to solve supercomputing problems. This technique, called superconcurrency, works best when the computational requirements are diverse and significant portions of the code are not tightly- coupled. It is also dependent on new methods of benchmarking and code profiling, as well as eventual use of AI techniques for intelligent management of the selected superconcurrent suite. (jhd)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1989
Accession Number
ADA215399

Entities

People

  • Richard F. Freund

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Command And Control
  • Command Centers
  • Computer Programming
  • Computers
  • Computing System Architectures
  • Cost Effectiveness
  • Costs
  • Mathematical Programming
  • Military Research
  • Network Protocols
  • Numbers
  • Parallel Computing
  • Parallel Processors
  • Standards
  • Supercomputers

Fields of Study

  • Physics

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design