At the moment, the graph I'm dealing with is a net of connected plugins that are mostly written in C (LADSPA plugins). I just calculate the right order once it's needed (in perl, using the Graph modules) and cache that until the the network is changed. After that the speed is acceptable - not great, but good enough for small experiments at least - since all I do is call one method for each plugin to generate a partial stream of X samples. The rest is normally handled in C.
In reply to Re^2: Insight needed: Perl, C, Gtk2, Audio, Threads, IPC & Performance - Oh My!
by Joost
in thread Insight needed: Perl, C, Gtk2, Audio, Threads, IPC & Performance - Oh My!
by Joost
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |