Detail výsledku

GA Based Test Scheduling Under Power Constraints

ŠKARVADA, J. GA Based Test Scheduling Under Power Constraints. Proceedings of 12th Conference Student EEICT 2006, Volume 4. Brno: Faculty of Electrical Engineering and Communication BUT, 2006. p. 461-465. ISBN: 80-214-3163-6.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Škarvada Jaroslav, Ing., Ph.D., FIT (FIT), UPSY (FIT)
Abstrakt

The paper deals with test scheduling under power constraints. An approach based on genetic algorithm operating on Test Application Conflict Graph is presented. The main goal of the method is to minimize test application time with considering structural resource allocation conflicts and to ensure that test application schedule does not exceed chip power limits. The proposed method was implemented using C++, experimental results with ITC'02 SOC benchmark suite are presented in the paper together with the perspectives for the future research.

Klíčová slova

Genetic algorithm, TACG, ITC'02, SOC, power constrained, test scheduling

URL
Rok
2006
Strany
461–465
Sborník
Proceedings of 12th Conference Student EEICT 2006, Volume 4
Konference
Student EEICT 2006
ISBN
80-214-3163-6
Vydavatel
Faculty of Electrical Engineering and Communication BUT
Místo
Brno
BibTeX 
@inproceedings{BUT22194,
  author="Jaroslav {Škarvada}",
  title="GA Based Test Scheduling Under Power Constraints",
  booktitle="Proceedings of 12th Conference Student EEICT 2006, Volume 4",
  year="2006",
  pages="461--465",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  address="Brno",
  isbn="80-214-3163-6",
  url="http://www.feec.vutbr.cz/EEICT/2006/sbornik/03-Doktorske_projekty/09-Pocitacove_systemy/04-yarda.pdf"
}
Projekty
Moderní metody syntézy číslicových systémů, GAČR, Standardní projekty, GA102/04/0737, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Výzkumné skupiny
Výzkumná skupina Spolehlivé číslicové systémy (VZ DEPSYS)
Pracoviště
Ústav počítačových systémů (UPSY)
Nahoru