公开(公告)号：US06898776B1

公开(公告)日：2005-05-24

申请号：US10162008

申请日：2002-06-03

申请人： Neil G. Jacobson ,  Emigdio M. Flores Jr. ,  Sanjay Srivastava ,  Bin Dai ,  Sungnien Jerry Mao

发明人： Neil G. Jacobson ,  Emigdio M. Flores Jr. ,  Sanjay Srivastava ,  Bin Dai ,  Sungnien Jerry Mao

IPC分类号： G06F17/50

CPC分类号： G06F17/5054

摘要： A method for concurrently programming a series of in-system devices by grouping the devices into sequentially-programmed groups, wherein a best possible grouping of devices is determined that achieves a minimum total configuration time. When a system includes multiple devices, it is sometimes more efficient (i.e., requires less total configuration time) to program the devices in two or more groups, as compared to programming all of the devices at the same time (i.e., as a single group). The method utilizes device information to identify an optimal or best grouping by comparing the total configuration times of several possible groupings, and selecting the grouping having the lowest total configuration time. Once a best grouping is determined, programming is performed by selecting a first group from the grouping and programming the first group while bypassing devices all other groups. Once the first group is programmed, a next group is programmed, and so on.

摘要翻译： 一种用于通过将设备分组为顺序编程的组来同时编程一系列系统内设备的方法，其中确定实现最小总配置时间的最佳可能的设备分组。 当系统包括多个设备时，与同时编程所有设备（即，作为单个组）相比，有时更有效（即，需要更少的总配置时间）来编程两个或更多个组中的设备 ）。 该方法利用设备信息通过比较几个可能的分组的总配置时间以及选择具有最低总配置时间的分组来识别最佳或最佳分组。 一旦确定了最佳分组，则通过从分组中选择第一组并且在绕过所有其他组的设备的同时编程第一组来执行编程。 一旦第一组被编程，下一个组被编程，依此类推。