PolyBench/Python: benchmarking Python environments with polyhedral optimizations
Open Access
- 27 February 2021
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 59-70
Abstract
Python has become one of the most used and taught languages nowadays. Its expressiveness, cross-compatibility and ease of use have made it popular in areas as diverse as finance, bioinformatics or machine learning. However, Python programs are often significantly slower to execute than an equivalent native C implementation, especially for computation-intensive numerical kernels. This work presents PolyBench/Python, implementing the 30 kernels in PolyBench/C, one of the standard benchmark suites for polyhedral optimization, in Python. In addition to the benchmark kernels, a functional wrapper including mechanisms for performance measurement, testing, and execution configuration has been developed. The framework includes support for different ways to translate C-array codes into Python, offering insight into the tradeoffs of Python lists and NumPy arrays. The benchmark performance is thoroughly evaluated on different Python interpreters, and compared against its PolyBench/C counterpart to highlight the profitability (or lack thereof) of using Python for regular numerical codes.Keywords
Funding Information
- Ministerio de Ciencia e Innovación (TIN2016-75845-P, PID2019-104184RB-I00)
- Xunta de Galicia (ED431G 2019/01)
- National Science Foundation (CCF-1750399)
This publication has 10 references indexed in Scilit:
- When polyhedral transformations meet SIMD code generation2013
- POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATIONParallel Processing Letters, 2012
- The NumPy Array: A Structure for Efficient Numerical ComputationComputing in Science & Engineering, 2011
- Loop transformations2011
- isl: An Integer Set Library for the Polyhedral Model2010
- Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory HierarchiesInternational Journal of Parallel Programming, 2006
- Index Set SplittingInternational Journal of Parallel Programming, 2000
- BiopythonACM SIGBIO Newsletter, 2000
- Dataflow analysis of array and scalar referencesInternational Journal of Parallel Programming, 1991
- Supernode partitioning1988