<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF13402</article-id><article-id pub-id-type="doi">10.3233/INF-2002-13402</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>One Application of the Parallelization Tool of Master–Slave Algorithms<xref ref-type="fn" rid="fn1"><sup>✩</sup></xref></article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Baravykaitė</surname><given-names>Milda</given-names></name><email xlink:href="mailto:milda.baravykaite@fm.vtu.lt">milda.baravykaite@fm.vtu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Belevičius</surname><given-names>Rimantas</given-names></name><email xlink:href="mailto:rb@fm.vtu.lt">rb@fm.vtu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Čiegis</surname><given-names>Raimondas</given-names></name><email xlink:href="mailto:rc@fm.vtu.lt">rc@fm.vtu.lt</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Vilnius Gediminas Technical University, Saulėtekio 11, LT-2040 Vilnius, Lithuania</aff></contrib-group><author-notes><fn id="fn1"><label><sup>✩</sup></label><p>This work has been supported in part by Lithuanian State Science and Studies Foundation grant A-537 and Eureka grant OPTPAPER 2623, E-2002.02.27</p></fn></author-notes><pub-date pub-type="epub"><day>01</day><month>01</month><year>2002</year></pub-date><volume>13</volume><issue>4</issue><fpage>393</fpage><lpage>404</lpage><history><date date-type="received"><day>01</day><month>05</month><year>2002</year></date></history><abstract><p>The paper analyzes the performance of parallel global optimization algorithm, which is used to optimize grillage-type foundations. The parallel algorithm is obtained by using the automatic parallelization tool. We describe briefly the layer structure of the Master–Slave Template library and present a detailed mathematical formulation of the application problem. Experiments are done on the homogeneous computer cluster of 7 IBM machines RS6000. The results of experiments are presented.</p></abstract><kwd-group><label>Keywords</label><kwd>mathematical modeling</kwd><kwd>parallel algorithms</kwd><kwd>software tools</kwd><kwd>master–slave algorithm</kwd><kwd>optimization</kwd><kwd>grillage-type foundations</kwd></kwd-group></article-meta></front></article>