#include <pelib/Algebra.hpp>
#include <crown/CrownAllocation.hpp>

Include dependency graph for allocation.h:

This graph shows which files directly or indirectly include this file:

Functions
pelib::Algebra	allocation_fastest (const pelib::Algebra &input)
pelib::Algebra	allocation_random (const pelib::Algebra &input)
pelib::Algebra	allocation_gemin (const pelib::Algebra &schedule, float gemin)
pelib::Algebra	allocation_temin (const pelib::Algebra &schedule)
float	allocation_fastest_complexity (const pelib::Algebra &schedule)
const pelib::crown::CrownAllocation *	crown_allocation (size_t argc, char **argv)
void	crown_delete (pelib::Algebra *alloc)

Function Documentation

pelib::Algebra allocation_fastest ( const pelib::Algebra & input )

Computes task allocation that minimize the execution time of individual tasks

Definition at line 74 of file allocation.cpp.

float allocation_fastest_complexity ( const pelib::Algebra & schedule )

Return the time in number of instructions as given by a time complexity analysis to run the fastest allocation algorithm with the given input problem.

Definition at line 311 of file allocation.cpp.

pelib::Algebra allocation_gemin	(	const pelib::Algebra &	schedule,
		float	gemin
	)

Compute a task allocation constrained by a minimal efficiency for tasks

pelib::Algebra allocation_random ( const pelib::Algebra & input )

Computes a random task allocation

pelib::Algebra allocation_temin ( const pelib::Algebra & schedule )

Compute an allocation that maximizes speedup of each tasks individually, given a minimum efficiency constraint per task in vector temin, or scalar gemin if temin doesn't exists, or 0.5 if neither temin or gemin is in input Algebra collection.

const pelib::crown::CrownAllocation* crown_allocation	(	size_t	argc,
		char **	argv
	)

Dynamic libraries

Definition at line 87 of file allocation-fastest.cpp.

void crown_delete ( pelib::Algebra * alloc )

Functions

Function Documentation