Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Allocating programs containing branches and loops within a multiple processor system
IEEE Transactions on Software Engineering
Characterization and recognition of partial 3-trees
SIAM Journal on Algebraic and Discrete Methods
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
P-Complete Approximation Problems
Journal of the ACM (JACM)
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Nonserial Dynamic Programming
DYNAMIC PROGRAMMING ON GRAPHS WITH BOUNDED TREEWIDTH
DYNAMIC PROGRAMMING ON GRAPHS WITH BOUNDED TREEWIDTH
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Parametric Module Allocation on Partial k-Trees
IEEE Transactions on Computers
An integrated optimal task assignment policy
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
A heuristic cost estimation method for optimizing assignment of tasks to processors
Proceedings of the 1999 ACM symposium on Applied computing
Distributed Multimedia Application Configuration Management
IEEE Transactions on Parallel and Distributed Systems
A Genetic/Tabu Thresholding Hybrid Algorithm for the ProcessAllocation Problem
Journal of Heuristics
Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
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
HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
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
QoS guided min-min heuristic for grid task scheduling
Journal of Computer Science and Technology - Grid computing
Dynamic Mapping in Energy Constrained Heterogeneous Computing Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
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
Resource Allocation for Periodic Applications in a Shipboard Environment
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
A taxonomy of scientific workflow systems for grid computing
ACM SIGMOD Record
Scheduling functional regression tests for IBM DB2 products
CASCON '05 Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research
Mapping subtasks with multiple versions on an ad hoc grid
Parallel Computing - Heterogeneous 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
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Journal of Parallel and Distributed Computing
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Some Compartmentalized Secure Task Assignment Models for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
Journal of Parallel and Distributed Computing
Efficient scheduling algorithm for component-based networks
Future Generation Computer Systems
A Novel Economic-Based Scheduling Heuristic for Computational Grids
International Journal of High Performance Computing Applications
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Distributed data mining in grid computing environments
Future Generation Computer Systems - Special section: Data mining in grid computing environments
Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness
The Journal of Supercomputing
QoS-based scheduling of workflow applications on grids
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Grid query optimizer to improve query processing in grids
Future Generation Computer Systems
Stochastic robustness metric and its use for static resource allocations
Journal of Parallel and Distributed Computing
Scheduling algorithm: tasks scheduling algorithm for multiple processors with dynamic reassignment
Journal of Computer Systems, Networks, and Communications
Extremal Optimization as a Viable Means for Mapping in Grids
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
An innovative perspective on mapping in grids
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Robust resource allocation in a cluster based imaging system
Parallel Computing
Foraging for Better Deployment of Replicated Service Components
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
Computers and Operations Research
Laying Pheromone Trails for Balanced and Dependable Component Mappings
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Generational scheduling for dynamic task management in heterogeneous computing systems
Information Sciences: an International Journal
An adaptive multisite mapping for computationally intensive grid applications
Future Generation Computer Systems
Scalable inter-vehicular applications
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
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
A multiobjective evolutionary approach for multisite mapping on grids
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Cost-efficient deployment of collaborating components
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Ant system for service deployment in private and public clouds
Proceedings of the 2nd workshop on Bio-inspired algorithms for distributed systems
Grid Based Genome Wide Studies on Atrial Flutter
Journal of Grid Computing
Analysis and evaluation of grid scheduling algorithms using real workload traces
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Microprocessors & Microsystems
A distributed bio-inspired method for multisite grid mapping
Applied Computational Intelligence and Soft Computing - Special issue on theory and applications of evolutionary computation
Statistical measures for quantifying task and machine heterogeneities
The Journal of Supercomputing
Many-threaded implementation of differential evolution for the CUDA platform
Proceedings of the 13th annual conference on Genetic and evolutionary computation
RR based grid scheduling algorithm
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Future Generation Computer Systems
An implementation of differential evolution for independent tasks scheduling on GPU
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
Resource allocation robustness in multi-core embedded systems with inaccurate information
Journal of Systems Architecture: the EUROMICRO Journal
The robustness of resource allocations in parallel and distributed computing systems
ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
Ant algorithm for grid scheduling problem
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
The computational complexity of the minimum weight processor assignment problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A heterogeneous computing system for data mining workflows
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Adaptive management framework for scientific workflow applications
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
A Hopfield neural network based task mapping method
Computer Communications
Complexity results for the p-median problem with mutual communication
Operations Research Letters
A Lagrangian relaxation algorithm for sparse quadratic assignment problems
Operations Research Letters
Dynamic job scheduling on the grid environment using the great deluge algorithm
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Task allocation in distributed computing systems using adaptive particle swarm optimisation
International Journal of Computer Applications in Technology
Multiobjective differential evolution for mapping in a grid environment
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
A bio-inspired distributed algorithm to improve scheduling performance of multi-broker grids
Natural Computing: an international journal
Proceedings of the 46th Annual Simulation Symposium
An efficient implementation of the Min-Min heuristic
Computers and Operations Research
Parameterized complexity of 1-planarity
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
An interactive tool for teaching right management in 3D e-learning platform
Proceedings of the 12th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
Robust static resource allocation of DAGs in a heterogeneous multicore system
Journal of Parallel and Distributed Computing
A reliable scheduling method in equipment grid using provenance information
Information Systems Frontiers
Hierarchical genetic-based grid scheduling with energy optimization
Cluster Computing
| Hi-index | 0.01 |
The author studies the complexity of the problem of allocating modules to processes in a distributed system to minimize total communication and execution costs. He shows that unless P=NP, there can be no polynomial-time epsilon -approximate algorithm for the problem, nor can there exist a local search algorithm that requires polynomial time per iteration and yields an optimum assignment. Both results hold even if the communication graph is planar and bipartite. On the positive side, it is shown that if the communication graph is a partial k-tree or an almost-tree with parameter k, the module allocation problem can be solved in polynomial time.