Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
On the Assignment Problem of Arbitrary Process Systems to Heterogeneous Distributed Computer Systems
IEEE Transactions on Computers
Simulated annealing and the mapping problem: a computational study
Computers and Operations Research
IEEE Transactions on Parallel and Distributed Systems
Software support for heterogeneous computing
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A genetic-algorithm-based approach for subtask matching and scheduling in heterogeneous computing environments and a comparative study of parallel genetic algorithms
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Hierarchical fuzzy configuration of implementation strategies
Proceedings of the 1999 ACM symposium on Applied computing
On Load Balancing for Distributed Multiagent Computing
IEEE Transactions on Parallel and Distributed Systems
Heterogeneous Computing: Goals, Methods, and Open Problems
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Multicriteria Evolutionary Algorithm with Tabu Search for Task Assignment
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Clustering and reassignment-based mapping strategy for message-passing architectures
Journal of Systems Architecture: the EUROMICRO Journal
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
On the Design of Communication-Aware Task Scheduling Strategies for Heterogeneous Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
On the development of a communication-aware task mapping technique
Journal of Systems Architecture: the EUROMICRO Journal
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Performance analysis of dynamic load balancing algorithms with variable number of processors
Journal of Parallel and Distributed Computing
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
Computers and Operations Research
Task assignment in heterogeneous computing systems
Journal of Parallel and Distributed Computing
Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Task allocation for maximizing reliability of distributed systems: a simulated annealing approach
Journal of Parallel and Distributed Computing
A decentralized resource allocation policy in minigrid
Future Generation Computer Systems
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness
The Journal of Supercomputing
Comparison and analysis of ten static heuristics-based Internet data replication techniques
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Journal of Systems Architecture: the EUROMICRO Journal
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Journal of Parallel and Distributed Computing
WSEAS Transactions on Information Science and Applications
A general distributed scalable grid scheduler for independent tasks
Journal of Parallel and Distributed Computing
Robust resource allocation in a cluster based imaging system
Parallel Computing
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
Computer Standards & Interfaces
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
Computers and Operations Research
On the mapping between logical and physical topologies
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
A bipartite genetic algorithm for multi-processor task scheduling
International Journal of Parallel Programming
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
Statistical measures for quantifying task and machine heterogeneities
The Journal of Supercomputing
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
The robustness of resource allocations in parallel and distributed computing systems
ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
High performance task scheduling algorithm for heterogeneous computing system
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Load balanced allocation of multiple tasks in a distributed computing system
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Multi-site scheduling with multiple job reservations and forecasting methods
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Evolutionary algorithm parameter tuning with sensitivity analysis
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
A fast algorithm for reliability-oriented task assignment in a distributed system
Computer Communications
Priority based multi robot task assignment
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Solving very large instances of the scheduling of independent tasks problem on the GPU
Journal of Parallel and Distributed Computing
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
Robust static resource allocation of DAGs in a heterogeneous multicore system
Journal of Parallel and Distributed Computing
Reducing the solution space of optimal task scheduling
Computers and Operations Research
| Hi-index | 0.00 |
A distributed system comprising networked heterogeneous processors requires an efficient tasks-to-processor assignment to achieve a fast turnaround time. This problem is known to be NP-hard, except in a few cases. Although the literature offers heuristics that can yield suboptimal solutions in a reasonable amount of time, little is available for optimal solutions of moderate-sized problems. In this article, the authors develop techniques for optimal solutions for assigning arbitrary task graphs to arbitrary processor networks. The basis of their research is the best-first search technique known as the A* algorithm, from the area of artificial intelligence. The algorithm, in its traditional form, guarantees optimal solutions, but does not work for large problems, due to its high time and space complexity. The authors propose algorithms based on the A* technique that are considerably faster and memory efficient, and still yield optimal solutions.