Parametric Dependencies Internal

Collaboration diagram for Parametric Dependencies Internal:

Classes
class	stapl::skeletons::skeletons_impl::alltoall_pd< T, tags::flat >
	In a flat alltoall, parametric dependencies are defined in such a way that each node depends on every node in the producer. More...
struct	stapl::skeletons::skeletons_impl::alltoall_merge< T, Tag >
	The workfunction used in flat and hybrid alltoall for merging the incoming messages. More...
struct	stapl::skeletons::skeletons_impl::alltoall_filter< T, Tag >
	The filtering used in hybrid, flat, and pairwise exchange alltoalls for sending only the requested part to other participants. More...
struct	stapl::skeletons::skeletons_impl::alltoall_filter< T, tags::butterfly< B > >
	A specific filtering used in recursive-doubling (butterfly) implementation of all_to_all. More...
class	stapl::skeletons::skeletons_impl::alltoall_merge< T, tags::butterfly< B > >
	Merges the results from two given inputs by putting one chunk of size butterfly_size from the first and then the same size from the second until both inputs are exhausted. More...
struct	stapl::skeletons::skeletons_impl::alltoall_merge< T, tags::pairwise_exchange >
	The workfunction used in pairwise exchange alltoall for merging the incoming messages. More...
class	stapl::skeletons::skeletons_impl::alltoall_pd< T, tags::hybrid >
	The hybrid alltoall parametric dependency is used for alltoall skeleton in the cases of having large messages. The parametric dependency in this case is defined as a hybrid of the flat and butterfly-based version of alltoall. More...
class	stapl::skeletons::skeletons_impl::alltoall_pd< T, tags::pairwise_exchange >
	In a pairwise exchange alltoall, parametric dependencies are defined in such a way that each node depends on every node in the producer. More...
class	stapl::skeletons::skeletons_impl::binary_tree_pd< Op, Tag >
	This binary tree parametric dependency is one of the several possible parametric dependencies that can be used in a binary tree. This parametric dependency is used with tree in order to create reduction trees. This parametric dependency can have different layouts which are determined by the given Tag. More...
class	stapl::skeletons::skeletons_impl::binomial_tree_pd< Op, Tag >
	This reduce parametric dependency is one of the several possible parametric dependencies that can be used in reduction. More...
class	stapl::skeletons::skeletons_impl::bitonic_sort_pd< Op >
	The bitonicsort parametric dependency defines the dependencies for each point in the global bitonicsort skeleton. At each local point either a minimum or a maximum will be computed depending on where this point is located in the global skeleton. This will be described in the Op. More...
class	stapl::skeletons::skeletons_impl::bitreversal_pd
	A bitreversal parametric dependency used in the bitreversal skeleton. More...
class	stapl::skeletons::skeletons_impl::butterfly_pd< Op, F, is_position_aware, is_reversed >
	A butterfly parametric dependency defines the dependencies for each element in a big butterfly skeleton. Some algorithms that use butterfly_pd need to know the location of the element in the big butterfly skeleton. An example is DIT FFT algorithm that changes the computation based on the location of the parametric dependency. For the same reason is_position_aware should be specified by user in such cases. In addition, in some cases one would like to read partially from the inputs on a butterfly. That's when the the F (filter) can be used. More...
struct	stapl::skeletons::skeletons_impl::do_while_stubs< ContCond >
	There are three elements pushed on the top of the memento when this method is invoked. Two of them stand for the current iteration and one is for the one that comes after this iteration. More...
class	stapl::skeletons::skeletons_impl::do_while_pd< ContCond >
	A do_while parametric dependency represents an element in the dependence graph that controls if the next iteration of a do-while loop should be spawned or not. It does that by wrapping user's ContCond by do_while_stub with and sending memento_stack to it. More...
class	stapl::skeletons::skeletons_impl::expand_from_pow_two_pd< Op, F, is_position_aware, SetResult >
	This parametric dependency is used in the postprocessing phase of various algorithms that only accept power-of-two input sizes. More...
class	stapl::skeletons::skeletons_impl::farm_pd< Generator >
	This parametric dependency is used in farms skeleton to generate the initial seeds of computation. More...
class	stapl::skeletons::skeletons_impl::notify_map_pd< Op, NotifCount, F >
	A notify_map parametric dependency is similar to a map_pd, however, it waits for NotifCount notifications from the first NotifCount flows. More...
class	stapl::skeletons::skeletons_impl::odd_even_merge_sort_pd< Op >
	The oddevenmergesort parametric dependency defines the dependencies for each point in the global oddevenmergesort skeleton. At each local point either a minimum or a maximum will be computed depending on where this point is located in the global skeleton. This will be described in the Op. More...
class	stapl::skeletons::skeletons_impl::pointer_jumping_pd< Op >
	A pointer-jumping parametric dependency can be used in various skeletons. One good example is hillis_steele_scan in which scan is done in a non-work optimal but smaller tree. More...
class	stapl::skeletons::skeletons_impl::reduce_to_pow_two_pd< Op >
	This parametric dependency is used in the preprocessing phase of various algorithms that only accept power-of-two input sizes. More...
class	stapl::skeletons::skeletons_impl::reverse_binary_tree_pd< Op, Tag, Filter, isPositionAware, SetResult >
	A simple broadcast parametric dependency is usually used in combination with reverse_tree to define broadcast and defines the parametric dependency for each element in a broadcast tree. More...
class	stapl::skeletons::skeletons_impl::scan_blelloch_broadcast_pd< Op, T >
	Tis parametric dependency is used in the broadcast tree of Blelloch scan, in which each element applies the operation on inputs from the previous level of the tree and inputs from the reduction tree. Blelloch scan is an exclusive scan algorithm. More...
class	stapl::skeletons::skeletons_impl::scan_broadcast_pd< Op >
	One way to do an inclusive scan is to use the algorithm mentioned in An Introduction to Parallel Algorithms by Joseph Jaja, page 48. This parametric dependency represents the broadcast (top-down) traversal in the above mentioned algorithm. More...
class	stapl::skeletons::skeletons_impl::scan_expand_from_pow_two_pd< Op, Tag >
	An parametric dependency used in the postprocessing phase of arbitrary size scan skeletons. More...
class	stapl::skeletons::skeletons_impl::scan_expand_from_pow_two_pd< Op, tags::scan< Tag, tags::inclusive > >
	A scan expansion parametric dependency used for the postprocessing phase of inclusive scan skeletons. More...
class	stapl::skeletons::skeletons_impl::scan_expand_from_pow_two_pd< Op, tags::scan< Tag, tags::exclusive > >
	A scan expansion parametric dependency used for the postprocessing phase of exclusive scan skeletons. More...
class	stapl::skeletons::skeletons_impl::serial_pd< Op, i >
	A serial_pd parametric dependency used in the serial skeleton. More...
class	stapl::skeletons::skeletons_impl::shifted_first_pd< Op, T, i >
	This parametric dependency is used in the cases similar to the zip_pd, but whenever the reading from the first input flow is shifted by 1. More...
class	stapl::skeletons::skeletons_impl::stencil_2d_pd< Op >
	In a 2D stencil, parametric dependencies are defined in such a way that each node depends on every 9 node in its surroundings including itself from the previous timestep. More...
struct	stapl::skeletons::skeletons_impl::param_deps_defaults
	Provides the default implementation of methods required for all parametric dependencies in the framework. More...
class	stapl::skeletons::skeletons_impl::zip_pd< Op, i, dims, F, Mappers, SetResult >
	A zip parametric dependency is usually used in zip skeleton. It sends input with the same index of each flow to the given Op. More...

Detailed Description

Implementations.