Aktemur, Tankut BarışKameyama, Y.Kiselyov, O.Shan, C.-C.2016-02-152016-02-152013978-1-4503-1842-6http://hdl.handle.net/10679/2172https://doi.org/10.1145/2426890.2426917Due to copyright restrictions, the access to the full text of this article is only available via subscription.The appeal of generative programming is "abstraction without guilt": eliminating the vexing trade-off between writing high-level code and highly-performant code. Generative programming also promises to formally capture the domain-specific knowledge and heuristics used by high-performance computing (HPC)experts. How far along are we in fulfilling these promises? To gauge our progress, a recent Shonan Meeting on "bridging the theory of staged programming languages and the practice of high-performance computing" proposed to use a set of benchmarks, dubbed "Shonan Challenge". Shonan Challenge is a collection of crisp problems posed by HPC and domain experts, for which efficient implementations are known but were tedious to write and modify. The challenge is to generate a similar efficient implementation from the high-level specification of a problem, performing the same optimizations, but automatically. It should be easy to adjust optimizations and the specification, maintaining confidence in the generated code. We describe our initial set of benchmarks and provide three solutions to two of the problems. We hope that the Shonan Challenge will clarify the state of the art and stimulate the theory and technology of staging just as the POPLmark challenge did for meta-theory mechanization. Since each Shonan Challenge problem is a kernel of a significant HPC application, each solution has an immediate practical application.engrestrictedAccessconferenceObject14715410.1145/2426890.2426917High-performance computingGenerative programmingStagingCode generationDomain-specific languages2-s2.0-84873436251