Skip to main navigation Skip to search Skip to main content

Scheduling under data and control dependencies for heterogeneous architectures

  • University of Cincinnati

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

Abstract

This paper presents a list-scheduling algorithm for graphs with data and control dependencies. We assume that tasks are partitioned between hardware resources as scheduling takes place after partitioning in our co-synthesis tool. Control dependencies are introduced by if statements, and model complementary functionalities. A detailed discussion of our algorithm is presented. Extensive experimental work shows the effectiveness of our method for generating close-to-optima schedules in short run-times.

Original languageEnglish
Pages602-608
Number of pages7
StatePublished - 1998
EventProceedings of the 1998 IEEE International Conference on Computer Design - Austin, TX, USA
Duration: Oct 5 1998Oct 7 1998

Conference

ConferenceProceedings of the 1998 IEEE International Conference on Computer Design
CityAustin, TX, USA
Period10/5/9810/7/98

Fingerprint

Dive into the research topics of 'Scheduling under data and control dependencies for heterogeneous architectures'. Together they form a unique fingerprint.

Cite this