start
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
start [2016/05/31 07:32] – gdangelo | start [2021/01/08 09:09] – gda | ||
---|---|---|---|
Line 1: | Line 1: | ||
+ | {{ : | ||
+ | ~~NOTOC~~ | ||
+ | |||
+ | ====== Parallel and Distributed Simulation (PADS) Research Group ====== | ||
+ | // | ||
+ | |||
+ | Welcome to the PADS homepage, you can find some information about this [[pads: | ||
+ | |||
+ | A lot of our research work is based on a new Parallel and Distributed Simulation (PADS) middleware ([[PADS: | ||
+ | |||
+ | Please feel free to [[PADS: | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== SOFTWARE: LUNES-Blockchain preview ===== | ||
+ | |||
+ | A preview version of the LUNES-Blockchain simulator (i.e. agent-based simulation of DLTs and Blockchains) has been published in form of source code in the [[pads: | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== NEW PAPER: Internet-based Adaptive Distributed Simulation of Mobile Ad-hoc Networks ===== | ||
+ | |||
+ | In this paper we focus on Internet-based simulation, a form of distributed simulation in which a set of execution units that are physically located around the globe work together to run a simulation model. We simulate a wireless model over a real Internet-based distributed simulation setup, and evaluate the scalability of the simulator with and without the use of adaptive strategies for both communication overhead reduction and load-balancing enhancement. | ||
+ | |||
+ | For more information follow [[wsc2019-paper|this link]]. | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== NEW PAPER: Agent-based Simulation of Blockchains ===== | ||
+ | |||
+ | In this paper, we describe LUNES-Blockchain, | ||
+ | |||
+ | For more information follow [[asiasim2019-paper|this link]]. | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== NEW PAPER: Parallel Data Distribution Management on Shared-Memory Multiprocessors ===== | ||
+ | |||
+ | In this paper we propose two parallel solutions to the DDM problem that can operate effectively on shared-memory multiprocessors. | ||
+ | |||
+ | For more information follow [[parallelDDM-paper|this link]]. | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== NEW PAPER: Parallel Sort-Based Matching for Data Distribution Management on Shared-Memory Multiprocessors ===== | ||
+ | |||
+ | In this paper, we propose a parallel version of the Sort-Based Matching algorithm for shared-memory multiprocessors. | ||
+ | |||
+ | <color purple> | ||
+ | |||
+ | For more information follow [[parallelSBM-paper|this link]]. | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== HPCS 2016 Tutorial ===== | ||
+ | |||
+ | In the tutorial " | ||
+ | |||
+ | We discuss the main limitations of the current approaches with the goal to foster discussion and to increase the knowledge on both simulation and IoT. The last part of the tutorial will be about our practical experience in the simulation of IoT using a multi-level modelling approach. | ||
+ | |||
+ | For more information follow [[http:// | ||
+ | |||
start.txt · Last modified: 2023/09/02 12:44 by gda