Distributed control of computer systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Task Allocation and Precedence Relations for Distributed Real-Time Systems
IEEE Transactions on Computers
Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Effect of network latency on load sharing in distributed systems
Journal of Parallel and Distributed Computing
Cooperative energy management in distributed wireless real-time systems
Wireless Networks
A migration tool to support resource and load sharing in heterogeneous computing environments
Computer Communications
QoSHVCP: hybrid vehicular communications protocol with QoS prioritization for safety applications
ISRN Communications and Networking
| Hi-index | 0.01 |
In a distributed computing system made up of different types of processors each processor in the system may have different performance and reliability characteristics. In order to take advantage of this diversity of processing power, a modular distributed program should have its modules assigned in such a way that the applicable system performance index, such as execution time or cost, is optimized. This paper describes an algorithm for making an optimal module to processor assignment for a given performance criteria. We first propose a computational model to characterize distributed programs, consisting of tasks and an operational precedence relationship. This model alows us to describe probabilistic branching as well as concurrent execution in a distributed program. The computational model along with a set of seven program descriptors completely specifies a model for dynamic execution of a program on a distributed system. The optimal task to processor assignment is found by an algorithm based on results in Markov decision theory. The algorithm given in this paper is completely general and applicable to N-processor systems.