Uniprocessor scheduling under precedence constraints for embedded systems design.
Leonardo MangerucaMassimo BaleaniAlberto FerrariAlberto L. Sangiovanni-VincentelliPublished in: ACM Trans. Embed. Comput. Syst. (2007)
Keyphrases
- embedded systems
- precedence constraints
- scheduling problem
- low cost
- embedded software
- hardware software
- branch and bound algorithm
- embedded devices
- parallel processors
- hw sw
- precedence relations
- real time systems
- resource limited
- release dates
- computing power
- single machine scheduling problem
- parallel machines
- single machine
- setup times
- partially ordered
- sequence dependent setup times
- software architecture
- software systems
- real time embedded
- computational complexity
- approximation algorithms
- maximum lateness
- vertex cover
- tabu search
- unit length