On Tuesday 21 August 2007 22:25, Tim Blechmann wrote: > i somehow doubt, that i would make sense to use a jackdmp-style > multicore scheduling algorithm for a max/pd/nova dsp graph, which can > easily contain thousands of nodes (jack graphs are usually rather > small), because of the scheduling overhead ... > > however, i was thinking about ways to implement a hybrid system with > automatic segmentation of the dsp graph into parallel dsp chains that > can be scheduled with a dataflow algorithm ... but it would require lots > of performance tests to tweak the heuristics of the graph > segmentation ... for now, i had neither time nor funding ... (but maybe > it is an interesting topic for my master thesis?)
Have you considered delegating these worries to something along the lines of threadweaver, which is designed for just this? http://developer.kde.org/documentation/library/cvs-api/kdelibs-apidocs/threadweaver/html/index.html robert. _______________________________________________ PD-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list