Communication sensitive rotation scheduling

Author

Tongsima, Sissades ; Passos, Nelson L. ; Sha, Edwin H M

Author_Institution

Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA

fYear

1994

fDate

10-12 Oct 1994

Firstpage

150

Lastpage

153

Abstract

Loop pipelining (retiming) is a valuable tool used to explore parallelism across iterations. Few results are available about loop pipelining with data communication considerations. This paper first designs a modified list scheduling algorithm to be used as a subroutine in a novel technique called “communication sensitive rotation scheduling”. Such a technique explores loop pipelining properties while handling the underlying imposed communication environment. An initial schedule is transformed to a more compact one under resource constraints

Keywords

graph theory; parallel algorithms; parallel processing; pipeline processing; scheduling; subroutines; communication sensitive rotation scheduling; data communication considerations; imposed communication environment; list scheduling algorithm; loop pipelining; parallelism; resource constraints; retiming; subroutine; Algorithm design and analysis; Communication system control; Computer science; Costs; Data communication; Flow graphs; Parallel processing; Pipeline processing; Processor scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design: VLSI in Computers and Processors, 1994. ICCD '94. Proceedings., IEEE International Conference on

Conference_Location

Cambridge, MA

Print_ISBN

0-8186-6565-3

Type

conf

DOI

10.1109/ICCD.1994.331876

Filename

331876