Relative Scheduling

  • David C. Ku
  • Giovanni De Micheli
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 177)


As stated earlier, the primary goal of this research is to develop methods of synthesizing hardware from abstract specifications under both detailed timing and synchronization constraints. Detailed timing constraints capture minimum and maximum bounds on the start time of operations; synchronization constraints model handshaking and coordination among concurrent computation threads, and are represented as operations with data-dependent execution delays.


Schedule Algorithm Start Time Longe Path Constraint Graph Source Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1992

Authors and Affiliations

  • David C. Ku
    • 1
  • Giovanni De Micheli
    • 2
  1. 1.Redwood Design AutomationStanford UniversityUSA
  2. 2.Stanford UniversityUSA

Personalised recommendations