LINEAR SCHEDULING IS NEARLY OPTIMAL-Reference-Cited by-同舟云学术

LINEAR SCHEDULING IS NEARLY OPTIMAL

Published:1991-12 Issue:02 Volume:01 Page:73-81
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

DARTE ALAIN¹²³,KHACHIYAN LEONID¹²³,ROBERT YVES¹²³

Affiliation:

1. Laboratoire LIP-IMAG, Ecole Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France

2. Dept. of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA

3. Computing Center of the USSR Academy of Sciences, Moscow, Russia

Abstract

This paper deals with the problem of finding optimal schedulings for uniform dependence algorithms. Given a convex domain, let Tf be the total time needed to execute all computations using the free (greedy) schedule and let Tl be the total time needed to execute all computations using the optimal linear schedule. Our main result is to bound Tl/Tf and Tl − Tf for sufficiently "fat" domains.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626491000021

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Understanding the Theory of Karp, Miller and Winograd;Journal of Applied Mathematics and Physics;2024

2. Code Generation for In-Place Stencils;Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization;2023-02-17

3. An Interactive Visual Tool for Code Optimization and Parallelization Based on the Polyhedral Model;2016 45th International Conference on Parallel Processing Workshops (ICPPW);2016-08

4. Extended lattice-based memory allocation;Proceedings of the 25th International Conference on Compiler Construction;2016-03-17

5. Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs;Parallel Processing and Applied Mathematics;2016