Subject: Re: [boost] Boost.Pipeline -- scheduling of segments
From: Hartmut Kaiser (hartmut.kaiser_at_[hidden])
Date: 2014-07-10 10:34:44
> I've put together some slides to show what I'm thinking of and make sure
> are on the same page:
> To point here, assuming a pipeline, one can use extra information to make
> some educated guesses regarding scheduling: Yield to offending queue
> (upstream if input is empty, downstream if output is full), choose
> segment to optimize latency.
> Probably this can be achieved using fibers, or even with coroutines.
> Due to the complexity of HPX I'm not sure how does it compare.
Huh? Complexity? It's 100% API compatible to C++11 and various proposals to
I'd like to know more about why you think HPX is complex.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk