Hostname: page-component-848d4c4894-v5vhk Total loading time: 0 Render date: 2024-06-26T04:17:42.616Z Has data issue: false hasContentIssue false
  • English
  • Français

Scheduling UET Trees with Communication Delays on two Processors

Published online by Cambridge University Press:  15 August 2002

Frederic Guinand  and
Denis Trystman
Frederic Guinand
Affiliation:
LIH Universite du Havre, BP. 540, 76058 Le Havre Cedex, France.
Denis Trystman
Affiliation:
LMC-IMAG Domaine Universitaire, BP. 53, 38041 Grenoble Cedex, France.
Get access

Abstract

In this paper, we present a new linear time algorithm for scheduling UECT (Unit Execution and Communication Time) trees on two identical processors. The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non UECT tasks.

Keywords

Parallel processingschedulingintreesUECTcommunication Delays.
Type
Research Article
Information
RAIRO - Operations Research , Volume 34 , Issue 2 , April 2000 , pp. 131 - 144
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)