Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm

Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu. Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm. Mathematics in Computer Science, 13(4):489-515, 2019. [doi]

Authors

Stefan Andrei

This author has not been identified. Look up 'Stefan Andrei' in Google

Albert M. K. Cheng

This author has not been identified. Look up 'Albert M. K. Cheng' in Google

Vlad Radulescu

This author has not been identified. Look up 'Vlad Radulescu' in Google