{"title":"SGTNE: semi-global time of the next event algorithm","authors":"A. Boukerche, C. Tropper","doi":"10.1109/PADS.1995.404315","DOIUrl":null,"url":null,"abstract":"This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlock inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps to break the inter-processor deadlock by executing a shortest path algorithm over a snapshot of the LPs in a cluster of processors. This paper discusses the algorithm and its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on the Intel Paragon A4 multiprocessor machine. We also examine the impact of partitioning on the efficient implementation of the SGTNE algorithm. The results obtained indicate that SGTNE yields good speedups and that a partitioning which makes use of a strongly connected component algorithm results in a reduction of 30% in the running time of a simulation when compared to simple partitioning strategies. The results also indicate that SGTNE outperforms TNE.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PADS.1995.404315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlock inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps to break the inter-processor deadlock by executing a shortest path algorithm over a snapshot of the LPs in a cluster of processors. This paper discusses the algorithm and its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on the Intel Paragon A4 multiprocessor machine. We also examine the impact of partitioning on the efficient implementation of the SGTNE algorithm. The results obtained indicate that SGTNE yields good speedups and that a partitioning which makes use of a strongly connected component algorithm results in a reduction of 30% in the running time of a simulation when compared to simple partitioning strategies. The results also indicate that SGTNE outperforms TNE.<>
本文描述了TNE算法的一个扩展,其目的是提高其并行性,并打破使用TNE所固有的处理器间死锁。我们称之为SGTNE算法(Semi Global TNE)的算法是在一个处理器集群上执行的,而不是在分配给单个处理器的进程集群上执行的TNE。SGTNE通过在处理器集群中的lp快照上执行最短路径算法来帮助打破处理器间死锁。本文讨论了该算法及其实现,并报告了在Intel Paragon A4多处理器机器上执行的分区FCFS排队网络模型的性能仿真结果。我们还研究了分区对SGTNE算法有效实现的影响。所获得的结果表明,SGTNE产生了良好的加速,并且与简单的分区策略相比,使用强连接组件算法的分区可以使模拟的运行时间减少30%。结果还表明,SGTNE优于TNE。