ECRTS2011
HomeDiscover PortoProgramKeynote SpeakersRegistrationVenue & HotelsSatellite WorkshopsWork in ProgressCall for PapersPaper SubmissionImportant DatesOrganizers
CISTER - Research Centre in Real-Time Computing Systems
ISEP / IPP
Porto Cidade Ci?ncia
Porto
Funda??o Calouste Gulbenkian
Funda??o para a Ci?ncia e a Tecnologia - MCTES
Critical Software
Metro do PortoTimeout Porto
Santander Totta
Telef - Transportes por Cabo e Concess?es
Taylor's Port

Program

Program
 

Meeting Deadlines Cheaply

Julien Legriel1 and Oded Maler2
1STMicroelectronics, 2Cnrs-Verimag

Abstract


We develop a computational framework for solving the problem of finding the cheapest configuration (in terms of the number of processors and their respective speeds) of a multiprocessor architecture on which a task graph can be scheduled within a given deadline. We then extend the problem in three orthogonal directions: taking communication volume into account, considering the case where a stream of instances of the task graph arrives periodically and reformulating the problem as a bi-criteria optimization for which we approximate the Pareto front.