This paper is proposing a general periodicity result concerning any deterministic and memoryless scheduling algorithm (including non-work-conserving algorithms), for any context, on identical multiprocessor platforms. By context we mean the hardware architecture (uniprocessor, multicore), as well as task constraints like critical sections,...
-
May 16, 2013 (v1)PublicationUploaded on: December 3, 2022
-
April 4, 2014 (v1)Conference paper
International audience
Uploaded on: October 11, 2023 -
May 16, 2013 (v1)Publication
This paper is proposing a general periodicity result concerning any deterministic and memoryless scheduling algorithm (including non-work-conserving algorithms), for any context, on identical multiprocessor platforms. By context we mean the hardware architecture (uniprocessor, multicore), as well as task constraints like critical sections,...
Uploaded on: October 11, 2023