Task Allocation and Precedence Relations for Distributed Real-Time Systems
IEEE Transactions on Computers
Task Matching and Scheduling in Heterogeneous Systems Using Simulated Evolution
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Mapping heterogeneous task graphs onto heterogeneous system graphs
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Optimal task assignment in heterogeneous computing systems
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
An empirical study of hierarchical division for mesh-structured networks
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Journal of Parallel and Distributed Computing
Smart distribution of bio-signal processing tasks in m-health
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems - Volume Part I
A hybrid algorithm for scheduling workflow applications in grid environments (ICPDP)
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
HMM: a static mapping algorithm to map parallel applications on grids
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Load balanced allocation of multiple tasks in a distributed computing system
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A migration tool to support resource and load sharing in heterogeneous computing environments
Computer Communications
A Hopfield neural network based task mapping method
Computer Communications
Priority based multi robot task assignment
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Efficient task assignment on heterogeneous multicore systems considering communication overhead
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Journal of Parallel and Distributed Computing
Task assignment for minimizing application completion time using honeybee mating optimization
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 14.98 |
A graph matching approach is proposed in this paper for solving the task assignment problem encountered in distributed computing systems. A cost function defined in terms of a single unit, time, is proposed for evaluating the effectiveness of task assignment. This cost function represents the maximum time for a task to complete module execution and communication in all the processors. A new optimization criterion, called the minimax criterion, is also proposed, based on which both minimization of interprocessor communication and balance of processor loading can be achieved. The proposed approach allows various system constraints to be included for consideration. With the proposed cost function and the minimax criterion, optimal task assignment is defined. Graphs are then used to represent the module relationship of a given task and the processor structure of a distributed computing system. Module assignment to system processors is transformed into a type of graph matching, called weak homomorphism. The search of optimal weak homomorphism corresponding to optimal task assignment is next formulated as a state-space search problem. It is then solved by the well-known A* algorithm in artificial intelligence after proper heuristic information for speeding up the search is suggested. An illustrative example and some experimental results are also included to show the effectiveness of the heuristic search.