SPar: A DSL for High-Level and Productive Stream Parallelism
نویسندگان
چکیده
منابع مشابه
SPar: A DSL for High-Level and Productive Stream Parallelism
This paper introduces SPar, an internal C++ Domain-Specific Language (DSL) that supports the development of classic stream parallel applications. The DSL uses standard C++ attributes to introduce annotations tagging the notable components of stream parallel applications: stream sources and stream processing stages. A set of tools process SPar code (C++ annotated code using the SPar attributes) ...
متن کاملDomain-specific language & support tools for high-level stream parallelism
Stream-based systems are representative of several different application domains including video, networking, audio, graphic processing, etc. Stream parallel programs may run on different kinds of parallel architectures (desktop, servers, cell phones, and supercomputers) and represent significant workloads on our current computing systems. Nevertheless, most of them are still not parallelized. ...
متن کاملTask Parallelism in Spar
In this paper we will give a small introduction to Spar, a programming language for semi-automatic parallel programming. Spar, a Java derivative is being developed as part of the Automap project, which aims to create completely automatic mappings for code and data at either compile time or runtime. We will present how Spar supports task-parallel programming and how it interacts with the user or...
متن کاملDSL-based Design Space Exploration for Temporal and Spatial Parallelism of Custom Stream Computing
Stream computation is one of the approaches suitable for FPGA-based custom computing due to its high throughput capability brought by pipelining with regular memory access. To increase performance of iterative stream computation, we can exploit both temporal and spatial parallelism by deepening and duplicating pipelines, respectively. However, the performance is constrained by several factors i...
متن کاملAn architecture for high instruction level parallelism
High instruction level parallelism (ILP) can only be achieved when data $0~ and control flow constraints have been removed or reduced. Data jlow constraints, not inherent in the original code, arise from lack of sufJicient resources for initiation and execution of multiple instructions concurrently. Control flow problems are caused by branches which force unpredictable changes in the sequential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2017
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626417400059