Convergence of the discrete FGDLS algorithm

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

The Feedback-Guided Dynamic Loop Scheduling (FGDLS) algorithm [1] is a recent dynamic approach to the scheduling of a parallel loop within a sequential outer loop. Earlier papers have analysed convergence under the assumption that the workload is a positive, continuous, function of a continuous argument (the iteration number). However, this assumption is unrealistic since it is known that the iteration number is a discrete variable. In this paper we extend the proof of convergence of the algorithm to the case where the iteration number is treated as a discrete variable. We are able to establish convergence of the FGDLS algorithm for the case when the workload is monotonically decreasing.

Original languageEnglish
Title of host publicationHigh Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings
Pages233-244
Number of pages12
DOIs
Publication statusPublished - 2005
Event1st International Conference on High Performance Computing and Communcations, HPCC 2005 - Sorrento, Italy
Duration: 21 Sep 200523 Sep 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3726 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Conference on High Performance Computing and Communcations, HPCC 2005
Country/TerritoryItaly
CitySorrento
Period21/09/0523/09/05

Fingerprint

Dive into the research topics of 'Convergence of the discrete FGDLS algorithm'. Together they form a unique fingerprint.

Cite this