Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation最新文献

筛选
英文 中文
Session details: Theoretical aspects and emergent behavior 会议细节:理论方面和突发行为
Gabriel A. Wainer
{"title":"Session details: Theoretical aspects and emergent behavior","authors":"Gabriel A. Wainer","doi":"10.1145/3260235","DOIUrl":"https://doi.org/10.1145/3260235","url":null,"abstract":"","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123725044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Session details: Optimistic parallel discrete-event simulation 会议细节:乐观并行离散事件模拟
R. Fujimoto
{"title":"Session details: Optimistic parallel discrete-event simulation","authors":"R. Fujimoto","doi":"10.1145/3260238","DOIUrl":"https://doi.org/10.1145/3260238","url":null,"abstract":"","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125665870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Supporting end-to-end internet QoS for DDS-based large-scale distributed simulation 支持基于dds的大规模分布式仿真的端到端互联网QoS
Akram Hakiri, Pascal Berthou, Slim Abdellatif, M. Diaz, T. Gayraud
{"title":"Supporting end-to-end internet QoS for DDS-based large-scale distributed simulation","authors":"Akram Hakiri, Pascal Berthou, Slim Abdellatif, M. Diaz, T. Gayraud","doi":"10.1145/2486092.2486149","DOIUrl":"https://doi.org/10.1145/2486092.2486149","url":null,"abstract":"Supporting end-to-end quality-of-service (QoS) in Large-scale distributed interactive simulations (DIS) is hard due to the heterogeneity and scale of communication networks, transient behavior, and the lack of mechanisms that holistically schedule different resources end-to-end. This paper aims to cope with these problems in the context of wide area network (WAN)-based DIS applications that use the OMG Data Distribution Service (DDS) QoS-enabled publish/subscribe middleware. First, we show the design and implementation of the QoS framework, which is a policy-driven architecture that shields DDS-based DIS applications from the details of network QoS mechanisms by specifying per-flow network QoS requirements, performing resource allocation and validation decisions (such as admission control), and enforcing per-flow network QoS at runtime. Second, we evaluate the capabilities of the framework in an experimental large-scale multi-domains environment. The evaluation of the architecture shows that the proposed QoS framework improves the delivery of DDS services over heterogeneous IP networks, and confirms its potential impact for providing network-level differentiated performance.","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132477488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Simulation-based verification of hybrid automata stochastic logic formulas for stochastic symmetric nets 基于仿真的随机对称网混合自动机随机逻辑公式验证
E. Amparore, Benoît Barbot, M. Beccuti, S. Donatelli, G. Franceschinis
{"title":"Simulation-based verification of hybrid automata stochastic logic formulas for stochastic symmetric nets","authors":"E. Amparore, Benoît Barbot, M. Beccuti, S. Donatelli, G. Franceschinis","doi":"10.1145/2486092.2486124","DOIUrl":"https://doi.org/10.1145/2486092.2486124","url":null,"abstract":"The Hybrid Automata Stochastic Logic (HASL) has been recently defined as a flexible way to express classical performance measures as well as more complex, path-based ones (generically called \"HASL formulas\"). The considered paths are executions of Generalized Stochastic Petri Nets (GSPN), which are an extension of the basic Petri net formalism to define discrete event stochastic processes. The computation of the HASL formulas for a GSPN model is demanded to the COSMOS tool, that applies simulation techniques to the formula computation. Stochastic Symmetric Nets (SSN) are a high level Petri net formalism, of the colored type, in which tokens can have an identity, and it is well known that colored Petri nets allow one to describe systems in a more compact and parametric form than basic (uncolored) Petri nets. In this paper we propose to extend HASL and COSMOS to support colors, so that performance formulas for SSN can be easily defined and evaluated. This requires a new definition of the logic, to ensure that colors are taken into account in a correct and useful manner, and a significant extension of the COSMOS tool.","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127861956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Reducing simulation costs of embedded simulation in yard crane dispatching in container terminals 降低集装箱码头堆场起重机调度嵌入式仿真的仿真成本
Shell-Ying Huang, Xi Guo
{"title":"Reducing simulation costs of embedded simulation in yard crane dispatching in container terminals","authors":"Shell-Ying Huang, Xi Guo","doi":"10.1145/2486092.2486131","DOIUrl":"https://doi.org/10.1145/2486092.2486131","url":null,"abstract":"Embedding simulation in optimization algorithms will incur computational costs. For NP-hard problems the computational costs of the embedded simulation in the optimization algorithm are likely to be substantial. YC dispatching is NP-hard. So it is very important to be able to minimize simulation costs in YC dispatching algorithms. In the optimization algorithm for yard crane dispatching published, simulation of YC operations of the entire (partial) sequence of YC jobs are carried out each time the tardiness of a (partial) sequence needs to be evaluated. In this paper we study two approaches to reduce simulation costs in these embedded simulations in the optimization algorithm. Experimental results show that one approach significantly reduces the computational time of the optimization algorithm. We also analyze the reasons for the other approach which fails to reduce the computational time.","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Topological computation of activity regions 活动区的拓扑计算
Martin Potier, Antoine Spicher, Olivier Michel
{"title":"Topological computation of activity regions","authors":"Martin Potier, Antoine Spicher, Olivier Michel","doi":"10.1145/2486092.2486136","DOIUrl":"https://doi.org/10.1145/2486092.2486136","url":null,"abstract":"Most of the frameworks and languages available in the field of modeling and simulation of dynamical systems focus on the specification of the state of the system and its transition function. Although we believe that this task has been elegantly solved by the design of the rule-based topological programming language MGS, an interesting challenge remains in the computation of the activity, and its topology, exhibited by their discrete event simulation. This additional information can help in optimizing, analyzing and modeling complex systems.","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114768843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Parallel stepwise stochastic simulation: harnessing GPUs to explore possible futures states of a chromosome folding model thanks to the possible futures algorithm (PFA) 并行逐步随机模拟:利用可能未来算法(PFA)利用gpu探索染色体折叠模型的可能未来状态
Jonathan Passerat-Palmbach, Jonathan Caux, Y. Pennec, R. Reuillon, I. Junier, F. Képès, D. Hill
{"title":"Parallel stepwise stochastic simulation: harnessing GPUs to explore possible futures states of a chromosome folding model thanks to the possible futures algorithm (PFA)","authors":"Jonathan Passerat-Palmbach, Jonathan Caux, Y. Pennec, R. Reuillon, I. Junier, F. Képès, D. Hill","doi":"10.1145/2486092.2486114","DOIUrl":"https://doi.org/10.1145/2486092.2486114","url":null,"abstract":"For the sake of software compatibility, simulations are often parallelized without much code rewriting. Performances can be further improved by optimizing codes so that to use the maximum power offered by parallel architectures. While this approach can provide some speed-up, performance of parallelized codes can be strongly limited a priori because traditional algorithms have been designed for sequential technologies. Thus, additional increase of performance should ultimately rely on some redesign of algorithms. Here, we redesign an algorithm that has traditionally been used to simulate the folding properties of polymers. We address the issue of performance in the context of biological applications, more particularly in the active field of chromosome modelling. Due to the strong confinement of chromosomes in the cells, simulation of their motion is slowed down by the laborious search for the next valid states to progress. Our redesign, that we call the Possible Futures Algorithm (PFA), relies on the parallel computation of possible evolutions of the same state, which effectively increases the probability to obtain a valid state at each step. We apply PFA on a GPU-based architecture, allowing us to optimally reduce the latency induced by the computation overhead of possible futures. We show that compared to the initial sequential model the acceptance rate of new states significantly increases without impacting the execution time. In particular, the stronger the confinement of the chromosome, the more efficient PFA becomes, making our approach appealing for biological applications. While most of our results were obtained using Fermi architecture GPUs from NVIDIA, we highlight improved performance on the cutting-edge Kepler architecture K20 GPUs.","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122204635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Semi-automatic extraction of software skeletons for benchmarking large-scale parallel applications 用于大规模并行应用基准测试的软件骨架的半自动提取
M. Sottile, A. Dakshinamurthy, G. Hendry, D. Dechev
{"title":"Semi-automatic extraction of software skeletons for benchmarking large-scale parallel applications","authors":"M. Sottile, A. Dakshinamurthy, G. Hendry, D. Dechev","doi":"10.1145/2486092.2486094","DOIUrl":"https://doi.org/10.1145/2486092.2486094","url":null,"abstract":"The design of high-performance computing architectures requires performance analysis of large-scale parallel applications to derive various parameters concerning hardware design and software development. The process of performance analysis and benchmarking an application can be done in several ways with varying degrees of fidelity. One of the most cost-effective ways is to do a coarse-grained study of large-scale parallel applications through the use of program skeletons. The concept of a \"program skeleton\" that we discuss in this paper is an abstracted program that is derived from a larger program where source code that is determined to be irrelevant is removed for the purposes of the skeleton. In this work, we develop a semi-automatic approach for extracting program skeletons based on compiler program analysis. We demonstrate correctness of our skeleton extraction process by comparing details from communication traces, as well as show the performance speedup of using skeletons by running simulations in the SST/macro simulator.","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132178808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Session details: Activity management 会话详细信息:活动管理
Yiping Yao
{"title":"Session details: Activity management","authors":"Yiping Yao","doi":"10.1145/3260232","DOIUrl":"https://doi.org/10.1145/3260232","url":null,"abstract":"","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116920518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation 第一届ACM SIGSIM高级离散仿真原理会议论文集
{"title":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","authors":"","doi":"10.1145/2486092","DOIUrl":"https://doi.org/10.1145/2486092","url":null,"abstract":"","PeriodicalId":115341,"journal":{"name":"Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124686864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信