Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm
Crossref DOI link: https://doi.org/10.1007/s11786-019-00395-7
Published Online: 2019-05-21
Published Print: 2019-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Andrei, Ştefan
Cheng, Albert M. K.
Rădulescu, Vlad
Text and Data Mining valid from 2019-05-21
Version of Record valid from 2019-05-21
Article History
Received: 15 February 2017
Revised: 11 June 2018
Accepted: 25 February 2019
First Online: 21 May 2019