A short survey of recent advances in graph matching
Graph matching, which refers to a class of computational problems of finding an optimal
correspondence between the vertices of graphs to minimize (maximize) their node and edge …
correspondence between the vertices of graphs to minimize (maximize) their node and edge …
Process migration
Process migration is the act of transferring a process between two machines. It enables
dynamic load distribution, fault resilience, eased system administration, and data access …
dynamic load distribution, fault resilience, eased system administration, and data access …
A comparison of eleven static heuristics for map** a class of independent tasks onto heterogeneous distributed computing systems
Mixed-machine heterogeneous computing (HC) environments utilize a distributed suite of
different high-performance machines, interconnected with high-speed links, to perform …
different high-performance machines, interconnected with high-speed links, to perform …
A taxonomy of scheduling in general-purpose distributed computing systems
One measure of the usefulness of a general-purpose distributed computing system is the
system's ability to provide a level of performance commensurate to the degree of multiplicity …
system's ability to provide a level of performance commensurate to the degree of multiplicity …
[書籍][B] Readings in distributed artificial intelligence
AH Bond, L Gasser - 2014 - books.google.com
Most artificial intelligence research investigates intelligent behavior for a single agent--
solving problems heuristically, understanding natural language, and so on. Distributed …
solving problems heuristically, understanding natural language, and so on. Distributed …
Hardware-software co-design of embedded systems
WH Wolf - Proceedings of the IEEE, 2002 - ieeexplore.ieee.org
This paper surveys the design of embedded computer systems, which use software running
on programmable computers to implement system functions. Creating an embedded …
on programmable computers to implement system functions. Creating an embedded …
Heuristic algorithms for task assignment in distributed systems
VM Lo - IEEE Transactions on computers, 1988 - ieeexplore.ieee.org
Investigate the problem of static task assignment in distributed computing systems, ie given
a set of k communicating tasks to be executed on a distributed system of n processors, to …
a set of k communicating tasks to be executed on a distributed system of n processors, to …
Optimal task assignment in heterogeneous distributed computing systems
M Kafil, I Ahmad - IEEE concurrency, 1998 - ieeexplore.ieee.org
A distributed system comprising networked heterogeneous processors requires efficient task-
to-processor assignment to achieve fast turnaround time. Although reasonable heuristics …
to-processor assignment to achieve fast turnaround time. Although reasonable heuristics …
A comparison study of static map** heuristics for a class of meta-tasks on heterogeneous computing systems
Heterogeneous computing (HC) environments are well suited to meet the computational
demands of large, diverse groups of tasks (ie, a meta-task). The problem of map** …
demands of large, diverse groups of tasks (ie, a meta-task). The problem of map** …
Task allocation for maximizing reliability of distributed computer systems
SM Shatz, JP Wang, M Goto - IEEE Transactions on Computers, 1992 - computer.org
For distributed systems, system reliability is defined as the probability that the system can
run an entire task successfully. When the system's hardware configuration is fixed, the …
run an entire task successfully. When the system's hardware configuration is fixed, the …