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
2005 |
|
Fober, Dominique; Letz, Stephane; Orlarey, Yann Optimized Lock-Free FIFO Queue continued (Technical Report) 2005. (Abstract | Links | BibTeX | Étiquettes: concurrency, fifo, lifo, lock-free) @techreport{ Fober:05a ,
title = {Optimized Lock-Free FIFO Queue continued}, author = {Dominique Fober and Stephane Letz and Yann Orlarey}, editor = {Grame}, url = {TR-050523.pdf}, year = {2005}, date = {2005-01-01}, booktitle = {Technical Report – 01-05-23}, abstract = {We have proposed algorithms for lock-free lifo and fifo queue management. This technical report proposes an improved version of the lock-free fifo management algorithm previously defined.}, keywords = {concurrency, fifo, lifo, lock-free}, pubstate = {published}, tppubtype = {techreport} } We have proposed algorithms for lock-free lifo and fifo queue management. This technical report proposes an improved version of the lock-free fifo management algorithm previously defined.
|
|
Letz, Stephane; Orlarey, Yann; Fober, Dominique jackdmp: Jack server for multi-processor machines (Inproceeding) LAC, (Ed.): pp. 29–36, 2005. (Abstract | Links | BibTeX | Étiquettes: audio, lock-free, multi-processor, Parallelism, real-time) @inproceedings{ letz:05a ,
title = {jackdmp: Jack server for multi-processor machines}, author = {Stephane Letz and Yann Orlarey and Dominique Fober}, editor = {LAC}, url = {Jackdmp-lac2005.pdf}, year = {2005}, date = {2005-01-01}, pages = {29–36}, abstract = {jackdmp is a C++ version of the Jack low-latency audio server for multi-processor machines. It is a new implementation of the jack server core features that aims in removing some limitations of the current design. The activation system has been changed for a data flow model and lock-free programming techniques for graph access have been used to have a more dynamic and robust system. We present the new design and the implementation for MacOSX.}, keywords = {audio, lock-free, multi-processor, Parallelism, real-time}, pubstate = {published}, tppubtype = {inproceedings} } jackdmp is a C++ version of the Jack low-latency audio server for multi-processor machines. It is a new implementation of the jack server core features that aims in removing some limitations of the current design. The activation system has been changed for a data flow model and lock-free programming techniques for graph access have been used to have a more dynamic and robust system. We present the new design and the implementation for MacOSX.
|
|
Letz, Stephane; Orlarey, Yann; Fober, Dominique Jack audio server for multi-processor machines (Inproceeding) ICMA, (Ed.): Proceedings of the International Computer Music Conference, pp. 1–4, 2005. (Abstract | Links | BibTeX | Étiquettes: audio, lock-free, multi-processor, Parallelism, real-time) @inproceedings{ Letz:05b ,
title = {Jack audio server for multi-processor machines}, author = {Stephane Letz and Yann Orlarey and Dominique Fober}, editor = {ICMA}, url = {Jackdmp-ICMC2005.pdf}, year = {2005}, date = {2005-01-01}, booktitle = {Proceedings of the International Computer Music Conference}, pages = {1–4}, abstract = {Jack is a low-latency audio server, written for POSIX conformant operating systems such as GNU/Linux. It can connect a number of different applications to an audio device, as well as allowing them to share audio between themselves. We present a new C++ version for multi-processor machines that aims at removing some limitations of the current design: the activation system has been changed for a data flow model and lock-free programming techniques for graph access have been used.}, keywords = {audio, lock-free, multi-processor, Parallelism, real-time}, pubstate = {published}, tppubtype = {inproceedings} } Jack is a low-latency audio server, written for POSIX conformant operating systems such as GNU/Linux. It can connect a number of different applications to an audio device, as well as allowing them to share audio between themselves. We present a new C++ version for multi-processor machines that aims at removing some limitations of the current design: the activation system has been changed for a data flow model and lock-free programming techniques for graph access have been used.
|
2002 |
|
Fober, Dominique; Letz, Stephane; Orlarey, Yann Lock-Free Techniques for Concurrent Access to Shared Objects (Inproceeding) GMEM, (Ed.): Actes des Journées d’Informatique Musicale JIM2002, Marseille, pp. 143–150, 2002. (Abstract | Links | BibTeX | Étiquettes: access, computation, concurrent, lock-free, parallel, real-time) @inproceedings{ Fober:02b ,
title = {Lock-Free Techniques for Concurrent Access to Shared Objects}, author = {Dominique Fober and Stephane Letz and Yann Orlarey}, editor = {GMEM}, url = {fober-JIM2002.pdf}, year = {2002}, date = {2002-01-01}, booktitle = {Actes des Journées d’Informatique Musicale JIM2002, Marseille}, pages = {143–150}, abstract = {Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject of many works. Proposed solutions are commonly based on semaphores which have several drawbacks. For many cases, lock-free techniques constitute an alternate solution and avoid the disadvantages of semaphore based techniques. We present the principle of these lock-free techniques with the simple example of a LIFO stack. Then, based on Michael-Scott previous work, we propose a new algorithm to implements lock-free FIFO stacks with a simple constraint on the data structure.}, keywords = {access, computation, concurrent, lock-free, parallel, real-time}, pubstate = {published}, tppubtype = {inproceedings} } Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject of many works. Proposed solutions are commonly based on semaphores which have several drawbacks. For many cases, lock-free techniques constitute an alternate solution and avoid the disadvantages of semaphore based techniques. We present the principle of these lock-free techniques with the simple example of a LIFO stack. Then, based on Michael-Scott previous work, we propose a new algorithm to implements lock-free FIFO stacks with a simple constraint on the data structure.
|
2001 |
|
Fober, Dominique; Orlarey, Yann; Letz, Stephane Optimised Lock-Free FIFO Queue (Technical Report) 2001. (Abstract | Links | BibTeX | Étiquettes: concurrency, fifo, lifo, lock-free) @techreport{ Fober:01d ,
title = {Optimised Lock-Free FIFO Queue}, author = {Dominique Fober and Yann Orlarey and Stephane Letz}, editor = {Grame}, url = {LockFree.pdf}, year = {2001}, date = {2001-01-01}, booktitle = {Technical Report – 01-01-01}, abstract = {Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject to many works. Based on these works, we present a new algorithm to implements lock-free fifo stacks with a minimum constraints on the data structure. Compared to the previous solutions, this algorithm is more simple and more efficient. We’ll present its implementation and it’s performances.}, keywords = {concurrency, fifo, lifo, lock-free}, pubstate = {published}, tppubtype = {techreport} } Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject to many works. Based on these works, we present a new algorithm to implements lock-free fifo stacks with a minimum constraints on the data structure. Compared to the previous solutions, this algorithm is more simple and more efficient. We’ll present its implementation and it’s performances.
|