<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462008000100003</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Using UML State Diagrams for Modelling the Performance of Parallel Programs]]></article-title>
<article-title xml:lang="es"><![CDATA[Uso de Diagramas de Estado UML para la Modelación del Desempeño de Programas Paralelos]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ortega Arjona]]></surname>
<given-names><![CDATA[Jorge]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,UNAM Facultad de Ciencias Departamento de Matemáticas]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2008</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2008</year>
</pub-date>
<volume>11</volume>
<numero>3</numero>
<fpage>199</fpage>
<lpage>210</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462008000100003&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462008000100003&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462008000100003&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[There are many possibilities to design a parallel program in order to obtain the best performance possible. The selection of a program structure, as an organisation of processes, impacts on the performance to be achieved, and depends on the problem to be solved. Now, in order to select a program structure as the best in terms of performance, the software designer requires performance modelling techniques to evaluate different alternatives. If the structure of the parallel program can be modelled as a set of interacting processes, described in terms of UML State Diagrams, this paper presents a performance modelling to estimate the average execution time of a parallel program. Performance modelling is achieved by calculating the average execution time of a parallel program, described as a set of processes which run with deterministically and exponentially distributed execution times.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Hay muchas posibilidades para diseñar un programa paralelo a fin de obtener el mejor desempeño posible. La selección de una estructura del programa, así como una organización de procesos, impacta sobre el desempeño a lograrse, y depende del problema a resolver. Ahora bien, para seleccionar una estructura del programa como la mejor en términos de desempeño, el diseñador de software requiere de técnicas de modelación para evaluar diferentes opciones. Si la estructura de un programa paralelo puede modelarse como un conjunto de procesos interactivos, descritos en términos de Diagramas de Estado de UML, este artículo presenta una modelación para estimar el tiempo de ejecución promedio de un programa paralelo, descrito como un conjunto de procesos que corren en tiempos de ejecución con distribuciones determinística y exponencial.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Performance modelling]]></kwd>
<kwd lng="en"><![CDATA[parallel program]]></kwd>
<kwd lng="en"><![CDATA[UML State Diagram]]></kwd>
<kwd lng="es"><![CDATA[Modelación de desempeño]]></kwd>
<kwd lng="es"><![CDATA[programa paralelo]]></kwd>
<kwd lng="es"><![CDATA[Diagrama de Estado de UML]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="center"><font face="verdana" size="4"><b>Using UML State Diagrams for Modelling the Performance of Parallel Programs</b></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="3"><b><i>Uso de Diagramas de Estado UML para la Modelaci&oacute;n del Desempe&ntilde;o de Programas Paralelos</i></b></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><b>Jorge Ortega Arjona</b></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><i>Departamento de Matem&aacute;ticas, Facultad de Ciencias, UNAM</i> e&#150;mail: <a href="mailto:jloa@fciencias.unam.mx">jloa@fciencias.unam.mx</a></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2">Article received on June 28, 2007    <br> Accepted on October 24,2007</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>     <p align="justify"><font face="verdana" size="2">There are many possibilities to design a parallel program in order to obtain the best performance possible. The selection of a program structure, as an organisation of processes, impacts on the performance to be achieved, and depends on the problem to be solved. Now, in order to select a program structure as the best in terms of performance, the software designer requires performance modelling techniques to evaluate different alternatives. If the structure of the parallel program can be modelled as a set of interacting processes, described in terms of UML State Diagrams, this paper presents a performance modelling to estimate the average execution time of a parallel program. Performance modelling is achieved by calculating the average execution time of a parallel program, described as a set of processes which run with deterministically and exponentially distributed execution times. </font></p>     <p align="justify"><font face="verdana" size="2"><b>Keywords: </b>.Performance modelling, parallel program, UML State Diagram.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>     <p align="justify"><font face="verdana" size="2">Hay muchas posibilidades para dise&ntilde;ar un programa paralelo a fin de obtener el mejor desempe&ntilde;o posible. La selecci&oacute;n de una estructura del programa, as&iacute; como una organizaci&oacute;n de procesos, impacta sobre el desempe&ntilde;o a lograrse, y depende del problema a resolver. Ahora bien, para seleccionar una estructura del programa como la mejor en t&eacute;rminos de desempe&ntilde;o, el dise&ntilde;ador de software requiere de t&eacute;cnicas de modelaci&oacute;n para evaluar diferentes opciones. Si la estructura de un programa paralelo puede modelarse como un conjunto de procesos interactivos, descritos en t&eacute;rminos de Diagramas de Estado de UML, este art&iacute;culo presenta una modelaci&oacute;n para estimar el tiempo de ejecuci&oacute;n promedio de un programa paralelo, descrito como un conjunto de procesos que corren en tiempos de ejecuci&oacute;n con distribuiciones determin&iacute;stica y exponencial. </font></p>     <p align="justify"><font face="verdana" size="2"><b>Palabras clave: </b>Modelaci&oacute;n de desempe&ntilde;o, programa paralelo, Diagrama de Estado de UML.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v11n3/v11n3a3.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">1. <b>Billinton,  R.,  and  Allan,  R.N.   (1992).  </b><i>Reliability Evaluation  of Engineering Systems:   Concepts and Techniques. </i>Springer.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044011&pid=S1405-5546200800010000300001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">2. <b>Booch, G., Rumbaugh, J., and Jacobson I. (1998). </b><i>The Unified Modeling Language User Guide. </i>Addison&#150;Wesley.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044012&pid=S1405-5546200800010000300002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">3. <b>Fowler, M., and Scott, K. (1997). </b><i>UML Distilled. </i>Addison&#150;Wesley Longman Inc., Reading MA.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044013&pid=S1405-5546200800010000300003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">4. <b>Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V. (1994). </b><i>PVM: Parallel Virtual Machine. A User's Guide and Tutorial for Networked Parallel Computing. </i>The MIT Press.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044014&pid=S1405-5546200800010000300004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">5. <b>Kleinrock, L. (1975). </b><i>Queueing Systems. Volume 1: Theory. </i>John Wiley and Sons.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044015&pid=S1405-5546200800010000300005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">6. <b>Lui, J.C.S., Muntz, R.R., and Towsley, D. (1998). </b><i>Computer performance bounds of fork&#150;join parallel programs under a multiprocessor environment. </i>IEEE Transactions on Parallel and Distributed Systems, Vol. 9 No. 3.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044016&pid=S1405-5546200800010000300006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">7. <b>Montgomery, D.C. (1991). </b><i>Design and Analysis of Experiments. </i>John Wiley &amp; Sons, Inc.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044017&pid=S1405-5546200800010000300007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">8. <b>Ortega&#150;Arjona, J., and Roberts, G. (1998). </b><i>Architectural Patterns for Parallel Programming. </i>Proceedings of the 3<sup>rd</sup> European Conference on Pattern Languages of Programming and Computing (EuroPLoP 98).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044018&pid=S1405-5546200800010000300008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">9. <b>Ortega&#150;Arjona, J. (2000). </b><i>The Communicating Sequential Elements pattern. An Architectural Pattern for Domain Parallelism. </i>Proceedings of the 7<sup>th</sup> Conference on Pattern Languages of Programming (PLoP 2000).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044019&pid=S1405-5546200800010000300009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">10. <b>Ortega&#150;Arjona, J. (2004). </b><i>The Manager&#150;Workers pattern. An Activity Parallelism Architectural Pattern for Parallel Programming. </i>Proceedings of the 9<sup>th</sup> European Conference on Pattern Languages of Programming and Computing (EuroPLoP 2004).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044020&pid=S1405-5546200800010000300010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">11. <b>Pooley, R., and King, P.  (1999)  </b><i>The  Unified Modeling Language and Performance Engineering.  </i>IEE Proceedings &#150; Software 146(2).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044021&pid=S1405-5546200800010000300011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">12. <b>Thomasian, A. and Bay, P. (1986). </b><i>Analytic Queueing Network Models for Parallel Processing of Task Systems. </i>IEEE Transactions on Computers, December 1986.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044022&pid=S1405-5546200800010000300012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">13.<b> Weiss, B. (1999). </b><i>Introductory Statistics. </i>Addison&#150;Wesley.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2044023&pid=S1405-5546200800010000300013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Billinton]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Allan]]></surname>
<given-names><![CDATA[R.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Reliability Evaluation of Engineering Systems: Concepts and Techniques]]></source>
<year>1992</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Booch]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Rumbaugh]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Jacobson]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
</person-group>
<source><![CDATA[The Unified Modeling Language User Guide]]></source>
<year>1998</year>
<publisher-name><![CDATA[Addison-Wesley]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fowler]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Scott]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[UML Distilled]]></source>
<year>1997</year>
<publisher-name><![CDATA[Addison-Wesley Longman Inc., Reading MA.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geist]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Beguelin]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Dongarra]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
<name>
<surname><![CDATA[Manchek]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Sunderam]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<source><![CDATA[PVM: Parallel Virtual Machine. A User's Guide and Tutorial for Networked Parallel Computing]]></source>
<year>1994</year>
<publisher-name><![CDATA[The MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kleinrock]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Queueing Systems: Volume 1: Theory]]></source>
<year>1975</year>
<publisher-name><![CDATA[John Wiley and Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lui]]></surname>
<given-names><![CDATA[J.C.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Muntz]]></surname>
<given-names><![CDATA[R.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Towsley]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Computer performance bounds of fork-join parallel programs under a multiprocessor environment]]></article-title>
<source><![CDATA[IEEE Transactions on Parallel and Distributed Systems]]></source>
<year>1998</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Montgomery]]></surname>
<given-names><![CDATA[D.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Design and Analysis of Experiments]]></source>
<year>1991</year>
<publisher-name><![CDATA[John Wiley & Sons, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ortega-Arjona]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Roberts]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[Architectural Patterns for Parallel Programming]]></source>
<year>1998</year>
<conf-name><![CDATA[ Proceedings of the 3rd European Conference on Pattern Languages of Programming and Computing]]></conf-name>
<conf-loc> </conf-loc>
<publisher-name><![CDATA[(EuroPLoP 98)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ortega-Arjona]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[The Communicating Sequential Elements pattern: An Architectural Pattern for Domain Parallelism]]></source>
<year>2000</year>
<conf-name><![CDATA[ Proceedings of the 7th Conference on Pattern Languages of Programming]]></conf-name>
<conf-loc> </conf-loc>
<publisher-name><![CDATA[(PLoP 2000)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ortega-Arjona]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[The Manager-Workers pattern: An Activity Parallelism Architectural Pattern for Parallel Programming]]></source>
<year>2004</year>
<conf-name><![CDATA[ Proceedings of the 9th European Conference on Pattern Languages of Programming and Computing]]></conf-name>
<conf-loc> </conf-loc>
<publisher-name><![CDATA[(EuroPLoP 2004)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pooley]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[King]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<source><![CDATA[The Unified Modeling Language and Performance Engineering]]></source>
<year>1999</year>
<volume>146</volume>
<publisher-name><![CDATA[IEE Proceedings - Software]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Thomasian]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Bay]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<source><![CDATA[Analytic Queueing Network Models for Parallel Processing of Task Systems]]></source>
<year>1986</year>
<publisher-name><![CDATA[IEEE Transactions on Computers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Weiss]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<source><![CDATA[Introductory Statistics]]></source>
<year>1999</year>
<publisher-name><![CDATA[Addison-Wesley]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
