Optimal Granularity of Parallel Test Generation on the Client-Agent-Server Model
URI | http://harp.lib.hiroshima-u.ac.jp/hiroshima-cu/metadata/6412 | ||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
File |
110002722794.pdf
( 877.0 KB )
Open Date
:2010-04-13
|
||||||||||||||||||
Title |
Optimal Granularity of Parallel Test Generation on the Client-Agent-Server Model
|
||||||||||||||||||
Author |
|
||||||||||||||||||
Abstract |
This paper proposes a Client-Agent-Server model (CAS model) which can decrease the work load of the client by adding agent processors to the Client-Server model and presents an approach to parallel test generation for logic circuits on the CAS model. In this paper, we consider the fault parallelism in which a cluster of faults will be allocated from the client processor to an agent processor and from an agent processor to a server processor for the CAS model. Hence, we have to consider two granulatities ; one is the size of the cluster between the client and agents, and the other is the size of the cluster between agents and severs. We formulate the problem of test generation for the CAS modle and analyze the optimal pair of granulatities in both cases of static and dynamic task allocation. Finally, we present experimental results based on an implementation of our CAS model on a network of workstations using the ISCAS'89 benchmark circuits. The experimental results are very colse to the analytical results which confirms the existence of an optimal pair of granularities that minimizes the total processing time for benchmark circuits as well as analysis. |
||||||||||||||||||
Description Peer Reviewed |
有
|
||||||||||||||||||
Journal Title |
情報処理学会論文誌
|
||||||||||||||||||
Volume |
35
|
||||||||||||||||||
Issue |
8
|
||||||||||||||||||
Spage |
1614
|
||||||||||||||||||
Epage |
1623
|
||||||||||||||||||
Published Date |
1994-08-15
|
||||||||||||||||||
Publisher |
社団法人情報処理学会
|
||||||||||||||||||
ISSN |
0387-5806
|
||||||||||||||||||
NCID |
AN00116647
|
||||||||||||||||||
NAID |
110002722794
|
||||||||||||||||||
Language |
eng
|
||||||||||||||||||
NIIType |
Journal Article
|
||||||||||||||||||
Text Version |
出版社版
|
||||||||||||||||||
Rights |
ここに掲載した著作物の利用に関する注意:本著作物の著作権は(社)情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。 / The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan.
|
||||||||||||||||||
Relation |
isVersionOf:http://ci.nii.ac.jp/naid/110002722794
|
||||||||||||||||||
Relation URL | |||||||||||||||||||
Old URI | |||||||||||||||||||
Set |
hiroshima-cu
|