Parallel data distribution management on shared-memory multiprocessors
From MaRDI portal
Publication:6600077
DOI10.1145/3369759zbMATH Open1544.68043MaRDI QIDQ6600077
Moreno Marzolla, Gabriele D'Angelo
Publication date: 8 September 2024
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
parallel algorithmsparallel and distributed simulationdata distribution managementhigh/level architecture
Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Large-scale multi-agent transportation simulations
- An efficient parallel sorting algorithm for shared memory multiprocessors
- Quad trees: A data structure for retrieval by composite keys
- Symmetric binary B-trees: Data structure and maintenance algorithms
- A new approach to rectangle intersections
- Priority Search Trees
- Parallel Merge Sort
- Counting and Reporting Intersections of d-Ranges
This page was built for publication: Parallel data distribution management on shared-memory multiprocessors