NDLI: A comparison of classical scheduling approaches in power-constrained block-test scheduling

Content Provider	IEEE Xplore Digital Library
Author	Muresan, V. Xiaojun Wang Muresan, V. Vladutiu, M.
Copyright Year	2000
Description	Author affiliation: Dublin City Univ., Ireland (Muresan, V.)
Abstract	Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned problem. Then, distribution-graph based approaches are described in order to achieve balanced test concurrency and test power dissipation. An extended tree growing technique is also used in combination with these classical approaches in order to improve the test concurrency having assigned power dissipation limits. A comparison between the results of the test scheduling experiments highlights the advantages and disadvantages of applying different classical scheduling algorithms to the power-constrained test scheduling problem.
Starting Page	882
Ending Page	891
File Size	1014212
Page Count	10
File Format	PDF
ISBN	0780365461
ISSN	10893539
DOI	10.1109/TEST.2000.894299
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-10-05
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Circuit testing Power dissipation Concurrent computing System testing Scheduling algorithm Very large scale integration Greedy algorithms Tree graphs Partitioning algorithms Polynomials
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Power-constrained block-test list scheduling

Mixed classical scheduling algorithms and tree growing technique in block-test scheduling under power constraints

The left edge algorithm in block test scheduling under power constraints

Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling

A combined tree growing technique for block-test scheduling under power constraints

The left edge algorithm and the tree growing technique in block-test scheduling under power constraints

GREEDY IIP: partitioning large graphs by greedy iterative improvement

A new test scheduling algorithm for VLSI systems

Resource-constrained scheduling of partitioned algorithms on processor arrays

A comparison of classical scheduling approaches in power-constrained block-test scheduling

Similar Documents

Power-constrained block-test list scheduling

Mixed classical scheduling algorithms and tree growing technique in block-test scheduling under power constraints

The left edge algorithm in block test scheduling under power constraints

Distribution-graph based approach and extended tree growing technique in power-constrained block-test scheduling

A combined tree growing technique for block-test scheduling under power constraints

The left edge algorithm and the tree growing technique in block-test scheduling under power constraints

GREEDY IIP: partitioning large graphs by greedy iterative improvement

A new test scheduling algorithm for VLSI systems

Resource-constrained scheduling of partitioned algorithms on processor arrays

A comparison of classical scheduling approaches in power-constrained block-test scheduling