Optimal core wrapper width selection and SOC test scheduling based on 3-D bin packing algorithm

140Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a method to consider a given SOC with pin and peak power constraints, and simultaneously (1) determine an optimal wrapper width for each core, (2) allocate SOC pins to cores and (3) schedule core tests to minimize the test completion time. For the first time the stated problem is formulated as a restricted 3-dimensional bin-packing problem and a heuristic to determine an optimal solution is proposed.

Cite

CITATION STYLE

APA

Huang, Y., Reddy, S. M., Cheng, W. T., Reuter, P., Mukherjee, N., Tsai, C. C., … Zaidan, Y. (2002). Optimal core wrapper width selection and SOC test scheduling based on 3-D bin packing algorithm. In IEEE International Test Conference (TC) (pp. 74–82). https://doi.org/10.1109/TEST.2002.1041747

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free