Abstract
Scheduling and resource assignment are the topics of the second chapter. In particular, the concept of precedence graph is introduced, different related optimization problems are studied, and several examples are presented.
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
Bibliography
Deschamps JP, Imaña JL, Sutter G (2009) Hardware Implementation of Finite-Field Arithmetic. McGraw-Hill, New York.
Hankerson D, Menezes A, Vanstone S (2004) Guide to Elliptic Curve Cryptography. Springer, New York.
López J, Dahab R (1999) Improved Algorithm for Elliptic Curve Arithmetic in GF(2n). Lecture Notes in Computer Science 1556:201–212.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Deschamps, JP., Valderrama, E., Terés, L. (2019). Scheduling and Resource Assignment. In: Complex Digital Circuits. Springer, Cham. https://doi.org/10.1007/978-3-030-12653-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-12653-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12652-0
Online ISBN: 978-3-030-12653-7
eBook Packages: EngineeringEngineering (R0)