Discrete Event Simulation (DES) is a widely used technique in which the state of the simulator is updated by events happening at discrete points in time (hence the name). DES is used to model and analyze many kinds of systems, including computer architectures, communication networks, street traffic, and others. Parallel and Distributed Simulation (PADS) aims at improving the efficiency of DES by partitioning the simulation model across multiple processing elements, in order to enabling larger and/or more detailed studies to be carried out. The interest on PADS is increasing since the widespread availability of multicore processors and affordable high performance computing clusters. However, designing parallel simulation models requires considerable expertise, the result being that PADS techniques are not as widespread as they could be. In this paper we describe ErlangTW, a parallel simulation middleware based on the Time Warp synchronization protocol. ErlangTW is entirely written in Erlang, a concurrent, functional programming language specifically targeted at building distributed systems. We argue that writing parallel simulation models in Erlang is considerably easier than using conventional programming languages. Moreover, ErlangTW allows simulation models to be executed either on single-core, multicore and distributed computing architectures. We describe the design and prototype implementation of ErlangTW, and report some preliminary performance results on multicore and distributed architectures using the well known PHOLD benchmark.
TriADA: Massively Parallel Trilinear Matrix-by-Tensor Multiply-Add Algorithm and Device Architecture for the Acceleration of 3D Discrete Transformations
Max Planck Institute for Informatics(马克斯·普朗克信息学研究所);Saarland Informatics Campus(萨尔兰信息学园区)
提出了一种求解结构预测中0- 1整数线性规划问题的大规模并行Lagrange分解方法。我们提出了一个新的迭代更新方案解决拉格朗日对偶和扰动技术解码原始解。为了表示子问题,我们遵循Lange et al.(2021)并使用二元决策图(BDD)。我们的原始和对偶算法需要很少的子问题之间的同步和优化BDD只需要基本的操作,没有复杂的控制流。这使我们能够利用GPU为我们方法的所有组件提供的并行性。我们目前的实验结果组合问题的MAP推理马尔可夫随机场,二次分配和细胞跟踪发育生物学。我们的高度并行GPU实现将Lange等人(2021)算法的运行时间提高了数量级。特别是,我们接近或优于一些国家的最先进的专业化物流,同时是问题不可知论。我们的实现可以在https://github.com/LPMP/BDD上获得。