To solve the deadlock problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, an improved ant colony sy...To solve the deadlock problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, an improved ant colony system （ACS） based algorithm is proposed. First, how to map the resource assignment and task scheduling （RATS） problem into the optimization selection problem of task resource assignment graph （TRAG） and to add the semaphore mechanism in the optimal TRAG to solve deadlocks are explained. Secondly, how to utilize the grid pheromone system model to realize the algorithm based on ACS is explicated. This refers to the construction of TRAG by the random selection of appropriate resources for each task by the user agent and the optimization of TRAG through the positive feedback and distributed parallel computing mechanism of the ACS. Simulation results show that the proposed algorithm is effective and efficient in solving the deadlock problem.展开更多
Efficient spectrum resource allocation in wireless heterogeneous networks is important for improving the system throughput and guaranteeing the user's Quality-of-Service(QoS).In this paper,we propose an enhanced a...Efficient spectrum resource allocation in wireless heterogeneous networks is important for improving the system throughput and guaranteeing the user's Quality-of-Service(QoS).In this paper,we propose an enhanced algorithm for spectrum resource allocation in heterogeneous networks.First,the bandwidth of each user is determined by the user's rate demand and the channel state.Second,graph theory is enhanced and used to improve the spectrum efficiency.Third,spectrum resource is dynamically split between macrocell and femtocells with the changes of users' conditions.Our simulation results show that the proposed algorithm improves the system throughput significantly and also guarantees the fairness for the users.展开更多
To decrease the time of generating a closure, a parallel algorithm of generating the closure of a resource description framework schema （RDFS） source is presented. In the algorithm, RDFS triples in the source are cl...To decrease the time of generating a closure, a parallel algorithm of generating the closure of a resource description framework schema （RDFS） source is presented. In the algorithm, RDFS triples in the source are classified according to the forms of triples in the entailment rules and it reduces the scope of searching for specific triples. The dependence among the classes of triples is analyzed. Based on the classification, the initial RDFS source is partitioned into several subsets. The subsets are distributed to each process, and the closure is generated in parallel by applying the RDFS entailment rules. Parallel generating the closure of an RDFS source takes less time and increases efficiency.展开更多
文摘To solve the deadlock problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, an improved ant colony system （ACS） based algorithm is proposed. First, how to map the resource assignment and task scheduling （RATS） problem into the optimization selection problem of task resource assignment graph （TRAG） and to add the semaphore mechanism in the optimal TRAG to solve deadlocks are explained. Secondly, how to utilize the grid pheromone system model to realize the algorithm based on ACS is explicated. This refers to the construction of TRAG by the random selection of appropriate resources for each task by the user agent and the optimization of TRAG through the positive feedback and distributed parallel computing mechanism of the ACS. Simulation results show that the proposed algorithm is effective and efficient in solving the deadlock problem.
基金supported in part by National Natural Science Foundation(61231008)Natural Science Foundation of Shannxi Province(2015JQ6248)+1 种基金National S&T Major Project(2012ZX03003005-005)the 111 Project (B08038)
文摘Efficient spectrum resource allocation in wireless heterogeneous networks is important for improving the system throughput and guaranteeing the user's Quality-of-Service(QoS).In this paper,we propose an enhanced algorithm for spectrum resource allocation in heterogeneous networks.First,the bandwidth of each user is determined by the user's rate demand and the channel state.Second,graph theory is enhanced and used to improve the spectrum efficiency.Third,spectrum resource is dynamically split between macrocell and femtocells with the changes of users' conditions.Our simulation results show that the proposed algorithm improves the system throughput significantly and also guarantees the fairness for the users.
基金The Weaponry Equipment Foundation of PLA Equipment Ministry (No.51406020105JB8103).
文摘To decrease the time of generating a closure, a parallel algorithm of generating the closure of a resource description framework schema （RDFS） source is presented. In the algorithm, RDFS triples in the source are classified according to the forms of triples in the entailment rules and it reduces the scope of searching for specific triples. The dependence among the classes of triples is analyzed. Based on the classification, the initial RDFS source is partitioned into several subsets. The subsets are distributed to each process, and the closure is generated in parallel by applying the RDFS entailment rules. Parallel generating the closure of an RDFS source takes less time and increases efficiency.
