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 [2017/10/19 09:35] – [NEW PAPER: Parallel Sort-Based Matching for Data Distribution Management on Shared-Memory Multiprocessors] gdangelo | start [2019/10/09 19:05] – [NEW PAPER: Parallel Sort-Based Matching for Data Distribution Management on Shared-Memory Multiprocessors] gda | ||
---|---|---|---|
Line 10: | Line 10: | ||
Please feel free to [[PADS: | Please feel free to [[PADS: | ||
+ | |||
+ | ---- | ||
+ | |||
+ | ===== 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]]. | ||
---- | ---- | ||
Line 17: | Line 25: | ||
In this paper, we propose a parallel version of the Sort-Based Matching algorithm for shared-memory multiprocessors. | In this paper, we propose a parallel version of the Sort-Based Matching algorithm for shared-memory multiprocessors. | ||
- | <fc Purple>**Best Paper Award: 21-th ACM/IEEE International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2017).**</ | + | <color purple>**Best Paper Award: 21-th ACM/IEEE International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2017).**</ |
For more information follow [[parallelSBM-paper|this link]]. | For more information follow [[parallelSBM-paper|this link]]. | ||
Line 56: | Line 64: | ||
===== Additional resources ===== | ===== Additional resources ===== | ||
- | < | + | < |
* [[pads: | * [[pads: | ||
* [[pads: | * [[pads: | ||
start.txt · Last modified: 2023/09/02 12:44 by gda