A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Polly's Polyhedral Scheduling in the Presence of Reductions
[article]
2015
arXiv
pre-print
Preserved Fulltext
The polyhedral model provides a powerful mathematical abstraction to enable effective optimization of loop nests with respect to a given optimization goal, e.g., exploiting parallelism. Unexploited reduction properties are a frequent reason for polyhedral optimizers to assume parallelism prohibiting dependences. To our knowledge, no polyhedral loop optimizer available in any production compiler provides support for reductions. In this paper, we show that leveraging the parallelism of reductions
arXiv:1505.07716v1
fatcat:ivktky3yejhe7icrbvregeplue
more »
... can lead to a significant performance increase. We give a precise, dependence based, definition of reductions and discuss ways to extend polyhedral optimization to exploit the associativity and commutativity of reduction computations. We have implemented a reduction-enabled scheduling approach in the Polly polyhedral optimizer and evaluate it on the standard Polybench 3.2 benchmark suite. We were able to detect and model all 52 arithmetic reductions and achieve speedups up to 2.21× on a quad core machine by exploiting the multidimensional reduction in the BiCG benchmark.
Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements I would like to thank Bas Luttik, Andrew Tolmach, Zino Benaissa, Patricia Johann, Joost Visser, Merijn de Jonge, Otto Skrove Bagge, Dick Kieburtz, Karina Olmos, Hedzer Westra, Eelco Dolstra ...
doi:10.1007/3-540-45127-7_27
fatcat:2imh4paacbfolk4pl5vkanrfiq
Stratego/XT 0.16
2006
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Bas Luttik co-invented generic traversal strategies with Eelco Visser; Zino Benaissa and Andrew Tolmach were involved in the design of the very first version of Stratego; Merijn de Jonge and Joost Visser ...
doi:10.1145/1111542.1111558
dblp:conf/pepm/BravenboerKVV06
fatcat:jn7aqbdnubc4dkowvkcm5ykh4e
Program Transformation with Stratego/XT
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The first prototype language design and compiler was developed with Zino Benaissa and Andrew Tolmach. ...
doi:10.1007/978-3-540-25935-0_13
fatcat:5d55spl7hvgrbcy2uai7ccbm44
Stratego/XT 0.17. A language and toolset for program transformation
2008
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Bas Luttik co-invented generic traversal strategies [32] ; Zino Benaissa and Andrew Tolmach were involved in the design of the very first version of Stratego [51] ; Merijn de Jonge and Joost Visser co-developed ...
doi:10.1016/j.scico.2007.11.003
fatcat:jhkofle3nneklm5miuafaicb4y
MetaML and multi-stage programming with explicit annotations
2000
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements The research on MetaML, and this paper, have beneÿted greatly from our collaboration with Zino Benaissa and Eugenio Moggi. ...
doi:10.1016/s0304-3975(00)00053-0
fatcat:7qqlnaurpbco3nzzyh37jerip4
Multi-stage Imperative Languages: A Conservative Extension Result
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This paper would not have been conceived without the previous work in collaboration with Zino Benaissa, Tim Sheard and Walid Taha, who have introduced us to the challenges of multi-stage programming. ...
doi:10.1007/3-540-45350-4_9
dblp:conf/saig/CalcagnoM00
fatcat:op6sriuqrjfqvgnvriyjydcoxu
Basic Paramodulation
1995
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Ohlbach, Robert Nieuwenhuis, Alberto Rubio, and Zino Benaissa for helpful discussions on the ideas presented here. The research described in this paper was supported in part by the National Science ...
doi:10.1006/inco.1995.1131
fatcat:n5llf6yxzbfdfojyczev7tboji