On optimization of continuous-time Markov networks in distributed computing

DOI10.1023/A:1008328915992MaRDI QIDQ1567066zbMATHOpenAlexFDO

Authors Alain Bui

Publication date 5 June 2000

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008328915992

zbMATH Keywords

distributed computingstochastic modelcontinuous-time homogeneous Markov processeslinearly constrained nonconvex problemoptimization of functioning rulesproblem of access to shared resourcesresource allocation with conflicts between processes

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Nonconvex programming, global optimization (90C26) Markov and semi-Markov decision processes (90C40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the hierarchy of functioning rules in distributed computing
• scientific article; zbMATH DE number 1795201
• scientific article; zbMATH DE number 2187960
• Nonhomogeneous place-dependent Markov chains, unsynchronised AIMD, and optimisation

Cited in

(5)

• scientific article; zbMATH DE number 1795201 (Why is no real title available?)
• On the hierarchy of functioning rules in distributed computing
• scientific article; zbMATH DE number 2187960 (Why is no real title available?)
• Nonhomogeneous place-dependent Markov chains, unsynchronised AIMD, and optimisation
• An approximate planning model for distributed computing networks

This page was built for publication: On optimization of continuous-time Markov networks in distributed computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567066)