Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.04343 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929452861095936 |
|---|---|
| author | Hernández-Tello, Javier Martínez-del-Amor, Miguel Ángel Orellana-Martín, David Cabarle, Francis George C. |
| author_facet | Hernández-Tello, Javier Martínez-del-Amor, Miguel Ángel Orellana-Martín, David Cabarle, Francis George C. |
| contents | The parallel simulation of Spiking Neural P systems is mainly based on a matrix representation, where the graph inherent to the neural model is encoded in an adjacency matrix. The simulation algorithm is based on a matrix-vector multiplication, which is an operation efficiently implemented on parallel devices. However, when the graph of a Spiking Neural P system is not fully connected, the adjacency matrix is sparse and hence, lots of computing resources are wasted in both time and memory domains. For this reason, two compression methods for the matrix representation were proposed in a previous work, but they were not implemented nor parallelized on a simulator. In this paper, they are implemented and parallelized on GPUs as part of a new Spiking Neural P system with delays simulator. Extensive experiments are conducted on high-end GPUs (RTX2080 and A100 80GB), and it is concluded that they outperform other solutions based on state-of-the-art GPU libraries when simulating Spiking Neural P systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_04343 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Sparse Spiking Neural-like Membrane Systems on Graphics Processing Units Hernández-Tello, Javier Martínez-del-Amor, Miguel Ángel Orellana-Martín, David Cabarle, Francis George C. Distributed, Parallel, and Cluster Computing Neural and Evolutionary Computing The parallel simulation of Spiking Neural P systems is mainly based on a matrix representation, where the graph inherent to the neural model is encoded in an adjacency matrix. The simulation algorithm is based on a matrix-vector multiplication, which is an operation efficiently implemented on parallel devices. However, when the graph of a Spiking Neural P system is not fully connected, the adjacency matrix is sparse and hence, lots of computing resources are wasted in both time and memory domains. For this reason, two compression methods for the matrix representation were proposed in a previous work, but they were not implemented nor parallelized on a simulator. In this paper, they are implemented and parallelized on GPUs as part of a new Spiking Neural P system with delays simulator. Extensive experiments are conducted on high-end GPUs (RTX2080 and A100 80GB), and it is concluded that they outperform other solutions based on state-of-the-art GPU libraries when simulating Spiking Neural P systems. |
| title | Sparse Spiking Neural-like Membrane Systems on Graphics Processing Units |
| topic | Distributed, Parallel, and Cluster Computing Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2408.04343 |