Home > Papers

 
 
A Worst-Case Pattern of Task Load Allocation and Execution for Multiprocessor Global Real-Time Scheduling
Fengxiang Zhang 1 *,Alan Burns 2
1.School of Computer and Information Science, Southwest University, China
2.Department of Computer Science, University of York, UK
*Correspondence author
#Submitted by
Subject:
Funding: National Nature Science Foundation of China (No.Grant No. 61202042), Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry of Chin)
Opened online: 2 September 2015
Accepted by: none
Citation: Fengxiang Zhang,Alan Burns.A Worst-Case Pattern of Task Load Allocation and Execution for Multiprocessor Global Real-Time Scheduling[OL]. [ 2 September 2015] http://en.paper.edu.cn/en_releasepaper/content/4653089
 
 
Multiprocessor scheduling is known to be an NP-hard optimization problem, and no worst-case job arrival sequences have been identified for global scheduling real-time systems. In this paper, we present a novel idea to solve the problem of worst-case scenarios in global scheduling, and firstly introduce a hypothetical parallel executing system where any job except the studied one can be executed in parallel on all processors at any instant in time, we prove that such a hypothetical system leads to a worst-case scenario of any studied job's schedulability, therefore, the proposed results can be used for solving schedulability problems of multiprocessor global scheduling.
Keywords:real-time systems; multiprocessor systems; scheduling; schedulability; task load allocation
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 233
Bookmarked 0
Recommend 5
Comments Array
Submit your papers