Algorithmic aspects of uncertainty driven scheduling

Seda Ogrenci Memik*, Ankur Srivastava, Eren Kursun, Majid Sarrafzadeh

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

7 Scopus citations

Abstract

In this paper we discuss the algorithmic aspects of uncertainty driven scheduling which is a new design paradigm. Slack oriented design flow could be used to address the uncertainty problem in high level synthesis. We formalize the concept of slack and discuss different variations of the slack driven scheduling problem. The complexity issues are studied in detail and algorithms are proposed to solve the problem. These algorithms and proofs heavily exploit the concepts and techniques of graph theory and combinatorial optimization problems.

Original languageEnglish (US)
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume3
StatePublished - Jan 1 2002
Event2002 IEEE International Symposium on Circuits and Systems - Phoenix, AZ, United States
Duration: May 26 2002May 29 2002

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Algorithmic aspects of uncertainty driven scheduling'. Together they form a unique fingerprint.

Cite this