Scheduling method for single-arm cluster tools of wafer fabrications with residency and continuous reentrancy

In order to enhance the utilization of single-ann cluster tools and optimize the scheduling problems of dynamic reaching wafers with residency time and continuous reentrancy constraints, a structural heuristic scheduling algorithm is presented. A nonlinear programming scheduling model is built on the basis of bounding the scheduling problem domain. A feasible path search scheduling method of single-arm robotic operations is put forward with the objective of minimal makespan. Finally, simulation experiments are designed to analyze the scheduling algorithms. Results indicate that the proposed algorithm is feasible and valid to solve the scheduling problems of multiple wafer types and single-ann clusters with the conflicts and deadlocks generated by residency time and continuous reentrancy constraints.

A Data Consistency Insurance Method for Smart Contract

As one of the major threats to the current DeFi(Decentralized Finance)ecosystem,reentrant attack induces data inconsistency of the victim smart contract,enabling attackers to steal on-chain assets from DeFi projects,which could terribly do harm to the confidence of the blockchain investors.However,protecting DeFi projects from the reentrant attack is very difficult,since generating a call loop within the highly automatic DeFi ecosystem could be very practicable.Existing researchers mainly focus on the detection of the reentrant vulnerabilities in the code testing,and no method could promise the non-existent of reentrant vulnerabilities.In this paper,we introduce the database lock mechanism to isolate the correlated smart contract states from other operations in the same contract,so that we can prevent the attackers from abusing the inconsistent smart contract state.Compared to the existing resolutions of front-running,code audit,andmodifier,our method guarantees protection resultswith better flexibility.And we further evaluate our method on a number of de facto reentrant attacks observed from Etherscan.The results prove that our method could efficiently prevent the reentrant attack with less running cost.

Scheduling algorithm of dual-armed cluster tools with residency time and reentrant constraints

To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.