SoC test scheduling algorithm using ACO-based rectangle packing

Jin Ho Ahn, Sungho Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper presents a new SoC test scheduling method based on an ant algorithm. The proposed scheduling algorithm formulates the SoC test scheduling problem as a rectangle bin packing problem and uses AGO to cover more solution space to increase the probability of finding optimal solutions. The experimental results conducted using ITC '02 SoC benchmarks show that the proposed idea gives the test application time comparable to earlier researches in less calculation time.

Original languageEnglish
Title of host publicationComputational Intelligence International Conference on Intelligent Computing, ICIC 2006, Proceedings
PublisherSpringer Verlag
Pages655-660
Number of pages6
ISBN (Print)3540372741, 9783540372745
DOIs
Publication statusPublished - 2006
EventInternational Conference on Intelligent Computing, ICIC 2006 - Kunming, China
Duration: 2006 Aug 162006 Aug 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4114 LNAI - II
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on Intelligent Computing, ICIC 2006
CountryChina
CityKunming
Period06/8/1606/8/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'SoC test scheduling algorithm using ACO-based rectangle packing'. Together they form a unique fingerprint.

Cite this