Algorithmic aspects of uncertainty driven scheduling
Seda Öǧrenci Memik, Ankur Srivastava, Eren Kursun, Majid Sarrafzadeh · 2003
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.