<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2018-2-165-173</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-677</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Оригинальные статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Articles</subject></subj-group></article-categories><title-group><article-title>Измерение накладных расходов на параллелизм и виртуальную память</article-title><trans-title-group xml:lang="en"><trans-title>Measuring Overhead of Concurrency and Virtual Memory</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-7449-7986</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Клименков</surname><given-names>Евгений Иванович</given-names></name><name name-style="western" xml:lang="en"><surname>Klimiankou</surname><given-names>Yauhen</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистр техн. наук, аспирант</p></bio><bio xml:lang="en"><p>MSc, PhD student</p></bio><email xlink:type="simple">klimenkov@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Беларусь</country></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics</institution><country>Belarus</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2018</year></pub-date><pub-date pub-type="epub"><day>20</day><month>04</month><year>2018</year></pub-date><volume>25</volume><issue>2</issue><fpage>165</fpage><lpage>173</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Клименков Е.И., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Клименков Е.И.</copyright-holder><copyright-holder xml:lang="en">Klimiankou Y.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/677">https://www.mais-journal.ru/jour/article/view/677</self-uri><abstract><p>В данной статье представляется методология и результаты измерений и оценки накладных расходов, связанных с параллелизмом и виртуальной памятью. Для получения наиболее точных экспериментальных данных использовалась специальная методика измерений. Данная методика сфокусирована на измерениях совокупных потерь производительности, создаваемых параллелизмом, выраженным в форме легковесных потоков пользовательского режима на процессорах с архитектурой IA-32. Были получены и проанализированы данные, произведенные в средах с виртуальной памятью и без нее. Таким образом стало известно, какая потеря производительности вызывается виртуальной памятью, а также то, как она влияет на накладные расходы, связанные с параллелизмом. Эксперименты показали, что накладные расходы на параллелизм гораздо существеннее накладных расходов на виртуальную память. И тем не менее, между ними существует сложная взаимозависимость. Статья публикуется в авторской редакции.             </p></abstract><trans-abstract xml:lang="en"><p>We present the methodology, as well as results of measurements and evaluation of overhead created by concurrency and virtual memory. A special measurement technique and testbed were used to obtain the most accurate data from the experiments. This technique is focused on the measurements of the overall performance degradation that is introduced by concurrency in the form of lightweight user-level threads on IA-32 processors. We have obtained and compared results of the experiments in an environment with and without enabled virtual memory to understand what loss of performance is caused by virtual memory in itself, and how it affects the overhead associated with concurrency. The results showed that overhead of concurrency outweighs virtual memory overhead and that there is a complex dependency between them. The article is published in the author’s wording.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>виртуальная память</kwd><kwd>параллелизм</kwd><kwd>накладные расходы</kwd><kwd>измерения</kwd></kwd-group><kwd-group xml:lang="en"><kwd>virtual memory</kwd><kwd>concurrency</kwd><kwd>overhead</kwd><kwd>performance</kwd><kwd>measurements</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">A. Agarwal, J. Hennessy, M. Horowitz, “Cache Performance of Operating System and Multiprogramming Workloads”, ACM Trans. Comput. Syst., 6:4 (1988), 393–431.</mixed-citation><mixed-citation xml:lang="en">A. Agarwal, J. Hennessy, M. Horowitz, “Cache Performance of Operating System and Multiprogramming Workloads”, ACM Trans. Comput. Syst., 6:4 (1988), 393–431.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">F.M. David, J.C. Carlyle, R.H. Campbell, “Context Switch Overheads for Linux on ARM Platforms”, Proceedings of the 2007 Workshop on Experimental Computer Science, ExpCS’07, ACM, New York, NY, USA, 2007.</mixed-citation><mixed-citation xml:lang="en">F.M. David, J.C. Carlyle, R.H. Campbell, “Context Switch Overheads for Linux on ARM Platforms”, Proceedings of the 2007 Workshop on Experimental Computer Science, ExpCS’07, ACM, New York, NY, USA, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">INFOBrief: Dell PowerEdge 2650, Dell Inc., 2004.</mixed-citation><mixed-citation xml:lang="en">INFOBrief: Dell PowerEdge 2650, Dell Inc., 2004.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">G. Hunt, J. Larus, “Singularity: Rethinking the Software Stack”, ACM SIGOPS Operating Systems Review, 41:2 (2007), 37–49.</mixed-citation><mixed-citation xml:lang="en">G. Hunt, J. Larus, “Singularity: Rethinking the Software Stack”, ACM SIGOPS Operating Systems Review, 41:2 (2007), 37–49.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">C. Li, C. Ding, K. Shen, “Quantifying the Cost of Context Switch”, Proceedings of the 2007 Workshop on Experimental Computer Science, ExpCS’07, ACM, New York, NY, USA, 2007.</mixed-citation><mixed-citation xml:lang="en">C. Li, C. Ding, K. Shen, “Quantifying the Cost of Context Switch”, Proceedings of the 2007 Workshop on Experimental Computer Science, ExpCS’07, ACM, New York, NY, USA, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">IA-32 Intel R Architecture Software Developer’s Manual. Volume 3: System Programming Guide, Intel Corporation, 2002 (245472-007).</mixed-citation><mixed-citation xml:lang="en">IA-32 Intel R Architecture Software Developer’s Manual. Volume 3: System Programming Guide, Intel Corporation, 2002 (245472-007).</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">L. McVoy, C. Staelin, “Lmbench: Portable Tools for Performance Analysis”, Proceedings of the USENIX Annual Technical Conference, San Diego, California, USA, January 22–26, 1996, 279–294.</mixed-citation><mixed-citation xml:lang="en">L. McVoy, C. Staelin, “Lmbench: Portable Tools for Performance Analysis”, Proceedings of the USENIX Annual Technical Conference, San Diego, California, USA, January 22–26, 1996, 279–294.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">J.C. Mogul, A. Borg, “The Effect of Context Switches on Cache Performance”, SIGPLAN Not., 26:4 (1991), 75–84.</mixed-citation><mixed-citation xml:lang="en">J.C. Mogul, A. Borg, “The Effect of Context Switches on Cache Performance”, SIGPLAN Not., 26:4 (1991), 75–84.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
