连续微流控生物芯片下存储最小化的高级综合设计方法
本发明涉及一种连续微流控生物芯片下存储最小化的高级综合设计方法,基于路径调度算法,其特征在于,包括以下步骤:步骤S1:根据给定时序图,遍历计算所有操作的优先权,确定操作的调度顺序;步骤S2:优先调度具有较小优先权的操作,计算特定组件的准备时间,选择准备时间最早的组件,绑定并执行所调度的操作;步骤S3:调度该操作优先权最小且就绪的子操作,进行绑定;步骤S4:调度执行给定时序图中所有的操作,得到一组绑定和调度解,以及组件之间的流体运输任务,完成高级综合设计。本发明能获得具有较少存储次数的连续微流控生物芯片的高级综合设计方案。 The invention relates to an advanced...
Saved in:
| Format | Patent |
|---|---|
| Language | Chinese |
| Published |
21.02.2023
|
| Subjects | |
| Online Access | Get full text |
Cover
| Summary: | 本发明涉及一种连续微流控生物芯片下存储最小化的高级综合设计方法,基于路径调度算法,其特征在于,包括以下步骤:步骤S1:根据给定时序图,遍历计算所有操作的优先权,确定操作的调度顺序;步骤S2:优先调度具有较小优先权的操作,计算特定组件的准备时间,选择准备时间最早的组件,绑定并执行所调度的操作;步骤S3:调度该操作优先权最小且就绪的子操作,进行绑定;步骤S4:调度执行给定时序图中所有的操作,得到一组绑定和调度解,以及组件之间的流体运输任务,完成高级综合设计。本发明能获得具有较少存储次数的连续微流控生物芯片的高级综合设计方案。
The invention relates to an advanced comprehensive design method for storage minimization under a continuous micro-fluidic biochip, which is based on a path scheduling algorithm, and is characterized by comprising the following steps: S1, traversing and calculating priorities of all operations according to a given time sequence diagram, and determining a scheduling sequence of the operations; S2, preferentially scheduling operation with relatively low priority, calculating preparation time of a specific component, selecting the component with the earliest preparation time, and binding and executing the scheduled operation; S3, scheduling a ready sub-operation with the minimum priority of the operation, and carrying out binding; and S4, scheduling and |
|---|---|
| Bibliography: | Application Number: CN202110337815 |