musique contemporaine

Ircam - articles scientifiques notice originale

Exploring the possibilities and limitations of Concurrent Programming for Multimedia Interaction and exploring Visual Programming for Musical Constraint Satisfaction Problems

Type

text
 

Genre(s)

mémoire ou thèse
 

Forme(s)

document numérique
 

Cette ressource est disponible chez l'organisme suivant : Ircam - Centre Pompidou

Identification

Titre

Exploring the possibilities and limitations of Concurrent Programming for Multimedia Interaction and exploring Visual Programming for Musical Constraint Satisfaction Problems
 

Nom(s)

Toro-Bermudez, Mauricio (auteur)
 

Publication

Pontificia Universidad Javeriana , 2008
 

Description

Sujet(s)

concurrent constraint programming   constraint satisfaction problem   constraints   ntcc   gelisp   csp   interpreter   ccp   ntccrt   openmusic   real-time   gecol   gecode
 

Résumé

Multimedia interaction systems are inherently concurrent. Developing correct concurrent systems is difficult because we need to consider all the possible interactions between processes. To reason formally about concurrent systems, there are several concurrent process calculi. We developed multiple prototypes for real-time capable interpreters for both, Concurrent Constraint Programming (CCP) and Non-deterministic Timed Concurrent Constraint (ntcc). We found out that using lightweight threads to implement these interpreters is not appropriate for real-time (RT) interaction. Instead, we recommend using event-driven programming. Using this model of concurrency, we developed Ntccrt, an interpreter for ntcc capable of RT interaction. Ntccrt is based on encoding ntcc processes as Gecode propagators. Using Ntccrt, we executed some models in Pure Data. Due to our success using Gecode, we upgraded Gelisp, providing a graphical interface to solve musical Constraint Satisfaction Problems (CSP) in OpenMusic based on Gecode. In Gelisp, constraints, search heuristics, and optimization criteria can be represented graphically. Using Gelisp, we successfully solved a CSP proposed by compositor Michael Jarrell.
 

Localisation

Envoyer la notice

Bookmark and Share 
 

Identifiant OAI

 

Date de la notice

2010-07-30 02:00:00
 

Identifiant portail

 

Contact