Article

Free access

Scheduling reductions

Authors:

Xavier Redon and

Paul FeautrierAuthors Info & Claims

ICS '94: Proceedings of the 8th international conference on Supercomputing

July 1994

Pages 117 - 125

https://doi.org/10.1145/181181.181319

Published: 16 July 1994 Publication History

PDF eReader

Abstract

In order to detect more parallelism in scientific programs, one may extract a parallelism relative to reductions. This paper presents such a method which schedules programs with explicit computations of reductions. We describe the way the reductions are expressed in our input language (which is in fact the output language of the reductions detector presented in [RF93]). We also give a brief summary of scheduling techniques. In order to simplify the scheduling we suppose that the target parallel computer has an infinite number of processors with infinite fan-in. We show that a schedule computed with this model can be adapted to work on real parallel machines. Then we present a scheduling method based on the algorithms from [Fea92a, Fea92b] which works in presence of reductions. This method is applied on an example. Lastly, we show that side-effects of reductions scheduling are the simplification of the scheduling process and the improvement of the computed schedules.

References

[1]

D. Callahan. Recognizing and Parallelizing bounded recurrences. In U. Banerjee et al. (Eds.), editor, Proc. of the Fourth International Workshop on Languages and Compilers for Parallel Computing, Santa Clara, CA, pages 266-282. Springer-Verlag, August 1991. LNCS 589.

Digital Library

Google Scholar

[2]

Paul Feautrier. Parametric integer programming. RAIRO Recherche Operationnelle, 22:243- 268, September 1988.

Crossref

Google Scholar

[3]

Paul Feautrier. Some efficient solutions to the affine scheduling problem, part i, one dimensional time. Int. J. of Parallel Programming, 21(5):313- 348, October 1992.

Digital Library

Google Scholar

[4]

Paul Feautrier. Somme efficient solution to the affine scheduling problem, part ii, multidimensional time. Int. J. of Parallel Programming, 21(6):389-420, December 1992.

Crossref

Google Scholar

[5]

Kenneth A. Iverson. A Programming Language. Jonh Wiley & Sons, New York, 1962.

Digital Library

Google Scholar

[6]

Christophe Mauras. Alpha : un langage equationnel pour la conception et la programmation d'architectures paralleles synchrones. PhD thesis, Universite de Rennes I, December 1989.

Google Scholar

[7]

Y.-I. Choo M. Chen and J. Li. CrystM: From functional description to effident parallel code. In G. Fox, editor, Proc. of the Third Conference on Hypercube Concurrent Computers and Applications, pages 417-433. ACM, New York, USA, 1988.

Digital Library

Google Scholar

[8]

A. Nicolau and H. Wang. Optimal schedules for parallel prefix computation with bounded resources. In Third ACM SIGPLAN Symposium on Principles and and Pratice of Parallel Programming PPOPP, April 1991.

Digital Library

Google Scholar

[9]

William Pugh. Uniform techniques for loop optimization. ACM Conf. on Supercomputing, pages 341-352, January 1991.

Digital Library

Google Scholar

[10]

Patrice Quinton. Mapping recurrences on parallel architectures. In 3rd Int. Conf. on Supercomputing, Boston, May 1988.

Google Scholar

[11]

X. Redon and P. Feautrier. Detection of reductions in sequentials programs with loops. In Arndt Bode, Mike Reeve, and Gottfried Wolf, editors, Procs of the 5th International Parallel Architectures and Languages Europe, pages 132-145, June 1993.

Digital Library

Google Scholar

[12]

Mourad Raji-Werth and Paul Feautrier. Systematic construction of programs for distributed memory systems. In Paul Feautrier and Francois Irigoin, editors, Procs of the Int. Workshop on Compiler for Parallel Computers, Paris, December 1990.

Google Scholar

Cited By

View all

Ginsbach PRemmelg TSteuwer MBodin BDubach CO'Boyle M(2018)Automatic Matching of Legacy Code to Heterogeneous APIsACM SIGPLAN Notices10.1145/3296957.317318253:2(139-153)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173182
Ginsbach PRemmelg TSteuwer MBodin BDubach CO'Boyle MShen XTuck JBianchini RSarkar V(2018)Automatic Matching of Legacy Code to Heterogeneous APIsProceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3173162.3173182(139-153)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3173162.3173182
Ginsbach PO'Boyle MReddi VSmith ATang L(2017)Discovery and exploitation of general reductions: a constraint based approachProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049862(269-280)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3049832.3049862
Show More Cited By

Index Terms

Scheduling reductions
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Scheduling
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Graph reductions and partitioning heuristics for multicore DAG scheduling
Abstract
The design of cyber–physical systems (CPSs) is facing the explosion of new functionalities requiring increased computation capacities and, thus, the introduction of multi-core processors. Moreover, some functionalities may impose precedence ...
Read More
Early-release fair scheduling
Euromicro-RTS'00: Proceedings of the 12th Euromicro conference on Real-time systems

We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial ...
Read More
EDZL Scheduling Analysis
ECRTS '07: Proceedings of the 19th Euromicro Conference on Real-Time Systems

A schedulability test is derived for the global Earliest Deadline Zero Laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic ...
Read More

Comments

Information & Contributors

Information

Published In

ICS '94: Proceedings of the 8th international conference on Supercomputing

July 1994

452 pages

ISBN:0897916654

DOI:10.1145/181181

Chairmen:
John Gurd
Univ. of Manchester, Manchester, UK
,
William Jalby
Univ. de Versailles, France

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 July 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS94

Sponsor:

SIGARCH

ICS94: International Conference on Supercomputing '94

July 11 - 15, 1994

Manchester, England

Acceptance Rates

ICS '94 Paper Acceptance Rate 45 of 114 submissions, 39%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
316
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ginsbach PRemmelg TSteuwer MBodin BDubach CO'Boyle M(2018)Automatic Matching of Legacy Code to Heterogeneous APIsACM SIGPLAN Notices10.1145/3296957.317318253:2(139-153)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3296957.3173182
Ginsbach PRemmelg TSteuwer MBodin BDubach CO'Boyle MShen XTuck JBianchini RSarkar V(2018)Automatic Matching of Legacy Code to Heterogeneous APIsProceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3173162.3173182(139-153)Online publication date: 19-Mar-2018
https://dl.acm.org/doi/10.1145/3173162.3173182
Ginsbach PO'Boyle MReddi VSmith ATang L(2017)Discovery and exploitation of general reductions: a constraint based approachProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049862(269-280)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3049832.3049862
Ginsbach PO'Boyle M(2017)Discovery and exploitation of general reductions: A constraint based approach2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO.2017.7863746(269-280)Online publication date: Feb-2017
https://doi.org/10.1109/CGO.2017.7863746
Reddy CKruse MCohen AZaks AMendelson BRauchwerger LHwu W(2016)Reduction DrawingProceedings of the 2016 International Conference on Parallel Architectures and Compilation10.1145/2967938.2967950(87-97)Online publication date: 11-Sep-2016
https://dl.acm.org/doi/10.1145/2967938.2967950
Zou YRajopadhye SEidt CHoller ASrinivasan UAmarasinghe S(2012)Scan detection and parallelization in "inherently sequential" nested loop programsProceedings of the Tenth International Symposium on Code Generation and Optimization10.1145/2259016.2259027(74-83)Online publication date: 31-Mar-2012
https://dl.acm.org/doi/10.1145/2259016.2259027
Han LLiu WTuck JMoshovos ASteffan GHazelwood KKaeli D(2010)Speculative parallelization of partial reduction variablesProceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization10.1145/1772954.1772975(141-150)Online publication date: 24-Apr-2010
https://dl.acm.org/doi/10.1145/1772954.1772975
Gupta GRajopadhye SQuinton PRosenberg AMaggs B(2002)Scheduling reductions on realistic machinesProceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures10.1145/564870.564888(117-126)Online publication date: 10-Aug-2002
https://dl.acm.org/doi/10.1145/564870.564888
Suganuma TKomatsu HNakatani TYew P(1996)Detection and global optimization of reduction operations for distributed parallel machinesProceedings of the 10th international conference on Supercomputing10.1145/237578.237581(18-25)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237578.237581
Collard J(1995)Automatic parallelization of while-loops using speculative executionInternational Journal of Parallel Programming10.1007/BF0257778923:2(191-219)Online publication date: 1-Apr-1995
https://dl.acm.org/doi/10.1007/BF02577789

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Graph reductions and partitioning heuristics for multicore DAG scheduling

Early-release fair scheduling

EDZL Scheduling Analysis

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Graph reductions and partitioning heuristics for multicore DAG scheduling

Early-release fair scheduling

EDZL Scheduling Analysis

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations