Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-27T23:10:45.803Z Has data issue: false hasContentIssue false
  • English
  • Français

Parallélisation d'une Combinaison des Méthodes de Monte-Carlo et Quasi-Monte-Carlo et Application aux Réseaux de Files d'Attente

Published online by Cambridge University Press:  15 August 2002

Bruno Tuffin  and
Louis-Marie Le Ny
Bruno Tuffin
Affiliation:
IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, France.
Louis-Marie Le Ny
Affiliation:
IRISA, Campus Universitaire de Beaulieu, 35042 Rennes Cedex, France.
Get access

Abstract

We propose a parallel algorithm which uses bothMonte-Carlo and quasi-Monte-Carlo methods. A detailed analysis of thisalgorithm, followed by examples, shows that the estimator's efficiencyis a linear function of the processor number. As a concrete applicationexample, we evaluate performance measures of a multi-class queueingnetwork in steady state.

Keywords

Branch and boundmulti-processor flow-shopm-machine problemsinputs and selection.
Type
Research Article
Information
RAIRO - Operations Research , Volume 34 , Issue 1 , January 2000 , pp. 85 - 98
Copyright
© EDP Sciences, 2000

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.)