Buffer-aware bounds to multi-point progressive blocking in priority-preemptive NoCs.
Leandro Soares IndrusiakAlan BurnsBorislav NikolicPublished in: DATE (2018)
Keyphrases
- priority queue
- lower bound
- upper bound
- upper and lower bounds
- tight bounds
- scheduling problem
- error bounds
- buffer size
- worst case
- data structure
- low priority
- lower and upper bounds
- record linkage
- scheduling algorithm
- high priority
- single machine
- processing times
- priority scheduling
- genetic algorithm
- buffer overflow
- run length coding
- neural network
- distribution free
- service times
- average case
- special case
- case study
- learning algorithm
- machine learning