Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm.
Stefan AndreiAlbert M. K. ChengVlad RadulescuPublished in: Math. Comput. Sci. (2019)
Keyphrases
- scheduling algorithm
- single processor
- scheduling problem
- upper bound
- lower bound
- high speed
- parallel processing
- information systems
- response time
- single chip
- single machine
- computationally efficient
- multi core processors
- error detection
- computer architecture
- steady state
- database
- computer systems
- case study
- neural network