Parallel Programming Archetypes in Combinatorics and Optimization

Abstract

A parallel programming archetype is a language independent program design strategy. We describe two archetypes in combinatorics and optimization, their components, implementations, and example applications developed using an archetype. The goal of this thesis is to study two archetypes in combinatorics and optimization, the Divide-and-Conquer Archetype and the Breach and Bound Archetype, and to demonstrate how these archetypes can be used for the systematic design of efficient sequential and parallel programs. The research whose results are presented in this document is part of the ongoing project on Parallel Programming Archetype.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 12, 1995
Accession Number
ADA451326

Entities

People

  • Svetlana A. Kryukova

Organizations

  • California Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Availability
  • Classification
  • Computer Programming
  • Contracts
  • Information Operations
  • Instructions
  • Language
  • Monitoring
  • Optimization
  • Scientific Research
  • Security
  • Standards

Fields of Study

  • Engineering

Readers

  • Parallel and Distributed Computing.