HalideTuner : generating and tuning halide schedules with Opentuner

Halide is a programming language designed to make it easier to write high-performance image processing code. Halide separates the scientific problem of how to write the image processing algorithm to get the required result from the engineering problem of how to schedule the different parts of this algorithm to get a fast solution. This allows Halide's users to test out different schedules for a single image processing algorithm to get the fastest program. Unfortunately, the amount of possible schedules is staggeringly large, and there is no deterministic way to find the fastest schedules. This leads to a lot of man-hours spent trying to find good Halide schedules. As Halide grows in popularity and the platforms on which it runs diversify, the need for Halide schedules will increase. As the need for good Halide schedules increases, so will the need for good schedule designers. However, given the elusiveness of highly performant schedules, machine generated schedules will become highly preferred to human trial and error. HalideTuner solves this problem by automating the entire process. The automation of the the schedule generation and tuning is done by a machine learning framework called Opentuner. Before Opentuner can operate, defining how to iterate through the search space needs to be codified. In this paper we present HalideTuner a codification of how Opentuner can manipulate Halide schedules to improve them in the process of clever trial and error. HalideTuner serves as the foundation for generating and tuning Halide schedules.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2015

Author dc:creator

• Zingales, Giuseppe Paolo Ernesto Toffanin

Advisor dc:contributor.advisor

• Saman Amarasinghe.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/106444

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/106444