Title

On parallelization of static scheduling algorithms

Keywords

Macro dataflow graph; Modified critical-path algorithm; Parallel scheduling algorithm; Static scheduling

Abstract

Most static algorithms that schedule parallel programs represented by macro dataflow graphs are sequential. This paper discusses the essential issues pertaining to parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms. © 1997 IEEE.

Publication Date

12-1-1997

Publication Title

IEEE Transactions on Software Engineering

Volume

23

Issue

8

Number of Pages

517-528

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/32.624307

Socpus ID

0008576592 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0008576592

This document is currently not available here.

Share

COinS