Abstract
Operation scheduling (OS) is an important task in the high-level synthesis process. An inappropriate scheduling of the operations can fail to exploit the full potential of the system. In this chapter, we try to give a comprehensive coverage on the heuristic algorithms currently available for solving both timing and resource constrained scheduling problems. Besides providing a broad survey on this topic, we focus on some of the most popularly used algorithms, such as List Scheduling, Force-Directed Scheduling and Simulated Annealing, as well as the newly introduced approach based on the Ant Colony Optimization meta-heuristics. We discuss in details on their applicability and performance by comparing them on solution quality, performance stability, scalability, extensibility, and computation cost.Moreover, as an application of operation scheduling, we introduce a novel uniformed design space exploration method that exploits the duality of the time and resource constrained scheduling problems, which automatically constructs a high quality time/area tradeoff curve in a fast, effective manner.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science + Business Media B.V
About this chapter
Cite this chapter
Wang, G., Gong, W., Kastner, R. (2008). Operation Scheduling: Algorithms and Applications. In: Coussy, P., Morawiec, A. (eds) High-Level Synthesis. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8588-8_13
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8588-8_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8587-1
Online ISBN: 978-1-4020-8588-8
eBook Packages: EngineeringEngineering (R0)