FastFlow
SVN-r182-Aug-14-2014
A high-level, lock-less, parallel programming (shared-memory) and distributed programming (distributed-memory) framework for multi-cores and many-cores systems
|
Cff::Barrier | Blocking barrier - Used only to start all nodes synchronously |
Cff::ff_allocator | The ff_allocator, based on the idea of the Slab allocator |
▼Cff::ff_node | The FastFlow abstract contanier for a parallel activity (actor) |
Cff::ff_dnode< CommImpl > | Defines ff::ff_dnode |
Cff::ff_farm< lb_t, gt_t > | The Farm skeleton, with Emitter (lb_t ) and Collector (gt_t ) |
Cff::ff_mdf | Macro Data Flow executor |
Cff::ff_minode | Multiple input ff_node (the MPSC mediator) |
Cff::ff_monode | Multiple output ff_node (the SPMC mediator) |
Cff::ff_oclNode | OpenCL implementation of FastFlow node |
▼Cff::ff_pipeline | The Pipeline skeleton (low-level syntax) |
Cff::ff_pipe< TaskType > | Pipeline pattern (high-level pattern syntax) |
Cff::ff_pipe< task_t > | |
Cff::poolEvolution< T, env_t > | The pool evolution parallel pattern |
Cff::ff_dnode< COMM > | |
▼Cff::ff_dnode< COMM1 > | |
Cff::ff_dinout< COMM1, COMM2 > | |
Cff::ff_dnode< COMM2 > | |
Cff::ff_dnode< COMM3 > | |
▼Cff::ff_dnode< CommImplIn > | |
Cff::ff_dinout< CommImplIn, CommImplOut > | A ff::ff_dnode serving both Input and Output to the network |
Cff::ff_dnode< zmq1_1 > | |
Cff::ff_farm< foralllb_t > | |
▼Cff::ff_farm< ofarm_lb, ofarm_gt > | |
Cff::ff_ofarm | The ordered Farm skeleton |
▼Cff::ff_thread | Thread container for (leaves) ff_node |
▼Cff::ff_gatherer | A class representing the Collector node in a Farm skeleton |
Cff::ofarm_gt | Ordered farm Collector |
▼Cff::ff_loadbalancer | A class representing the Emitter node in a typical Farm skeleton |
Cff::ofarm_lb | Ordered farm emitter |
Cff::FFAllocator | A user-space parallel allocator (process-wide) |
Cff::Lamport_Buffer | Implementation of the well-known Lamport's wait-free circular buffer. Not currently used |
CMap | Map pattern |
Cff::MPMC_Ptr_Queue | An implementation of the bounded Multi-Producer/Multi-Consumer queue. Not currently used |
Cff::MSqueue | Michael and Scott MPMC. Not currently used |
Cff::ParallelFor | Parallel for loop. Run automatically |
Cff::ParallelForPipeReduce< task_t > | ParallelForPipeReduce class |
Cff::ParallelForReduce< T > | Parallel for and reduce. Run automatically |
Cff::spinBarrier | Nonblocking barrier - Used only to start all nodes synchronously |
Cff::squeue< T > | Unbound sequential FIFO queue |
Cff::svector< T > | Simple yet efficient dynamic vector |
Cff::svector< bool > | |
Cff::svector< ff::ff_node * > | |
Cff::svector< ff_node * > | |
Cff::svector< int > | |
Cff::svector< msg_t * > | |
Cff::svector< void * > | |
Cff::SWSR_Ptr_Buffer | SPSC bound channel (Single-Writer/Single-Reader) |
Cff::threadMapper | The thread mapper allows to map threads to specific core using a predefined mapping policy |
Cff::uSWSR_Ptr_Buffer | Unbounded Single-Writer/Single-Reader buffer (FastFlow unbound channel) |