Accession Number:

ADA091572

Title:

Binary Trees and Parallel Scheduling Algorithms.

Descriptive Note:

Technical rept. Jul 80-Sep 80,

Corporate Author:

MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1980-09-01

Pagination or Media Count:

37.0

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.

Subject Categories:

  • Theoretical Mathematics
  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE