Hits:

Indexed by:期刊论文

Date of Publication:2010-08-01

Journal:ICIC Express Letters

Included Journals:EI、Scopus

Volume:4

Issue:4

Page Number:1325-1330

ISSN No.:1881803X

Abstract:The heterogeneous multiprocessor partitioning problem is a NP-hard problem in the strong sense. In this paper, a novel 1LP(  ,-  ) partitioned scheduling algorithm of sporadic task systems on heterogeneous multiprocessors is presented. A sufficient test is given by an Integer Linear Programming model 1LP(  ,-  ) based on the requirements of the tasks. The solution of 1LP(  ,-  ) is used to get an assignment of the tasks with minimum total utilization. The correctness of the algorithm is proved in this paper. The experiment results show its advantages. ICIC International ? 2010 ISSN 1881-803X.