<?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">inf14203</article-id><article-id pub-id-type="doi">10.15388/Informatica.2003.012</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Realistic Performance Prediction Tool for the Parallel Block LU Factorization Algorithm</article-title></title-group><contrib-group><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><contrib contrib-type="Author"><name><surname>Starikovičius</surname><given-names>Vadimas</given-names></name><email xlink:href="mailto:vs@sc.vtu.lt">vs@sc.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 al. 11, LT‐2040 Vilnius, Lithuania</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2003</year></pub-date><volume>14</volume><issue>2</issue><fpage>167</fpage><lpage>180</lpage><history><date date-type="received"><day>01</day><month>03</month><year>2003</year></date></history><abstract><p>This work describes a realistic performance prediction tool for the parallel block LU factorization algorithm. It takes into account the computational workload, communication costs and the overlapping of communications by useful computations. Estimation of the tool parameters and benchmarking are also discussed. Using this tool we develop a simple heuristic for scheduling LU factorization tasks. Results of numerical experiments are presented.</p></abstract><kwd-group><label>Keywords</label><kwd>performance prediction tools</kwd><kwd>parallel algorithms</kwd><kwd>LU factorization</kwd><kwd>heuristic for scheduling the tasks</kwd></kwd-group></article-meta></front></article>