This paper studies the problem of the space station short-term mission planning, which aims to allocate the executing time of missions effectively, schedule the corresponding resources reasonably and arrange the time ...This paper studies the problem of the space station short-term mission planning, which aims to allocate the executing time of missions effectively, schedule the corresponding resources reasonably and arrange the time of the astronauts properly. A domain model is developed by using the ontology theory to describe the concepts, constraints and relations of the planning domain formally, abstractly and normatively. A method based on time iteration is adopted to solve the short-term planning problem. Meanwhile, the resolving strategies are proposed to resolve different kinds of conflicts induced by the constraints of power, heat, resource, astronaut and relationship. The proposed approach is evaluated in a test case with fifteen missions, thirteen resources and three astronauts. The results show that the developed domain ontology model is reasonable, and the time iteration method using the proposed resolving strategies can successfully obtain the plan satisfying all considered constraints.展开更多
In this paper, a new method for DO-loop parallelization based on the new collcept allocation-dependence and equivalence classification of iteration space is proposed. This method has many advantages: It is a general,...In this paper, a new method for DO-loop parallelization based on the new collcept allocation-dependence and equivalence classification of iteration space is proposed. This method has many advantages: It is a general,ullified method for DO-loop parallelization. It is used in coarse grain parallel partitioning on MINID and SPMD. While partitioning iteration space, it also does the does the partition and computation partition such that these partitions are independent each other. It can extract the potential parallelism of program accurately. Combining with task-level parallelization vectorization and pipeline,it can extract parallelism thoroughly.展开更多
基金supported by the National Natural Science Foundation of China(11402295)the Science Project of National University of Defense Technology(JC14-01-05)the Hunan Provincial Natural Science Foundation of China(2015JJ3020)
文摘This paper studies the problem of the space station short-term mission planning, which aims to allocate the executing time of missions effectively, schedule the corresponding resources reasonably and arrange the time of the astronauts properly. A domain model is developed by using the ontology theory to describe the concepts, constraints and relations of the planning domain formally, abstractly and normatively. A method based on time iteration is adopted to solve the short-term planning problem. Meanwhile, the resolving strategies are proposed to resolve different kinds of conflicts induced by the constraints of power, heat, resource, astronaut and relationship. The proposed approach is evaluated in a test case with fifteen missions, thirteen resources and three astronauts. The results show that the developed domain ontology model is reasonable, and the time iteration method using the proposed resolving strategies can successfully obtain the plan satisfying all considered constraints.
文摘In this paper, a new method for DO-loop parallelization based on the new collcept allocation-dependence and equivalence classification of iteration space is proposed. This method has many advantages: It is a general,ullified method for DO-loop parallelization. It is used in coarse grain parallel partitioning on MINID and SPMD. While partitioning iteration space, it also does the does the partition and computation partition such that these partitions are independent each other. It can extract the potential parallelism of program accurately. Combining with task-level parallelization vectorization and pipeline,it can extract parallelism thoroughly.
