Mots clés
audio communication compiler composition dataflow Domain Specific Language DSP ecosystem Elody FAUST functional graphic inscore interaction language lock-free MIDI MidiShare music music score musicale musique operating processing programming real-time score signal synchronization systems
2010 |
|
Letz, Stephane; Orlarey, Yann; Fober, Dominique Work Stealing Scheduler for Automatic Parallelization in Faust (Inproceeding) LAC, (Ed.): Proceedings of Linux Audio Conference, 2010. (Abstract | Links | BibTeX | Étiquettes: compiler, dataflow, functional, processing, programming, real-time, signal) @inproceedings{ Letz:10a ,
title = {Work Stealing Scheduler for Automatic Parallelization in Faust}, author = {Stephane Letz and Yann Orlarey and Dominique Fober}, editor = {LAC}, url = {FAUST_LAC2010.pdf}, year = {2010}, date = {2010-01-01}, booktitle = {Proceedings of Linux Audio Conference}, abstract = {Faust 0.9.10 introduces an alternative to OpenMP based parallel code generation using a Work Steal- ing Scheduler and explicit management of worker threads. This paper explains the new option and presents some benchmarks.}, keywords = {compiler, dataflow, functional, processing, programming, real-time, signal}, pubstate = {published}, tppubtype = {inproceedings} } Faust 0.9.10 introduces an alternative to OpenMP based parallel code generation using a Work Steal- ing Scheduler and explicit management of worker threads. This paper explains the new option and presents some benchmarks.
|
|
Orlarey, Yann; Letz, Stephane; Fober, Dominique Automatic Paralllelization of Audio Applications with Faust (Inproceeding) Actes du Congrès Français d’Acoustique, 2010. (Abstract | Links | BibTeX | Étiquettes: compiler, dataflow, functional, processing, programming, real-time, signal) @inproceedings{ Orlarey:10a ,
title = {Automatic Paralllelization of Audio Applications with Faust}, author = {Yann Orlarey and Stephane Letz and Dominique Fober}, url = {faust-CFA-2010.pdf}, year = {2010}, date = {2010-01-01}, booktitle = {Actes du Congrès Français d’Acoustique}, abstract = {Faust (Functional AUdio STreams) [1] stands for both a programming language and its compiler. Being fully compiled allows Faust to be used as an alternative to C/C++ to develop high-performance audio signal processing applications, DSP libraries and plug-ins for a variety of audio platforms and standards.}, keywords = {compiler, dataflow, functional, processing, programming, real-time, signal}, pubstate = {published}, tppubtype = {inproceedings} } Faust (Functional AUdio STreams) [1] stands for both a programming language and its compiler. Being fully compiled allows Faust to be used as an alternative to C/C++ to develop high-performance audio signal processing applications, DSP libraries and plug-ins for a variety of audio platforms and standards.
|
2009 |
|
Orlarey, Yann; Fober, Dominique; Letz, Stephane PARALLELIZATION OF AUDIO APPLICATIONS WITH FAUST (Inproceeding) Proceedings of the first Sound and Music Computing conference – SMC’09, pp. 99–112, 2009. (Abstract | Links | BibTeX | Étiquettes: compiler, dataflow, functional, processing, programming, real-time, signal) @inproceedings{ orlarey:09b ,
title = {PARALLELIZATION OF AUDIO APPLICATIONS WITH FAUST}, author = {Yann Orlarey and Dominique Fober and Stephane Letz}, url = {faust_SMC2009.pdf}, year = {2009}, date = {2009-01-01}, booktitle = {Proceedings of the first Sound and Music Computing conference – SMC’09}, pages = {99–112}, abstract = {Faust 0.9.9.6 introduces new compilation options to automatically parallelize audio applications 1 . This paper explains how the automatic parallelization is done and presents some benchmarks.}, keywords = {compiler, dataflow, functional, processing, programming, real-time, signal}, pubstate = {published}, tppubtype = {inproceedings} } Faust 0.9.9.6 introduces new compilation options to automatically parallelize audio applications 1 . This paper explains how the automatic parallelization is done and presents some benchmarks.
|
|
Orlarey, Yann; Fober, Dominique; Letz, Stephane FAUST : an Efficient Functional Approach to DSP Programming (Book Chapter) FRANCE, Editions DELATOUR (Ed.): NEW COMPUTATIONAL PARADIGMS FOR COMPUTER MUSIC, pp. 65–96, 2009. (Abstract | Links | BibTeX | Étiquettes: compiler, dataflow, functional, processing, programming, real-time, signal) @inbook{ orlarey:09c ,
title = {FAUST : an Efficient Functional Approach to DSP Programming}, author = {Yann Orlarey and Dominique Fober and Stephane Letz}, editor = {Editions DELATOUR FRANCE}, url = {faust-chapter.pdf}, year = {2009}, date = {2009-01-01}, booktitle = {NEW COMPUTATIONAL PARADIGMS FOR COMPUTER MUSIC}, pages = {65–96}, abstract = {FAUST is a programming language that provides a purely functional approach to signal processing while offering a high level of performance. FAUST aims at being complementary to existing audio languages by offering a viable and efficient alternative to C/C++ to develop signal processing libraries, audio plug-ins or standalone applications. The language is based on a simple and well defined formal semantics. A FAUST program denotes a signal processor, a mathematical function that transforms input signals into output signals. Being able to know precisely what a program computes is important not only for programmers, but also for compilers needing to generate the best possible code. Moreover these semantics questions are crucial for the long term preservation of music programs. The following paragraphs will give an overview of the language as well as a description of the compiler, including the generation of parallel code.}, keywords = {compiler, dataflow, functional, processing, programming, real-time, signal}, pubstate = {published}, tppubtype = {inbook} } FAUST is a programming language that provides a purely functional approach to signal processing while offering a high level of performance. FAUST aims at being complementary to existing audio languages by offering a viable and efficient alternative to C/C++ to develop signal processing libraries, audio plug-ins or standalone applications. The language is based on a simple and well defined formal semantics. A FAUST program denotes a signal processor, a mathematical function that transforms input signals into output signals. Being able to know precisely what a program computes is important not only for programmers, but also for compilers needing to generate the best possible code. Moreover these semantics questions are crucial for the long term preservation of music programs. The following paragraphs will give an overview of the language as well as a description of the compiler, including the generation of parallel code.
|
2004 |
|
Orlarey, Yann; Fober, Dominique; Letz, Stephane Syntactical and Semantical Aspects of Faust (Journal Article) 2004. (Abstract | Links | BibTeX | Étiquettes: compiler, dataflow, functional, processing, programming, real-time, signal) @article{ orlarey:04a ,
title = {Syntactical and Semantical Aspects of Faust}, author = {Yann Orlarey and Dominique Fober and Stephane Letz}, url = {faust-soft-computing.pdf}, year = {2004}, date = {2004-01-01}, booktitle = {Soft Computing}, abstract = {This paper presents some syntactical and semantical aspects of FAUST (Functional AUdio STreams), a programming language for real-time sound processing and synthesis. The programming model of FAUST combines two approaches : functional programming and block-diagrams composition. It is based on a block-diagram algebra. It has a well defined formal semantic and can be compiled into efficient C/C++ code.}, keywords = {compiler, dataflow, functional, processing, programming, real-time, signal}, pubstate = {published}, tppubtype = {article} } This paper presents some syntactical and semantical aspects of FAUST (Functional AUdio STreams), a programming language for real-time sound processing and synthesis. The programming model of FAUST combines two approaches : functional programming and block-diagrams composition. It is based on a block-diagram algebra. It has a well defined formal semantic and can be compiled into efficient C/C++ code.
|
2002 |
|
Orlarey, Yann; Fober, Dominique; Letz, Stephane An Algebraic approach to Block Diagram Constructions (Inproceeding) GMEM, (Ed.): Actes des Journées d’Informatique Musicale JIM2002, Marseille, pp. 151–158, 2002. (Abstract | Links | BibTeX | Étiquettes: algebra, block-diagram, dataflow, Denotational, DSP, graph, semantic) @inproceedings{ Orlarey:02a ,
title = {An Algebraic approach to Block Diagram Constructions}, author = {Yann Orlarey and Dominique Fober and Stephane Letz}, editor = {GMEM}, url = {faust-jim2002.pdf}, year = {2002}, date = {2002-01-01}, booktitle = {Actes des Journées d’Informatique Musicale JIM2002, Marseille}, pages = {151–158}, abstract = {We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. This block diagram algebra is based on three binary operations : sequential, parallel and recursive constructions. These operations can be seen as high level connection schemes that set several connections at once in order to combine two block diagrams to form a new one. Such algebraic representations have interesting applications for visual languages based on block diagrams. In particular they are very useful to specify the formal semantic of these languages.}, keywords = {algebra, block-diagram, dataflow, Denotational, DSP, graph, semantic}, pubstate = {published}, tppubtype = {inproceedings} } We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. This block diagram algebra is based on three binary operations : sequential, parallel and recursive constructions. These operations can be seen as high level connection schemes that set several connections at once in order to combine two block diagrams to form a new one. Such algebraic representations have interesting applications for visual languages based on block diagrams. In particular they are very useful to specify the formal semantic of these languages.
|
|
Orlarey, Yann; Fober, Dominique; Letz, Stephane An Algebra for Block Diagram Languages (Inproceeding) ICMA, (Ed.): Proceedings of International Computer Music Conference, pp. 542–547, 2002. (Abstract | Links | BibTeX | Étiquettes: algebra, block-diagram, dataflow, Denotational, DSP, graph, semantic) @inproceedings{ Orlarey:02b ,
title = {An Algebra for Block Diagram Languages}, author = {Yann Orlarey and Dominique Fober and Stephane Letz}, editor = {ICMA}, url = {faust-icmc2002.pdf}, year = {2002}, date = {2002-01-01}, booktitle = {Proceedings of International Computer Music Conference}, pages = {542–547}, abstract = {We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. The proposed algebra is based on three binary operations of construction : sequential, parallel and recursive constructions. These operations can be seen as high level connection schemes that set several connections at once in order to combine two block diagrams to form a new one. Algebraic representations have interesting application for visual languages based on block diagrams and are useful to specify the formal semantic of these languages.}, keywords = {algebra, block-diagram, dataflow, Denotational, DSP, graph, semantic}, pubstate = {published}, tppubtype = {inproceedings} } We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. The proposed algebra is based on three binary operations of construction : sequential, parallel and recursive constructions. These operations can be seen as high level connection schemes that set several connections at once in order to combine two block diagrams to form a new one. Algebraic representations have interesting application for visual languages based on block diagrams and are useful to specify the formal semantic of these languages.
|