By Topic

Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Giaro, K. ; Foundations of Inf. Dept., Tech. Univ. Gdansk, Poland ; Kubale, M. ; Malafiejski, M. ; Piwakowski, K.

Investigates the computational complexity of scheduling of biprocessor tasks on dedicated processors from a mean flow time point of view. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of scheduling graphs. In this way we identify a number of special cases that are either NP-hard or polynomially solvable

Published in:

Emerging Technologies and Factory Automation, 1999. Proceedings. ETFA '99. 1999 7th IEEE International Conference on  (Volume:1 )

Date of Conference:

1999