Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-10T22:03:46.152Z Has data issue: false hasContentIssue false
  • English
  • Français

On the hierarchy of functioning rules in distributed computing

Published online by Cambridge University Press:  15 August 2002

A. Bui ,
M. Bui  and
C. Lavault
A. Bui
Affiliation:
LaRIA, Univ. Picardie Jules-Verne, 5 rue du Moulin-neuf, 80000 Amiens, France, e-mail: bui@laria.u-picardie.fr
M. Bui
Affiliation:
Département de Génie Informatique, Univ. de Technologie de Compiègne, URA CNRS 817, Centre de Recherche de Royallieu, BP 649, Compiègne Cedex, France, e-mail: Marc.Bui@utc.fr
C. Lavault
Affiliation:
LIPN, Univ. Paris-Nord, Institut Galilée, URA CNRS 1507, av J.-B Clément, 94430 Villetaneuse, France, e-mail: Christian.Lavault@ura1507.univ-paris13.fr
Get access

Abstract

In previous papers, we used a Markovian model to determine the optimal functioning rules of a distributed system in various settings. Searchingoptimal functioning rules amounts to solve an optimization problemunder constraints. The hierarchy of solutions arising from the above problem is called the “first order hierarchy”, and may possibly yield equivalent solutions. The present paper emphasizes a specific technique for deciding between two equivalent solutions, which establishes the“second order hierarchy”.

Keywords

Distributed SystemsPerformance evaluationMarkov ChainsOptimization.
Type
Research Article
Information
RAIRO - Operations Research , Volume 33 , Issue 1 , January 1999 , pp. 15 - 27
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)