Abstract
This chapter describes algorithms for resource conflict resolution. Resource conflicts occur when multiple operations activate the same hardware resource simultaneously. When all operations in the hardware model have fixed execution delays, conflict resolution becomes part of the scheduling and resource binding tasks. In particular, operations scheduled to different control steps or belonging to mutually exclusive conditional branches can share their hardware resources. Consider for example the force-directed scheduling technique [PK89b]. Operations with similar resources are first scheduled to reduce their concurrency, then they are bound to hardware resources subject to this schedule. The binding step ensures that no resource conflicts will arise. This approach is, however, restricted to bounded delay operations.
This is a preview of subscription content, log in via an institution to check access.
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
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ku, D.C., De Micheli, G. (1992). Resource Conflict Resolution. In: High Level Synthesis of ASICs under Timing and Synchronization Constraints. The Springer International Series in Engineering and Computer Science, vol 177. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2117-1_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2117-1_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5129-8
Online ISBN: 978-1-4757-2117-1
eBook Packages: Springer Book Archive