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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, JH., Kang, S. (2006). SoC Test Scheduling Algorithm Using ACO-Based Rectangle Packing. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_82
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)