start
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
start [2025/07/16 08:39] – gda | start [2025/07/17 19:43] (current) – gda | ||
---|---|---|---|
Line 10: | Line 10: | ||
Please feel free to [[PADS: | Please feel free to [[PADS: | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== NEW PAPER: Performance evaluation of a self-clustering heuristic for adaptive PADS ===== | ||
+ | |||
+ | Parallel And Distributed Simulation (PADS) is a well known modeling paradigm that allows efficient implementation of large simulation models as a collection of interacting entities, called Simulated Entities (SEs). SEs can then be assigned to independent execution units for parallel execution, if possible. Allocating SEs to execution units is one of the most challenging problems in PADS: ideally, highly interacting SEs should be placed on the same execution unit so that all communications are local; however, placing too many SEs on the same processor might degrade performance. Furthermore, | ||
+ | |||
+ | For more information follow [[dsrt2025|this link]]. | ||
---- | ---- | ||
Line 21: | Line 29: | ||
---- | ---- | ||
- | ===== NEW PAPER: Adaptive Parallel and Distributed Simulation of Complex Networks ===== | ||
- | |||
- | In this paper we present a study on the intricate problem of the simulation of large scale complex networks. The complexity of the simulation is due to the need to represent networks with a high number of nodes and links, but even more to the need to model interactions among network nodes. We focus on discrete-event simulation, a simulation methodology that enables both sequential (i.e. monolithic) and parallel/ | ||
- | |||
- | For more information follow [[jpdc2021-paper|this link]]. | ||
start.1752655181.txt.gz · Last modified: 2025/07/16 08:39 by gda