On optimization of continuous-time Markov networks in distributed computing

Authors:
Alain Bui
Affiliations:
LaRIA, Université de Picardie Jules Verne, France
Venue:
Journal of Global Optimization
Year:
1999

Citing 7
Cited 0

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The mutual exclusion problem: partII—statement and solutions

Journal of the ACM (JACM)
Parallel program design: a foundation

Parallel program design: a foundation
A Communicating Finite Automata Approach to Modeling Distributed Computation and its Application to Distributed Decision-Making

IEEE Transactions on Computers
Introduction to distributed algorithms

Introduction to distributed algorithms
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a new stochastic model for studying the optimization of functioning rules in distributed computing. In this model a network is represented by a finite number of continuous-time homogeneous Markov processes which are connected by relations between entries of their intensity matrices. Good functioning rules are those optimizing a guide function defined according to the context. Two specific optimization problems are studied: a problem of resource allocation with conflicts between processes, and a problem of access to shared resources. The latter is a linearly constrained nonconvex problem with an objective function which is a sum of ratios of linear functions of special form.