Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

Kasahara, Hironori; Narita,

doi:10.1109/tc.1984.1676376

Cited by 396 publications

(113 citation statements)

References 13 publications

Supporting

Mentioning

112

Contrasting

Unclassified

Order By: Relevance

“…This algorithm does not guarantee the optimal result but it should provide near-optimal solutions. This algorithm is based on the CP/MISF approach [10], which is regarded as the most effective heuristic approach for multiprocessor scheduling problem. Our task scheduling problem can be viewed as an extension of traditional minimal execution time multiprocessor scheduling problem [1].…”

Section: Task Schedulingmentioning

confidence: 99%

Assigning Tasks in a 24-Hour Software Development Model

Jalote¹,

Jain²

11th Asia-Pacific Software Engineering Conference

View full text Add to dashboard Cite

show abstract

Section: Task Schedulingmentioning

confidence: 99%

Assigning Tasks in a 24-Hour Software Development Model

Jalote¹,

Jain²

11th Asia-Pacific Software Engineering Conference

View full text Add to dashboard Cite

show abstract

“…In [5], Kasahara and Narita propose a list-based scheduling algorithm, named CP/MISF (critical path/most immediate successor first). The CP/MISF algorithm is designed for task scheduling without data parallelism.…”

Section: A Motivating Examplementioning

confidence: 99%

Novel List Scheduling Strategies for Data Parallelism Task Graphs

Liu

Meng

Taniguchi

et al. 2014

IJNC

View full text Add to dashboard Cite

This paper studies task scheduling algorithms which schedule a set of tasks on multiple cores so that the total scheduling length is minimized. Most of the algorithms developed in the past assume that a task is executed on a single core. Unlike the previous algorithms, the algorithms studied in this paper allow a task to be executed on multiple cores. This paper proposes six algorithms. All of the six algorithms are based on list scheduling, but the strategy for priority assignment is different. In our experiments, the six algorithms as well as an integer linear programming method are evaluated.

show abstract

“…L'efficacité de l'heuristique HLFET (les résultats expérimentaux obtenus par [1] montrent que l'heuristique HLFET retourne des solutions qui sont à moins de 5% de la solution optimale dans 90% des cas), sa faible complexité en O (n 2 ) et sa robustesse justifient sa sélection parmi l'ensemble des algorithmes d'ordonnancement par liste. Cette heuristique a d'ailleurs été reprise pour développer de nombreux algorithmes [19], [9].…”

Section: Les Algorithmes D'ordonnancement Par Listeunclassified

Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques

Norre¹

1994

RAIRO-Oper. Res.

View full text Add to dashboard Cite

Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

Cited by 396 publications

References 13 publications

Assigning Tasks in a 24-Hour Software Development Model

Assigning Tasks in a 24-Hour Software Development Model

Novel List Scheduling Strategies for Data Parallelism Task Graphs

Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques

Contact Info

Product

Resources

About