Binary Trees and Parallel Scheduling Algorithms.

Abstract

This paper examines the use of binary trees in the design of efficient parallel algorithms. Using binary trees, we develop efficient algorithms for several scheduling problems. The shared memory model for parallel computation is used. Our success in using binary trees for parallel computations, indicates that the binary tree is an important and useful design tool for parallel algorithms.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1980
Accession Number
ADA091572

Entities

People

  • Eliezer Dekel
  • Sartaj Sahni

Organizations

  • University of Minnesota

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Instructions
  • Intervals
  • Minnesota
  • Parallel Computing
  • Parallel Processing
  • Parallel Processors
  • Permutations
  • Scheduling (Production)
  • Sequences
  • Time Intervals
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Parallel and Distributed Computing.