44,119 Hits in 6.0 sec

Generating an efficient compiler for a data parallel language from a denotational specification [chapter]

Johan Ringström, Peter Fritzson, Mikael Pettersson
1994 Lecture Notes in Computer Science  
There are very few examples of the generation of efficient compilers from denotational specifications.  ...  This paper reports experience from building a prototype compiler for a small Algollike parallel language using a version of the DML system called DML-P, which has been extended to support data-parallel  ...  The DML-P (P for parallel) compiler generator system provides a prototyping environment for the design of efficient compilers for data parallel computers.  ... 
doi:10.1007/3-540-57877-3_17 fatcat:6gd7pgkt5jgu5nd7de6uy5zetu

The Development of the Data-Parallel GPU Programming Language CGiS [chapter]

Philipp Lucas, Nicolas Fritz, Reinhard Wilhelm
2006 Lecture Notes in Computer Science  
In this paper, we present the recent developments on the design and implementation of the data-parallel programming language CGiS.  ...  CGiS is devised to facilitate use of the data-parallel resources of current graphics processing units (GPUs) for scientific programming.  ...  Generating efficient GPU code for a general purpose language program is a demanding task. The goal of the CGiS project is to explore the possibilities of high-level data-parallel programming.  ... 
doi:10.1007/11758549_31 fatcat:biyuqvzo3rfovcyydaedmmecri

From a Formalized Parallel Action Language to Its Efficient Code Generation

Ivan Llopard, Christian Fabre, Albert Cohen
2017 ACM Transactions on Embedded Computing Systems  
Together with its formal semantics, we present an optimizing model compiler aiming for the generation of efficient data-parallel implementations.  ...  We propose a modeling language extended with parallel action semantics and hierarchical indexed-state machines suitable for computationally intensive applications.  ...  They also do not address efficient code generation issues. CONCLUSION We defined two extensions to an existing a parallel action language, HOE 2 : generalized scalars and indexed regions.  ... 
doi:10.1145/2990195 fatcat:debgncbufjewrhnwx3tc25ew5m

Software synthesis and code generation for signal processing systems

S.S. Bhartacharyya, R. Leupers, P. Marwedel
2000 IEEE transactions on circuits and systems - 2, Analog and digital signal processing  
This paper reviews the state-of-the-art in programming language and compiler technology for DSP software implementation.  ...  In particular, we review techniques for high-level block-diagram-based modeling of DSP applications; the translation of block-diagram specifications into efficient C programs using global target-independent  ...  As with procedural language compilation technology for PDSP's, synthesis from dataflow-based graphical specifications offers significant promise for the future, and is an important challenge confronting  ... 
doi:10.1109/82.868454 fatcat:4udasl3dqnekthi5ymwgttnuti

From FORTRAN 77 to Locality-Aware High Productivity Languages for Peta-Scale Computing

Hans P. Zima
2007 Scientific Programming  
HPF is a data-parallel language that was designed to provide the user with a high-level interface for programming scientific applications, while delegating to the compiler the task of generating an explicitly  ...  This framework is general enough to allow a concise specification of sparse data distributions. The paper concludes with an outlook to future research in this area.  ...  I would like to thank my collaborators in the design of the Chapel language, David Callahan, Bradford Chamberlain and Roxana Diaconescu, for continuously providing ideas and constructive feedback, and  ... 
doi:10.1155/2007/219061 fatcat:bb4oj5mplbbkroer2pq4pn7idm

Toward Sequentializing Overparallelized Protocol Code

Sung-Shik T.Q. Jongmans, Farhad Arbab
2014 Electronic Proceedings in Theoretical Computer Science  
In our ongoing work, we use constraint automata to compile protocol specifications expressed as Reo connectors into efficient executable code, e.g., in C.  ...  Because our approach is based on constraint automata, the approach, its problems, and our solutions are in fact useful and relevant well beyond the specific case of compiling Reo.  ...  A crucial step toward adoption of coordination languages for multicore programming is the development of such compilers: programmers need tools to generate efficient code from high-level protocol specifications  ... 
doi:10.4204/eptcs.166.5 fatcat:7hw627bkg5bybadturgrdbzuei

Rapid and Robust Compiler Construction Using Template-Based Metacompilation [chapter]

C. van Reeuwijk
2003 Lecture Notes in Computer Science  
Since it uses templates, the generated code is not restricted to a specific programming language: any sufficiently powerful programming language can be targeted.  ...  We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data structures.  ...  This allows the metaprogram to generate code that is tailor-made for a specific data structure. Knowledge about the data-structure definitions can be provided at run time or at compile time.  ... 
doi:10.1007/3-540-36579-6_18 fatcat:eeclag5upravbnmo5d3jywbrty

SAC—A Functional Array Language for Efficient Multi-threaded Execution

Clemens Grelck, Sven-Bodo Scholz
2006 International journal of parallel programming  
We give an in-depth introduction to the design of our functional array programming language SaC, the main aspects of its compilation into host machine code, and its parallelisation based on multi-threading  ...  Both optimisation and parallelisation rigorously exploit the absence of side-effects and the explicit data flow characteristic of a functional setting.  ...  Nevertheless, generation of efficiently executable code from complex generator sets is a challenging task, which is further complicated as soon as generators use step and width specifications for periodic  ... 
doi:10.1007/s10766-006-0018-x fatcat:odlho7mgsvdrnd424gcgp7qqhq

Emma in Action

Alexander Alexandrov, Andreas Salzmann, Georgi Krastev, Asterios Katsifodimos, Volker Markl
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
To retain a sufficient level of abstraction and lower the barrier of entry for data scientists, projects like Spark and Flink currently offer domain-specific APIs on top of their parallel collection abstractions  ...  This demonstration highlights the benefits of an alternative design based on deep language embedding. We showcase Emma -a programming language embedded in Scala.  ...  Both strategies, however, do not resolve the need for declarative integration of parallel collection processing in a general-purpose language -external languages introduce a language barrier, while internal  ... 
doi:10.1145/2882903.2899396 dblp:conf/sigmod/AlexandrovSKKM16 fatcat:hre3crgnj5dp5mjiq22etivfpu

An integrated annotation and compilation framework for task and data parallel programming in Java [chapter]

H.J. Sips, K. van Reeuwijk
2004 Advances in Parallel Computing  
To evaluate the effectiveness of our parallel programming model, we did an experimental implementation of the language extensions in our compiler, Timber.  ...  We describe a set of language extensions to Java to support parallel programming with distribution annotations.  ...  To support this, a set of language constructs must be defined that provide a more abstract parallel programming model, and a compiler that generates efficient parallel code from the abstract language constructs  ... 
doi:10.1016/s0927-5452(04)80017-0 fatcat:jwygqlctbrfwvpam73keqao7h4

SPar: A DSL for High-Level and Productive Stream Parallelism

Dalvan Griebler, Marco Danelutto, Massimo Torquati, Luiz Gustavo Fernandes
2017 Parallel Processing Letters  
This paper introduces SPar, an internal C++ Domain-Specific Language (DSL) that supports the development of classic stream parallel applications.  ...  A set of tools process SPar code (C++ annotated code using the SPar attributes) to generate FastFlow C++ code that exploits the stream parallelism denoted by SPar annotations while targeting shared memory  ...  We also propose an internal C++ domain-specific language, but we explicitly target stream parallelism.  ... 
doi:10.1142/s0129626417400059 fatcat:gw4bi7n7c5eyve4b36ciidwgkq

Cosy compiler phase embedding with the CoSy compiler model [chapter]

Martin Alt, Uwe Aßmann, Hans Someren
1994 Lecture Notes in Computer Science  
A novel structure definition language (fSDL) is introduced for the specification of data, access side effects, and visibility control.  ...  speculative evaluation 4 , parallel evaluation, and generate-and-test evaluation.  ...  The clear specification allows to generate efficient sequential compilers for uni-processor systems.  ... 
doi:10.1007/3-540-57877-3_19 fatcat:gr2ei6m4kjbv7lw67qa4fnzjqm

Vienna-Fortran/HPF extensions for sparse and irregular problems and their compilation

M. Ujaldon, E.L. Zapata, B.M. Chapman, H.P. Zima
1997 IEEE Transactions on Parallel and Distributed Systems  
The overall result is a powerful mechanism for dealing efficiently with sparse matrices in data parallel languages and their compilers for DMMPs.  ...  In this paper, we use Vienna-Fortran as a general framework for dealing with sparse data structures.  ...  in this paper was supported by the Ministry of Education and Science (CICYT) of Spain under project TIC92-0942, by the Austrian Research Foundation (FWF Grant P8989-PHY), and by the Austrian Ministry for  ... 
doi:10.1109/71.629489 fatcat:li5kogrrwba2tiaug6w3bipe3e

Support for data parallelism in the CAL actor language

Essayas Gebrewahid, Mehmet Ali Arslan, Andréas Karlsson, Zain Ul-Abdin
2016 Proceedings of the 3rd Workshop on Programming Models for SIMD/Vector Processing - WPMVP '16  
In this paper, we present an extension to our CAL compilation framework (CAL2Many) that supports data parallelism in the CAL Actor Language.  ...  Our compilation framework makes it possible to program architectures with SIMD support using high-level language and provides efficient code generation.  ...  Acknowledgments This work has been supported by grants from The Foundation for Strategic Research and the Swedish national strategic research program ELLIIT.  ... 
doi:10.1145/2870650.2870656 dblp:conf/ppopp/GebrewahidAKZ16 fatcat:fyskpgkrhbeiznq2arenqtywtm

Booster: a high-level language for portable parallel algorithms

Edwin M. Paalvast, Henk J. Sips, Leo C. Breebaart
1991 Applied Numerical Mathematics  
Portability in this respect means that given an algorithm description in a parallel programming language, it must be possible, with relatively little effort, to generate efficient code for several classes  ...  In this paper, the language Booster is described. Booster is a high-level, fourth generation, parallel programming language.  ...  From these data decomposition specifications, SPMD (Single Process Multiple Data) code [Karp87] can be generated automatically.  ... 
doi:10.1016/0168-9274(91)90050-a fatcat:c7ab6iy42nckvks5zidry5xeda
« Previous Showing results 1 — 15 out of 44,119 results