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.展开更多
Because of the anonymity and openness of E-commerce, the on-line transaction and the selection of network resources meet new challenges. For this reason, a trust domain-based multi-agent model for network resource sel...Because of the anonymity and openness of E-commerce, the on-line transaction and the selection of network resources meet new challenges. For this reason, a trust domain-based multi-agent model for network resource selection is presented. The model divides the network into numbers of trust domains and prevents the inconsistency of information maintained by different agents through the periodical communication among the agents. The model enables consumers to receive the response from the agents much quicker because the trust values of participators are evalUated and updated dynamically and timely after the completion of each transaction. In order to make users choose the best matching services and give users with trusted services, the model takes into account the similarity between services and the service providers＇ recognition to the services. Finally, the model illustrates the effectiveness and feasibility according to the experiment.展开更多
文摘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 by the National Natural Science Foundation of China （No. 60873203 ）, the Natural Science Foundation of Hebei Province （No F2008000646） and the Guidance Program of the Department of Science and Technology in Hebei Province （No. 72135192）.
文摘Because of the anonymity and openness of E-commerce, the on-line transaction and the selection of network resources meet new challenges. For this reason, a trust domain-based multi-agent model for network resource selection is presented. The model divides the network into numbers of trust domains and prevents the inconsistency of information maintained by different agents through the periodical communication among the agents. The model enables consumers to receive the response from the agents much quicker because the trust values of participators are evalUated and updated dynamically and timely after the completion of each transaction. In order to make users choose the best matching services and give users with trusted services, the model takes into account the similarity between services and the service providers＇ recognition to the services. Finally, the model illustrates the effectiveness and feasibility according to the experiment.
