scheduling.cpp File Reference

#include "scheduling.h"

Functions
	WAITING_QUEUE_HANDLER (AMAP_EDF)
void	waiting_queue_handler_scheduling_default_algo (Scheduler_interface &scheduler)
Return_mapping_information	waiting_queue_handler_mapping_default_algo (Scheduler_interface &scheduler)
	WAITING_QUEUE_HANDLER (default_algo)

Detailed Description

UNS - CNRS Copyright 2012 All Rights Reserved.

These computer program listings and specifications, herein, are the property of Université de Nice Sophia-Antipolis (UNS) and Centre National de la Recherche Scientifique (CNRS), and shall not be reproduced or copied or used in whole or in part as the basis for manufacture or sale of items without written permission. For a license agreement, please contact: conta.nosp@m.ct@s.nosp@m.attse.nosp@m..com

Author

Francois Duhem (Franc.nosp@m.ois..nosp@m.Duhem.nosp@m.@uni.nosp@m.ce.fr), Fabrice Muller (Fabri.nosp@m.ce.M.nosp@m.uller.nosp@m.@uni.nosp@m.ce.fr) University of Nice-Sophia Antipolis - LEAT/CNRS

Version

1.0

Date

2012-10-15

DESCRIPTION

Some defines needed by the scheduler

Function Documentation

WAITING_QUEUE_HANDLER

(

default_algo

)

This function handles scheduling. It looks into the waiting queue for tasks to implement on the FPGA. Currently, the scheduling scheme combines a As Much As Possible (AMAP) mapping with an Earliest-Deadline First (EDF) algorithm. Note that the AMAP mapping may only use as much RZs as there are tasks (i.e. a static implementation). If there are more RZs, then they remain blank.

\ NECESSARY SYNC