Simulation of machine interference in randomly changing environments
Identifieur interne : 000284 ( PascalFrancis/Curation ); précédent : 000283; suivant : 000285Simulation of machine interference in randomly changing environments
Auteurs : J. Sztrik [Hongrie] ; O. Möller [Allemagne]Source :
- Yugoslav journal of operations research [ 0354-0243 ] ; 2002.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Simulation.
English descriptors
- KwdEn :
Abstract
The simulation tool 1cpSim can be used to investigate special level crossing problems of queuing systems of type HYPOk / HYPO,. / 1 //n embedded in different Markovian environments (recently referred to as Markov modulated ones). Our observed system consists of n heterogeneous machines (requests) and a server that "repairs" the broken machines according to the most commonly used service disciplines, such as FIFO, LIFO, PPS, HOL, Preemptive Priorities (Resume, Repeat), Transfer, Polling, Nearest. We specify a maximum number of stopped machines for an operating system and our aim is to give the main steady-state performance measures of the system, such as, server utilization, machine utilization, mean waiting times, mean response times, the probability of an operating system and the mean operating time of the system. These values can be calculated by lcpSim level crossing problem Simulation package for different random environment types and service disciplines.
| pA |
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000C31
Links to Exploration step
Pascal:03-0436576Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Simulation of machine interference in randomly changing environments</title><author><name sortKey="Sztrik, J" sort="Sztrik, J" uniqKey="Sztrik J" first="J." last="Sztrik">J. Sztrik</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Mathematics and Informatics, University of Debrecen</s1><s2>Debrecen</s2><s3>HUN</s3><sZ>1 aut.</sZ></inist:fA14><country>Hongrie</country></affiliation></author><author><name sortKey="Moller, O" sort="Moller, O" uniqKey="Moller O" first="O." last="Möller">O. Möller</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Science, University of Trier</s1><s2>Trier</s2><s3>DEU</s3><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">03-0436576</idno><date when="2002">2002</date><idno type="stanalyst">PASCAL 03-0436576 INIST</idno><idno type="RBID">Pascal:03-0436576</idno><idno type="wicri:Area/PascalFrancis/Corpus">000C31</idno><idno type="wicri:Area/PascalFrancis/Curation">000284</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Simulation of machine interference in randomly changing environments</title><author><name sortKey="Sztrik, J" sort="Sztrik, J" uniqKey="Sztrik J" first="J." last="Sztrik">J. Sztrik</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Mathematics and Informatics, University of Debrecen</s1><s2>Debrecen</s2><s3>HUN</s3><sZ>1 aut.</sZ></inist:fA14><country>Hongrie</country></affiliation></author><author><name sortKey="Moller, O" sort="Moller, O" uniqKey="Moller O" first="O." last="Möller">O. Möller</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Science, University of Trier</s1><s2>Trier</s2><s3>DEU</s3><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country></affiliation></author></analytic><series><title level="j" type="main">Yugoslav journal of operations research</title><title level="j" type="abbreviated">Yugosl. j. oper. res.</title><idno type="ISSN">0354-0243</idno><imprint><date when="2002">2002</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Yugoslav journal of operations research</title><title level="j" type="abbreviated">Yugosl. j. oper. res.</title><idno type="ISSN">0354-0243</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Interference</term><term>Queueing system</term><term>Queueing theory</term><term>Reliability</term><term>Simulation</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Interférence</term><term>Fiabilité</term><term>Simulation</term><term>Système attente</term><term>File attente</term><term>Environnement aléatoire</term><term>Machine interférence</term><term>Attente source finie</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Simulation</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The simulation tool 1cpSim can be used to investigate special level crossing problems of queuing systems of type HYPO<sub>k</sub> / HYPO,. / 1 //n embedded in different Markovian environments (recently referred to as Markov modulated ones). Our observed system consists of n heterogeneous machines (requests) and a server that "repairs" the broken machines according to the most commonly used service disciplines, such as FIFO, LIFO, PPS, HOL, Preemptive Priorities (Resume, Repeat), Transfer, Polling, Nearest. We specify a maximum number of stopped machines for an operating system and our aim is to give the main steady-state performance measures of the system, such as, server utilization, machine utilization, mean waiting times, mean response times, the probability of an operating system and the mean operating time of the system. These values can be calculated by lcpSim level crossing problem Simulation package for different random environment types and service disciplines.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0354-0243</s0></fA01><fA03 i2="1"><s0>Yugosl. j. oper. res.</s0></fA03><fA05><s2>12</s2></fA05><fA06><s2>2</s2></fA06><fA08 i1="01" i2="1" l="ENG"><s1>Simulation of machine interference in randomly changing environments</s1></fA08><fA11 i1="01" i2="1"><s1>SZTRIK (J.)</s1></fA11><fA11 i1="02" i2="1"><s1>MÖLLER (O.)</s1></fA11><fA14 i1="01"><s1>Institute of Mathematics and Informatics, University of Debrecen</s1><s2>Debrecen</s2><s3>HUN</s3><sZ>1 aut.</sZ></fA14><fA14 i1="02"><s1>Department of Computer Science, University of Trier</s1><s2>Trier</s2><s3>DEU</s3><sZ>2 aut.</sZ></fA14><fA20><s1>237-246</s1></fA20><fA21><s1>2002</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA43 i1="01"><s1>INIST</s1><s2>22601</s2><s5>354000117924630080</s5></fA43><fA44><s0>0000</s0><s1>© 2003 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>10 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>03-0436576</s0></fA47><fA60><s1>P</s1></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Yugoslav journal of operations research</s0></fA64><fA66 i1="01"><s0>YUG</s0></fA66><fC01 i1="01" l="ENG"><s0>The simulation tool 1cpSim can be used to investigate special level crossing problems of queuing systems of type HYPO<sub>k</sub> / HYPO,. / 1 //n embedded in different Markovian environments (recently referred to as Markov modulated ones). Our observed system consists of n heterogeneous machines (requests) and a server that "repairs" the broken machines according to the most commonly used service disciplines, such as FIFO, LIFO, PPS, HOL, Preemptive Priorities (Resume, Repeat), Transfer, Polling, Nearest. We specify a maximum number of stopped machines for an operating system and our aim is to give the main steady-state performance measures of the system, such as, server utilization, machine utilization, mean waiting times, mean response times, the probability of an operating system and the mean operating time of the system. These values can be calculated by lcpSim level crossing problem Simulation package for different random environment types and service disciplines.</s0></fC01><fC02 i1="01" i2="X"><s0>001D01A05</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Interférence</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Interference</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Interferencia</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Fiabilité</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Reliability</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Fiabilidad</s0><s5>02</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Simulation</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Simulation</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Simulación</s0><s5>03</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Système attente</s0><s5>04</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Queueing system</s0><s5>04</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Sistema fila espera</s0><s5>04</s5></fC03><fC03 i1="05" i2="1" l="FRE"><s0>File attente</s0><s5>05</s5></fC03><fC03 i1="05" i2="1" l="ENG"><s0>Queueing theory</s0><s5>05</s5></fC03><fC03 i1="06" i2="X" l="FRE"><s0>Environnement aléatoire</s0><s4>INC</s4><s5>82</s5></fC03><fC03 i1="07" i2="X" l="FRE"><s0>Machine interférence</s0><s4>INC</s4><s5>83</s5></fC03><fC03 i1="08" i2="X" l="FRE"><s0>Attente source finie</s0><s4>INC</s4><s5>84</s5></fC03><fN21><s1>300</s1></fN21><fN82><s1>PSI</s1></fN82></pA></standard></inist></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000284 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000284 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:03-0436576
|texte= Simulation of machine interference in randomly changing environments
}}
| This area was generated with Dilib version V0.6.31. |  |