Realizing Efficient Execution of Dataflow Actors on Manycores

Gebrewahid, Essayas; Yang, Mingkun; Cedersjö, Gustav; Ul-Abdin, Zain; Gaspes, Verónica; Janneck, Jörn W.; Svensson, Bengt

doi:10.1109/euc.2014.55

Cited by 21 publications

(17 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we evaluate Cal2Many [6] source-to-source compiler, which translates CAL [5] code to native code for multiple manycore architectures. As a case study, we implemented three QRD algorithms (Givens Rotations, Householder and Gram-Schmidt) both in CAL and in native C for Adapteva's Epiphany [11] architecture.…”

Section: Mes '16 June 19 2016 Seoul Republic Of Koreamentioning

confidence: 99%

See 1 more Smart Citation

Dataflow Implementation of QR Decomposition on a Manycore

Savas

Raase

Gebrewahid

et al. 2016

Proceedings of the Third ACM International Workshop on Many-Core Embedded Systems

Self Cite

View full text Add to dashboard Cite

While parallel computer architectures have become mainstream, application development on them is still challenging. There is a need for new tools, languages and programming models. Additionally, there is a lack of knowledge about the performance of parallel approaches of basic but important operations, such as the QR decomposition of a matrix, on current commercial manycore architectures. This paper evaluates a high level dataflow language (CAL), a source-to-source compiler (Cal2Many) and three QR decomposition algorithms (Givens Rotations, Householder and Gram-Schmidt). The algorithms are implemented both in CAL and hand-optimized C languages, executed on Adapteva's Epiphany manycore architecture and evaluated with respect to performance, scalability and development effort.The performance of the CAL (generated C) implementations gets as good as 2% slower than the hand-written versions. They require an average of 25% fewer lines of source code without significantly increasing the binary size. Development effort is reduced and debugging is significantly simplified. The implementations executed on Epiphany cores outperform the GNU scientific library on the host ARM processor of the Parallella board by up to 30x.

show abstract

Section: Mes '16 June 19 2016 Seoul Republic Of Koreamentioning

confidence: 99%

“…The Cal2Many compilation framework contains two intermediate representations (IRs): Actor Machines (AM) [10] and Action Execution IR (AEIR) [6]. Each actor is first translated to an AM, which describes how to schedule execution of actions.…”

Section: Cal2manymentioning

confidence: 99%

Dataflow Implementation of QR Decomposition on a Manycore

Savas

Raase

Gebrewahid

et al. 2016

Proceedings of the Third ACM International Workshop on Many-Core Embedded Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…The COPRTHR SDK [14] provides a direct coprocessor API that includes support for Pthreads [19] semantics as well as support for OpenCL and a thread compiler with Epiphany support. Additional APIs and frameworks that have been investigated include OpenCL within Erlang (based on OpenCL support in the COPRTHR SDK) [20], an APL to C compiler [21], and a CAL compilation framework [22]. Automatically generated code from the dataflow language CAL is compared with a C implementation of the 2D inverse discrete cosine transform targeting the Epiphany architecture in [23].…”

Section: Related Workmentioning

confidence: 99%

Threaded MPI programming model for the Epiphany RISC array processor

Richie¹,

Ross

Park

et al. 2015

Journal of Computational Science

View full text Add to dashboard Cite

a b s t r a c tThe low-power Adapteva Epiphany RISC array processor offers high computational energy-efficiency and parallel scalability. However, extracting performance with a standard parallel programming model remains a great challenge. We present an effective programming model for the Epiphany architecture based on the Message Passing Interface (MPI) standard adapted for coprocessor offload. Using MPI exploits the similarities between the Epiphany architecture and a networked parallel distributed cluster. Furthermore, our approach enables codes written with MPI to execute on the RISC array processor with little modification. We present experimental results for matrix-matrix multiplication using MPI and highlight the importance of fast inter-core data transfers. Using MPI we demonstrate an on-chip performance of 9.1 GFLOPS with an efficiency of 15.3 GFLOPS/W. Threaded MPI exhibits the highest performance reported for the Epiphany architecture using a standard parallel programming model.

show abstract

“…Our code generator uses a simple machine model, called actor machine [9], to model actors in a dataflow application. We have also introduced an action execution intermediate representation [8] to support program portability and we currently support generating sequential C, parallel (manycore) C, and aJava/aStruct languages. These intermediate representations are further introduced in section IV.…”

Section: Introductionmentioning

confidence: 99%

“…In [8] the CAL compilation framework evaluated and optimized in this paper is described. Our code generator uses a simple machine model, called actor machine [9], to model actors in a dataflow application.…”

Section: Introductionmentioning

confidence: 99%

An evaluation of code generation of dataflow languages on manycore architectures

Savas

Gebrewahid

Ul-Abdin

et al. 2014

2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications

Self Cite

View full text Add to dashboard Cite

Today computer architectures are shifting from single core to manycores due to several reasons such as performance demands, power and heat limitations. However, shifting to manycores results in additional complexities, especially with regard to efficient development of applications. Hence there is a need to raise the abstraction level of development techniques for the manycores while exposing the inherent parallelism in the applications. One promising class of programming languages is dataflow languages and in this paper we evaluate and optimize the code generation for one such language, CAL. We have also developed a communication library to support the intercore communication. The code generation can target multiple architectures, but the results presented in this paper is focused on Adapteva's many core architecture Epiphany. We use the twodimensional inverse discrete cosine transform (2D-IDCT) as our benchmark and compare our code generation from CAL with a hand-written implementation developed in C. Several optimizations in the code generation as well as in the communication library are described, and we have observed that the most critical optimization is reducing the number of external memory accesses. Combining all optimizations we have been able to reduce the difference in execution time between auto-generated and handwritten implementations from a factor of 4.3x down to a factor of only 1.3x.

show abstract

Realizing Efficient Execution of Dataflow Actors on Manycores

Cited by 21 publications

References 13 publications

Dataflow Implementation of QR Decomposition on a Manycore

Dataflow Implementation of QR Decomposition on a Manycore

Threaded MPI programming model for the Epiphany RISC array processor

An evaluation of code generation of dataflow languages on manycore architectures

Contact Info

Product

Resources

About