The Left Edge Algorithm and the Tree Growing Technique in Block-Test Scheduling under Power Constraints

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Valentin Muresan Articles by Xiaojun Wang Articles by Valentina Muresan Articles by Mircea Vladutiu

18th IEEE VLSI Test Symposium (VTS'00)

Montreal, Canada

April 30-May 04

ISBN: 0-7695-0613-5

	ASCII Text	x
	Valentin Muresan, Xiaojun Wang, Valentina Muresan, Mircea Vladutiu, "The Left Edge Algorithm and the Tree Growing Technique in Block-Test Scheduling under Power Constraints," VLSI Test Symposium, IEEE, pp. 417, 18th IEEE VLSI Test Symposium (VTS'00), 2000.

	BibTex	x
	@article{ 10.1109/VTEST.2000.843873, author = {Valentin Muresan and Xiaojun Wang and Valentina Muresan and Mircea Vladutiu}, title = {The Left Edge Algorithm and the Tree Growing Technique in Block-Test Scheduling under Power Constraints}, journal ={VLSI Test Symposium, IEEE}, volume = {0}, year = {2000}, issn = {1093-0167}, pages = {417}, doi = {http://doi.ieeecomputersociety.org/10.1109/VTEST.2000.843873}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - VLSI Test Symposium, IEEE TI - The Left Edge Algorithm and the Tree Growing Technique in Block-Test Scheduling under Power Constraints SN - 1093-0167 SP EP A1 - Valentin Muresan, A1 - Xiaojun Wang, A1 - Valentina Muresan, A1 - Mircea Vladutiu, PY - 2000 VL - 0 JA - VLSI Test Symposium, IEEE ER -

Valentin Muresan, Dublin City University

Xiaojun Wang, Dublin City University

Valentina Muresan, University of Timisoara

Mircea Vladutiu, University of Timisoara

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VTEST.2000.843873

The left-edge algorithm is adapted in this paper to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is used in combination with the left-edge algorithm in order to improve the test concurrency under power dissipation limits. Test scheduling example is discussed highlighting further research directions towards an efficient system-level test-scheduling algorithm.

Citation:

Valentin Muresan, Xiaojun Wang, Valentina Muresan, Mircea Vladutiu, "The Left Edge Algorithm and the Tree Growing Technique in Block-Test Scheduling under Power Constraints," vts, pp.417, 18th IEEE VLSI Test Symposium (VTS'00), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.