Advertisement

SoC Test Scheduling Algorithm Using ACO-Based Rectangle Packing

  • Jin-Ho Ahn
  • Sungho Kang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4114)

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 ACO 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jin-Ho Ahn
    • 1
  • Sungho Kang
    • 1
  1. 1.Department of Electrical and Electronic Engineering, Yonsei University, 134 Shinchon-dong, Sodaemun-gu, Seoul, 120-749Korea

Personalised recommendations