This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic al...This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.展开更多
Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with p...Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy.展开更多
Two problems for task schedules in a multiprocessor parallel system are discussed in Ans paper (1) given a partially ordered set of tasks represented by the venices of an acyclic directed graph with their correspondin...Two problems for task schedules in a multiprocessor parallel system are discussed in Ans paper (1) given a partially ordered set of tasks represented by the venices of an acyclic directed graph with their corresponding processing bines, derive the lower bound on the Annimum time(LBMT) needed to process the task graph for a given number of processors. (2) Determine the lower bound on minimum number of processors(LBMP) needed to complete those tasks in minimum bine. It is shown that the proposed LBMT is sharper than previously Known values and the comPUtational aspeCts of these bounds are also discussed.展开更多
Parallel processors provide fast computing environments for various users.But the real efficiencies ofparallel processors intensively depend on the partitioning strategies of tasks over the processors.In thispaper,the...Parallel processors provide fast computing environments for various users.But the real efficiencies ofparallel processors intensively depend on the partitioning strategies of tasks over the processors.In thispaper,the partitioning problems of independent tasks for homogeneous system of parallel processors arequantitatively studied.We adopt two criteria,minimizing the completion time and the total waiting time,to determine the optimal partitioning strategy.展开更多
To reduce the running time of network simulation in heterogeneous computing environment,a network simulation task partition method,named LBPHCE,is put forward.In this method,the network simulation task is partitioned ...To reduce the running time of network simulation in heterogeneous computing environment,a network simulation task partition method,named LBPHCE,is put forward.In this method,the network simulation task is partitioned in comprehensive consideration of the load balance of both routing computing simulation and packet forwarding simulation.First,through benchmark experiments,the computation ability and routing simulation ability of each simulation machine are measured in the heterogeneous computing environment.Second,based on the computation ability of each simulation machine,the network simulation task is initially partitioned to meet the load balance of packet forwarding simulation in the heterogeneous computing environment,and then according to the routing computation ability,the scale of each partition is fine-tuned to satisfy the balance of the routing computing simulation,meanwhile the load balance of packet forwarding simulation is guaranteed.Experiments based on PDNS indicate that,compared to traditional uniform partition method,the LBPHCE method can reduce the total simulation running time by 26.3%in average,and compared to the liner partition method,it can reduce the running time by 18.3%in average.展开更多
文摘This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.
基金Supported by the National Natural Science Foundation of China (60970016,61173032)
文摘Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy.
文摘Two problems for task schedules in a multiprocessor parallel system are discussed in Ans paper (1) given a partially ordered set of tasks represented by the venices of an acyclic directed graph with their corresponding processing bines, derive the lower bound on the Annimum time(LBMT) needed to process the task graph for a given number of processors. (2) Determine the lower bound on minimum number of processors(LBMP) needed to complete those tasks in minimum bine. It is shown that the proposed LBMT is sharper than previously Known values and the comPUtational aspeCts of these bounds are also discussed.
基金This work was supported in part by the National Natural Science Foundation of China and in part by the 863 Project.
文摘Parallel processors provide fast computing environments for various users.But the real efficiencies ofparallel processors intensively depend on the partitioning strategies of tasks over the processors.In thispaper,the partitioning problems of independent tasks for homogeneous system of parallel processors arequantitatively studied.We adopt two criteria,minimizing the completion time and the total waiting time,to determine the optimal partitioning strategy.
基金supported by the National Natural Science Foundation of China(Grant No.61103223)the Natural Science Foundation of Jiangsu Province(No.BK2011003).
文摘To reduce the running time of network simulation in heterogeneous computing environment,a network simulation task partition method,named LBPHCE,is put forward.In this method,the network simulation task is partitioned in comprehensive consideration of the load balance of both routing computing simulation and packet forwarding simulation.First,through benchmark experiments,the computation ability and routing simulation ability of each simulation machine are measured in the heterogeneous computing environment.Second,based on the computation ability of each simulation machine,the network simulation task is initially partitioned to meet the load balance of packet forwarding simulation in the heterogeneous computing environment,and then according to the routing computation ability,the scale of each partition is fine-tuned to satisfy the balance of the routing computing simulation,meanwhile the load balance of packet forwarding simulation is guaranteed.Experiments based on PDNS indicate that,compared to traditional uniform partition method,the LBPHCE method can reduce the total simulation running time by 26.3%in average,and compared to the liner partition method,it can reduce the running time by 18.3%in average.
