Change search
ReferencesLink to record
Permanent link

Direct link
Scheduling of Parallel Tasks with Proportionate Priorities
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
Show others and affiliations
2016 (English)In: ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, ISSN 2193-567X, Vol. 41, no 8, 3279-3295 p.Article in journal (Refereed) PublishedText
Abstract [en]

Parallel computing systems promise higher performance for computationally intensive applications. Since programmes for parallel systems consist of tasks that can be executed simultaneously, task scheduling becomes crucial for the performance of these applications. Given dependence constraints between tasks, their arbitrary sizes, and bounded resources available for execution, optimal task scheduling is considered as an NP-hard problem. Therefore, proposed scheduling algorithms are based on heuristics. This paper presents a novel list scheduling heuristic, called the Noodle heuristic. Noodle is a simple yet effective scheduling heuristic that differs from the existing list scheduling techniques in the way it assigns task priorities. The priority mechanism of Noodle maintains a proportionate fairness among all ready tasks belonging to all paths within a task graph. We conduct an extensive experimental evaluation of Noodle heuristic with task graphs taken from Standard Task Graph. Our experimental study includes results for task graphs comprising of 50, 100, and 300 tasks per graph and execution scenarios with 2-, 4-, 8-, and 16-core systems. We report results for average Schedule Length Ratio (SLR) obtained by producing variations in Communication to Computation cost Ratio. We also analyse results for different degree of parallelism and number of edges in the task graphs. Our results demonstrate that Noodle produces schedules that are within a maximum of 12 % (in worst-case) of the optimal schedule for 2-, 4-, and 8-core systems. We also compare Noodle with existing scheduling heuristics and perform comparative analysis of its performance. Noodle outperforms existing heuristics for average SLR values.

Place, publisher, year, edition, pages
Springer, 2016. Vol. 41, no 8, 3279-3295 p.
Keyword [en]
List scheduling, Static task scheduling, Directed acyclic graph (DAG), Multiprocessor, Multicore, Parallel computing
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-190655DOI: 10.1007/s13369-016-2180-9ISI: 000378946400040ScopusID: 2-s2.0-84976530428OAI: oai:DiVA.org:kth-190655DiVA: diva2:953335
Note

QC 20160817

Available from: 2016-08-17 Created: 2016-08-12 Last updated: 2016-08-17Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Brorsson, Mats
By organisation
Software and Computer systems, SCS
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 18 hits
ReferencesLink to record
Permanent link

Direct link