ES:预测并行系统性能的工具

Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 1994-01-31 DOI:10.1109/MASCOT.1994.284428

J. B. Sinclair, W. P. Dawkins

{"title":"ES:预测并行系统性能的工具","authors":"J. B. Sinclair, W. P. Dawkins","doi":"10.1109/MASCOT.1994.284428","DOIUrl":null,"url":null,"abstract":"ES is a tool for estimating the execution times of parallel algorithms on MIMD parallel systems. ES allows the user to model arbitrary task execution times, explicit task precedence and synchronization constraints, resource contention among tasks, and a variety of scheduling policies for shared resources. Given a model of a parallel algorithm and a parallel system, ES constructs a sequencing tree that represents some or all of the possible sequences of events that may occur during the execution of the algorithm on the system, and uses it to estimate the mean and standard deviation of the execution time of the parallel algorithm. The authors compare estimates generated by ES to measurements made of a parallel mergesort executing on an Intel iPSC/860 hypercube.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"ES: a tool for predicting the performance of parallel systems\",\"authors\":\"J. B. Sinclair, W. P. Dawkins\",\"doi\":\"10.1109/MASCOT.1994.284428\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ES is a tool for estimating the execution times of parallel algorithms on MIMD parallel systems. ES allows the user to model arbitrary task execution times, explicit task precedence and synchronization constraints, resource contention among tasks, and a variety of scheduling policies for shared resources. Given a model of a parallel algorithm and a parallel system, ES constructs a sequencing tree that represents some or all of the possible sequences of events that may occur during the execution of the algorithm on the system, and uses it to estimate the mean and standard deviation of the execution time of the parallel algorithm. The authors compare estimates generated by ES to measurements made of a parallel mergesort executing on an Intel iPSC/860 hypercube.<<ETX>>\",\"PeriodicalId\":288344,\"journal\":{\"name\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.1994.284428\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1994.284428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

ES是一种估计MIMD并行系统上并行算法执行时间的工具。ES允许用户对任意任务执行时间、显式任务优先级和同步约束、任务之间的资源争用以及共享资源的各种调度策略进行建模。给定一个并行算法和一个并行系统的模型，ES构建一个序列树，表示算法在系统上执行过程中可能发生的部分或全部事件序列，并用它来估计并行算法执行时间的均值和标准差。作者将ES生成的估计值与在Intel iPSC/860超立方体上执行的并行归并排序的测量值进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

ES: a tool for predicting the performance of parallel systems

ES is a tool for estimating the execution times of parallel algorithms on MIMD parallel systems. ES allows the user to model arbitrary task execution times, explicit task precedence and synchronization constraints, resource contention among tasks, and a variety of scheduling policies for shared resources. Given a model of a parallel algorithm and a parallel system, ES constructs a sequencing tree that represents some or all of the possible sequences of events that may occur during the execution of the algorithm on the system, and uses it to estimate the mean and standard deviation of the execution time of the parallel algorithm. The authors compare estimates generated by ES to measurements made of a parallel mergesort executing on an Intel iPSC/860 hypercube.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

自引率

0.00%

发文量