TN14%13B 98021202软X射线布拉格-菲涅耳多层膜-维聚焦镜的近似理论设计=Approximate theory for 1-D focusingbragg-fresnel multilayer lens[刊,中]/乐孜纯,曹健林(中科院长春光机所应用光学国家重点实验室.吉林,长春(130022))∥光学...TN14%13B 98021202软X射线布拉格-菲涅耳多层膜-维聚焦镜的近似理论设计=Approximate theory for 1-D focusingbragg-fresnel multilayer lens[刊,中]/乐孜纯,曹健林(中科院长春光机所应用光学国家重点实验室.吉林,长春(130022))∥光学学报.-1997,17(6).-802-808从动力学原理出发对X射线布拉格-菲涅耳多层膜一维聚焦镜的近似设计理论作了推导,给出了近似方程并对近似理论作了误差分析。同时给出了作者编制的数值化计算机程序系统的设计框图及其设计结果,也给出了多层膜膜系设计结果。图5表1参10(严寒)展开更多
A new file assignment strategy of parallel I/O, which is named heuristic file sorted assignment algorithm was proposed on cluster computing system. Based on the load balancing, it assigns the files to the same disk ac...A new file assignment strategy of parallel I/O, which is named heuristic file sorted assignment algorithm was proposed on cluster computing system. Based on the load balancing, it assigns the files to the same disk according to the similar service time. Firstly, the files were sorted and stored at the set I in descending order in terms of their service time, then one disk of cluster node was selected randomly when the files were to be assigned, and at last the continuous files were taken orderly from the set I to the disk until the disk reached its load maximum. The experimental results show that the new strategy improves the performance by 20.2% when the load of the system is light and by 31.6% when the load is heavy. And the higher the data access rate, the more evident the improvement of the performance obtained by the heuristic file sorted assignment algorithm.展开更多
文摘TN14%13B 98021202软X射线布拉格-菲涅耳多层膜-维聚焦镜的近似理论设计=Approximate theory for 1-D focusingbragg-fresnel multilayer lens[刊,中]/乐孜纯,曹健林(中科院长春光机所应用光学国家重点实验室.吉林,长春(130022))∥光学学报.-1997,17(6).-802-808从动力学原理出发对X射线布拉格-菲涅耳多层膜一维聚焦镜的近似设计理论作了推导,给出了近似方程并对近似理论作了误差分析。同时给出了作者编制的数值化计算机程序系统的设计框图及其设计结果,也给出了多层膜膜系设计结果。图5表1参10(严寒)
文摘A new file assignment strategy of parallel I/O, which is named heuristic file sorted assignment algorithm was proposed on cluster computing system. Based on the load balancing, it assigns the files to the same disk according to the similar service time. Firstly, the files were sorted and stored at the set I in descending order in terms of their service time, then one disk of cluster node was selected randomly when the files were to be assigned, and at last the continuous files were taken orderly from the set I to the disk until the disk reached its load maximum. The experimental results show that the new strategy improves the performance by 20.2% when the load of the system is light and by 31.6% when the load is heavy. And the higher the data access rate, the more evident the improvement of the performance obtained by the heuristic file sorted assignment algorithm.
