Simulations of three adaptive, decentralized controlled, job scheduling algorithms
Computer Networks and ISDN Systems
Scheduling in distributed computing systems
Scheduling in distributed computing systems
Effects of Response and Stability on Scheduling in Distributed Computing Systems
IEEE Transactions on Software Engineering
On Communicating Finite-State Machines
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
A formal study of distributed meeting scheduling: preliminary results
COCS '91 Proceedings of the conference on Organizational computing systems
IEEE Transactions on Software Engineering
On optimization of continuous-time Markov networks in distributed computing
Journal of Global Optimization
Formal specification of DSP gateway for data transmission between processor cores of OMAP platform
Proceedings of the 2008 ACM symposium on Applied computing
Distributed XML processing: Theory and applications
Journal of Parallel and Distributed Computing
Genetic programming with fitness based on model checking
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
| Hi-index | 14.98 |
A modeling technique for distributed computation based on a combination of directed graphs and finite automata is described. The paradigm of distributed decision-making (DDM) is used to illustrate the technique for its two primary purposes: providing a standard specification mechanism for different algorithms for solving the same problem and providing a common mechanism for objective quantitative evaluation and comparison of alternative DDM algorithms. This is accomplished through the definition of the terms performance and efficiency as they relate to the domain of DDM. The two terms, which have precise meanings with respect to the analysis of sequential algorithms, currently lack a common interpretation in the environment of DDM. In particular, they need to be expressed in terms of the information movement necessary to share state information. The method has been used extensively to conduct analyses of several distribution scheduling algorithms. This paper focuses on the model specification properties.