可执行体系结构建模与仿真验证在复杂大系统和体系的设计与构建中起着至关重要的作用,但目前相关的概念和方法还不是很成熟,缺乏统一的认识和标准,针对不同的可执行需求存在着很多不同的执行机制和执行环境。分析和总结了可执行体系结...可执行体系结构建模与仿真验证在复杂大系统和体系的设计与构建中起着至关重要的作用,但目前相关的概念和方法还不是很成熟,缺乏统一的认识和标准,针对不同的可执行需求存在着很多不同的执行机制和执行环境。分析和总结了可执行体系结构建模的三大要素,并且比较了这些要素的可选项,提出了一个基于Parallel Discrete Event System Specification(P-DEVS)的通用可执行体系结构建模与仿真方法,实现了从图形化建模到仿真代码自动生成的全过程,结合实例介绍了所提方法在机场综合信息系统中的应用来证明该方法的可行性和有效性。展开更多
A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a res...A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.展开更多
文摘可执行体系结构建模与仿真验证在复杂大系统和体系的设计与构建中起着至关重要的作用,但目前相关的概念和方法还不是很成熟,缺乏统一的认识和标准,针对不同的可执行需求存在着很多不同的执行机制和执行环境。分析和总结了可执行体系结构建模的三大要素,并且比较了这些要素的可选项,提出了一个基于Parallel Discrete Event System Specification(P-DEVS)的通用可执行体系结构建模与仿真方法,实现了从图形化建模到仿真代码自动生成的全过程,结合实例介绍了所提方法在机场综合信息系统中的应用来证明该方法的可行性和有效性。
基金supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2012R1A1A4A0105777)supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (NIPA-2013-H030113-4007) supervised by the NIPA (National IT Industry Promotion Agency)
文摘A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.
