RAIN (RAndom INsertion) scheduling algorithm for SoC test

Jung Been Im, Sunghoon Chun, Geunbae Kim, Jin Ho An, Sungho Kang

Research output: Contribution to journalConference article

7 Citations (Scopus)

Abstract

This paper presents a new SoC (System-on-Chip) test scheduling algorithm. Reducing the test application time is an important issue for a core-based SoC test. In this paper, each core is represented by a rectangle, the height of-which is equal to the TAM width and the width of which is equal to the test time. A 'one-element-exchange' algorithm is used for optimizing the test time of each core and the 'RAIN' scheduling algorithm is used for optimizing the test time of SoC. The RAIN scheduling algorithm uses a sequence pair data structure to represent the placement of rectangles, and obtains the optimized results by inserting into a random position on the sequence pair. The results of the experiments conducted using ITC '02 SoC benchmarks show that the proposed algorithm gives the shortest test application time compared with earlier researches for most of the cases.

Original languageEnglish
Pages (from-to)242-247
Number of pages6
JournalProceedings of the Asian Test Symposium
Publication statusPublished - 2004 Dec 1
EventProceedings of the Asian Test Symposium, ATS'04 - Kenting, Taiwan, Province of China
Duration: 2004 Nov 152004 Nov 17

Fingerprint

Scheduling algorithms
Data structures
System-on-chip
Experiments

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Im, Jung Been ; Chun, Sunghoon ; Kim, Geunbae ; An, Jin Ho ; Kang, Sungho. / RAIN (RAndom INsertion) scheduling algorithm for SoC test. In: Proceedings of the Asian Test Symposium. 2004 ; pp. 242-247.
@article{fd00cbdfda7a4c79b26d49a47532cccf,
title = "RAIN (RAndom INsertion) scheduling algorithm for SoC test",
abstract = "This paper presents a new SoC (System-on-Chip) test scheduling algorithm. Reducing the test application time is an important issue for a core-based SoC test. In this paper, each core is represented by a rectangle, the height of-which is equal to the TAM width and the width of which is equal to the test time. A 'one-element-exchange' algorithm is used for optimizing the test time of each core and the 'RAIN' scheduling algorithm is used for optimizing the test time of SoC. The RAIN scheduling algorithm uses a sequence pair data structure to represent the placement of rectangles, and obtains the optimized results by inserting into a random position on the sequence pair. The results of the experiments conducted using ITC '02 SoC benchmarks show that the proposed algorithm gives the shortest test application time compared with earlier researches for most of the cases.",
author = "Im, {Jung Been} and Sunghoon Chun and Geunbae Kim and An, {Jin Ho} and Sungho Kang",
year = "2004",
month = "12",
day = "1",
language = "English",
pages = "242--247",
journal = "Proceedings of the Asian Test Symposium",
issn = "1081-7735",
publisher = "IEEE Computer Society",

}

RAIN (RAndom INsertion) scheduling algorithm for SoC test. / Im, Jung Been; Chun, Sunghoon; Kim, Geunbae; An, Jin Ho; Kang, Sungho.

In: Proceedings of the Asian Test Symposium, 01.12.2004, p. 242-247.

Research output: Contribution to journalConference article

TY - JOUR

T1 - RAIN (RAndom INsertion) scheduling algorithm for SoC test

AU - Im, Jung Been

AU - Chun, Sunghoon

AU - Kim, Geunbae

AU - An, Jin Ho

AU - Kang, Sungho

PY - 2004/12/1

Y1 - 2004/12/1

N2 - This paper presents a new SoC (System-on-Chip) test scheduling algorithm. Reducing the test application time is an important issue for a core-based SoC test. In this paper, each core is represented by a rectangle, the height of-which is equal to the TAM width and the width of which is equal to the test time. A 'one-element-exchange' algorithm is used for optimizing the test time of each core and the 'RAIN' scheduling algorithm is used for optimizing the test time of SoC. The RAIN scheduling algorithm uses a sequence pair data structure to represent the placement of rectangles, and obtains the optimized results by inserting into a random position on the sequence pair. The results of the experiments conducted using ITC '02 SoC benchmarks show that the proposed algorithm gives the shortest test application time compared with earlier researches for most of the cases.

AB - This paper presents a new SoC (System-on-Chip) test scheduling algorithm. Reducing the test application time is an important issue for a core-based SoC test. In this paper, each core is represented by a rectangle, the height of-which is equal to the TAM width and the width of which is equal to the test time. A 'one-element-exchange' algorithm is used for optimizing the test time of each core and the 'RAIN' scheduling algorithm is used for optimizing the test time of SoC. The RAIN scheduling algorithm uses a sequence pair data structure to represent the placement of rectangles, and obtains the optimized results by inserting into a random position on the sequence pair. The results of the experiments conducted using ITC '02 SoC benchmarks show that the proposed algorithm gives the shortest test application time compared with earlier researches for most of the cases.

UR - http://www.scopus.com/inward/record.url?scp=13244259157&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13244259157&partnerID=8YFLogxK

M3 - Conference article

SP - 242

EP - 247

JO - Proceedings of the Asian Test Symposium

JF - Proceedings of the Asian Test Symposium

SN - 1081-7735

ER -