- -

Power-aware scheduling with effective task migration for real-time multicore embedded systems

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Power-aware scheduling with effective task migration for real-time multicore embedded systems

Show simple item record

Files in this item

dc.contributor.author March Cabrelles, José Luis es_ES
dc.contributor.author Sahuquillo Borrás, Julio es_ES
dc.contributor.author Petit Martí, Salvador Vicente es_ES
dc.contributor.author Hassan Mohamed, Houcine es_ES
dc.contributor.author Duato Marín, José Francisco es_ES
dc.date.accessioned 2014-06-30T09:37:56Z
dc.date.issued 2013-09
dc.identifier.issn 1532-0626
dc.identifier.uri http://hdl.handle.net/10251/38465
dc.description.abstract A major design issue in embedded systems is reducing the power consumption because batteries have a limited energy budget. For this purpose, several techniques such as dynamic voltage and frequency scaling (DVFS) or task migration are being used. DVFS allows reducing power by selecting the optimal voltage supply, whereas task migration achieves this effect by balancing the workload among cores. This paper focuses on power-aware scheduling allowing task migration to reduce energy consumption in multicore embedded systems implementing DVFS capabilities. To address energy savings, the devised schedulers follow two main rules: migrations are allowed at specific points of time and only one task is allowed to migrate each time. Two algorithms have been proposed working under real-time constraints. The simpler algorithm, namely, single option migration (SOM) only checks just one target core before performing a migration. In contrast, the multiple option migration (MOM) searches the optimal target core. In general, the MOM algorithm achieves better energy savings than the SOM algorithm, although differences are wider for a reduced number of cores and frequency/voltage levels. Moreover, the MOM algorithm reduces energy consumption as much as 40% over the worst fit algorithm. es_ES
dc.description.sponsorship This work was supported by the Spanish MICINN, Consolider Programme and Plan E funds, as well as European Commission FEDER funds, under Grants CSD2006-00046 and TIN2009-14475-C04-01. en_EN
dc.format.extent 15 es_ES
dc.language Inglés es_ES
dc.publisher Wiley es_ES
dc.relation Spanish MICINN es_ES
dc.relation Consolider Programme and Plan E funds es_ES
dc.relation European Commission FEDER funds [CSD2006-00046] [TIN2009-14475-C04-01] es_ES
dc.relation.ispartof Concurrency and Computation: Practice and Experience es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Dynamic Partitioning es_ES
dc.subject Task migration es_ES
dc.subject Embedded systems es_ES
dc.subject Power-aware es_ES
dc.subject Multicore es_ES
dc.subject Real-time systems es_ES
dc.subject.classification ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES es_ES
dc.title Power-aware scheduling with effective task migration for real-time multicore embedded systems es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1002/cpe.2899
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Informática de Sistemas y Computadores - Departament d'Informàtica de Sistemes i Computadors es_ES
dc.description.bibliographicCitation March Cabrelles, JL.; Sahuquillo Borrás, J.; Petit Martí, SV.; Hassan Mohamed, H.; Duato Marín, JF. (2013). Power-aware scheduling with effective task migration for real-time multicore embedded systems. Concurrency and Computation: Practice and Experience. 25(14):1987-2001. doi:10.1002/cpe.2899 es_ES
dc.description.accrualMethod Senia es_ES
dc.relation.publisherversion http://onlinelibrary.wiley.com/doi/10.1002/cpe.2899/pdf es_ES
dc.description.upvformatpinicio 1987 es_ES
dc.description.upvformatpfin 2001 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 25 es_ES
dc.description.issue 14 es_ES
dc.relation.senia 256412


This item appears in the following Collection(s)

Show simple item record