In this paper, we develop a futures trading simulation system to determine how speculative behavior affects the futures mar ket. A eonfigurable client is designed to simulate traders, and users can define trade strate...In this paper, we develop a futures trading simulation system to determine how speculative behavior affects the futures mar ket. A eonfigurable client is designed to simulate traders, and users can define trade strategies using different programming languages. A lightweight server is designed to handle large scale and highly eoncmTent access requests from clients. HBase is chosen as the database to grantee sealability of the system. As HBase only supports single row transaction, a transaction support mechanism is developed to improve data consistency for HBase. The HBase transaction support mecha nism supports multirow and multitaMe by using two phase commit protocol. The experiments indicate that our system shows high efficiency in the face of the large scale and high concurrency access request, and the read/write performance loss of HBase introduced by the transaction support mecha nisms is also acceptable.展开更多
Overhead-hoist-transporters (OHTs) have become the most appropriate tools to transport wafer lots between inter-bay and intra-bay in united layouts of automated material handling systems (AMHSs) in 300 mm semiconducto...Overhead-hoist-transporters (OHTs) have become the most appropriate tools to transport wafer lots between inter-bay and intra-bay in united layouts of automated material handling systems (AMHSs) in 300 mm semiconductor wafer fabrications. To obtain a conflict-free scheduling solution, an intelligent multi-agent-based control system framework was built to support the AMHSs. And corresponding algorithms and rules were proposed to implement cooperation among agents. On the basis of the mentioned above, a time-constraint-based heuristic scheduling algorithm was presented to support the routing decision agent in searching the conflict-free shortest path. In the construction of the algorithm, the conflicted intervals of the k-shortest-route were identified with the time window theory. The most available path was chosen with an objective of the minimum completion time. The back tracking method was combined to finish the routing scheduling. Finally, experiments of the proposed method were simulated. The results show that the multi-agent framework is suitable and the proposed scheduling algorithm is feasible and valid.展开更多
文摘In this paper, we develop a futures trading simulation system to determine how speculative behavior affects the futures mar ket. A eonfigurable client is designed to simulate traders, and users can define trade strategies using different programming languages. A lightweight server is designed to handle large scale and highly eoncmTent access requests from clients. HBase is chosen as the database to grantee sealability of the system. As HBase only supports single row transaction, a transaction support mechanism is developed to improve data consistency for HBase. The HBase transaction support mecha nism supports multirow and multitaMe by using two phase commit protocol. The experiments indicate that our system shows high efficiency in the face of the large scale and high concurrency access request, and the read/write performance loss of HBase introduced by the transaction support mecha nisms is also acceptable.
基金National Natural Science Foundations of China(No. 61273035,No. 71071115)National High-Tech R&D Program for CIMS,China(No. 2009AA043000)
文摘Overhead-hoist-transporters (OHTs) have become the most appropriate tools to transport wafer lots between inter-bay and intra-bay in united layouts of automated material handling systems (AMHSs) in 300 mm semiconductor wafer fabrications. To obtain a conflict-free scheduling solution, an intelligent multi-agent-based control system framework was built to support the AMHSs. And corresponding algorithms and rules were proposed to implement cooperation among agents. On the basis of the mentioned above, a time-constraint-based heuristic scheduling algorithm was presented to support the routing decision agent in searching the conflict-free shortest path. In the construction of the algorithm, the conflicted intervals of the k-shortest-route were identified with the time window theory. The most available path was chosen with an objective of the minimum completion time. The back tracking method was combined to finish the routing scheduling. Finally, experiments of the proposed method were simulated. The results show that the multi-agent framework is suitable and the proposed scheduling algorithm is feasible and valid.
