The Parallelization of Computations for Ensuring Information Security in Connected Vehicle Systems Using Q-Effective Programming: The Example of Dijkstra's Algorithm
This work researches the possibility of applying the concept of a Q-determinant for the parallelization of calculations in the implementation of algorithms to ensure the security of information in systems of connected vehicles. The increasing complexity of connected vehicle systems increases the com...
Gespeichert in:
| Veröffentlicht in: | 2023 International Russian Smart Industry Conference (SmartIndustryCon) S. 438 - 442 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
27.03.2023
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This work researches the possibility of applying the concept of a Q-determinant for the parallelization of calculations in the implementation of algorithms to ensure the security of information in systems of connected vehicles. The increasing complexity of connected vehicle systems increases the computational complexity of algorithms used to identify vulnerable nodes in such systems. This requires finding an effective approach to the parallelization of calculations. As an example, Dijkstra's algorithm is used to search for vulnerable nodes in a network of connected vehicles. The method of designing effective programs based on a Q-determinant concept is described. The results of an experimental study of the developed programs conducted on the "Tornado SUSU" supercomputer are presented. The research makes it possible to conclude that a Q-determinant concept is an effective approach to parallelizing Dijkstra's algorithm. |
|---|---|
| AbstractList | This work researches the possibility of applying the concept of a Q-determinant for the parallelization of calculations in the implementation of algorithms to ensure the security of information in systems of connected vehicles. The increasing complexity of connected vehicle systems increases the computational complexity of algorithms used to identify vulnerable nodes in such systems. This requires finding an effective approach to the parallelization of calculations. As an example, Dijkstra's algorithm is used to search for vulnerable nodes in a network of connected vehicles. The method of designing effective programs based on a Q-determinant concept is described. The results of an experimental study of the developed programs conducted on the "Tornado SUSU" supercomputer are presented. The research makes it possible to conclude that a Q-determinant concept is an effective approach to parallelizing Dijkstra's algorithm. |
| Author | Sokolov, Mikhail P. Zyulyarkina, Natalya D. Manatin, Pavel A. |
| Author_xml | – sequence: 1 givenname: Mikhail P. surname: Sokolov fullname: Sokolov, Mikhail P. email: sokolovmp@susu.ru organization: South Ural State University (National Research University),Department of Information Security,Chelyabinsk,Russia – sequence: 2 givenname: Pavel A. surname: Manatin fullname: Manatin, Pavel A. email: manatinpa@ya.ru organization: South Ural State University (National Research University),Department of System Programming,Chelyabinsk,Russia – sequence: 3 givenname: Natalya D. surname: Zyulyarkina fullname: Zyulyarkina, Natalya D. email: ziuliarkinand@susu.ru organization: South Ural State University (National Research University),Department of Information Security,Chelyabinsk,Russia |
| BookMark | eNo1UMtOwzAQNBIcoPQPOPjGAaXYcZ7cqhCgEhKgtlwrx1m3htiuYhcR_of_xKVwWu1oZmdnztCxsQYQuqJkQikpr-ea935m2p3z_VBZk-aMxpOYxGxCSWDkSXqExmVe0CxLkyyJS3qKvhcbwM-8510HnfriXlmDrcSV1dud_10dlrbHtXG7Xpk1npmw6gNxDiKAfsDKBIUxIDy0-BU2SnSA54PzoB1eur3uJaqlDAT1EQx7u-651gG_wfsP6k-ut0ESnG_V23tIwC8dnnZrG85v9Dk6kbxzMP6bI7S8qxfVQ_T4dD-rpo-RorT0UcGLnAvISk4gbUXIKUguRVwWjYC2kKEEmTBGmGhT2caQCp7yhjU81JM0pGEjdHG4qwBgte1VqHRY_bfHfgCsvXPg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/SmartIndustryCon57312.2023.10110745 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781665464291 1665464291 |
| EndPage | 442 |
| ExternalDocumentID | 10110745 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i119t-8a87ace69a0e5dc166c07fc298bced8f110f43303cd5fd2e5ca5ab3ba0114b0b3 |
| IEDL.DBID | RIE |
| IngestDate | Thu Jan 18 11:14:44 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i119t-8a87ace69a0e5dc166c07fc298bced8f110f43303cd5fd2e5ca5ab3ba0114b0b3 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_10110745 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-March-27 |
| PublicationDateYYYYMMDD | 2023-03-27 |
| PublicationDate_xml | – month: 03 year: 2023 text: 2023-March-27 day: 27 |
| PublicationDecade | 2020 |
| PublicationTitle | 2023 International Russian Smart Industry Conference (SmartIndustryCon) |
| PublicationTitleAbbrev | SmartIndustryCon |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.8264954 |
| Snippet | This work researches the possibility of applying the concept of a Q-determinant for the parallelization of calculations in the implementation of algorithms to... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 438 |
| SubjectTerms | computing on a supercomputer Connected vehicles cybersecurity Dijkstra's algorithm Heuristic algorithms high-performance computing improving parallel computing efficiency Information security Memory management Parallel processing Programming Q-effective program Supercomputers |
| Title | The Parallelization of Computations for Ensuring Information Security in Connected Vehicle Systems Using Q-Effective Programming: The Example of Dijkstra's Algorithm |
| URI | https://ieeexplore.ieee.org/document/10110745 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZohRATIIp46wYkBpSSl-OEDZVWDKgqKqBuleM4UGgT1AeCH8T_5M5xQQwMbJEVx9bZ8T1833eMnaDSyRVPXEeHvqRrRu0krp85sS9kGOUh-tuGXf9GdLvxYJD0LFjdYGG01ib5TDfp0dzlZ6VaUKgM_3DyVkJeYzUhogqstcbOLG_meX-C0rYVLz5aZcFF4BHWyg-ay56_aqgYFdLZ-Ofgm6zxA8aD3rea2WIruthmn7i80JNTqoQytlBKKHOoijRUUThAexTaxcwAEcHijsyLfVu0DkYFmEwXhXYnPOgn2kRgSczBZBPArVMRHOOpSNOgZK4Jtl8AzaD9LoldmEa-Gj2_UNjkdAaX48cSP_80abD7Tvuude3YigvOyPOSuRPLWEilo0S6mmfKiyLlilz5SZwqncU5SiAPA9R6KuN55muuJJdpkEpyq1I3DXZYvSgLvctAJLHHYyXQvtJo9EiJB2mABwi5eGiDiT3WIBkPXytSjeFSvPt_tB-wdVpJSv_yxSGrz6cLfcRW1dt8NJsem63wBZ80urU |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELWgIOAEiCJ2fEDigFKyuU64odKqiFIVtSBuleM4NNAmqAuCD-I_mXFcEAcO3CIrsa2x41k87w0hJ6B0EslC21K-K_CaUVmh7cZW4HLhVxMf_G3Nrt_i7Xbw-Bh2DFhdY2GUUjr5TFXwUd_lx7mcYagM_nD0Vny2SJaYD90UcK0VcmaYM8-7I5C3qXnxUcszxj0H0VauV5l_-6uKilYijfV_Dr9Byj9wPNr5VjSbZEFlW-QTFph2xBhroQwNmJLmCS3KNBRxOAoWKa1nEw1FpAZ5pF_smrJ1NM2oznWRYHnSBzXAbUQNjTnV-QT0zioojuFcxGlgOtcI2i8ozqD-LpBfGEe-Sp9fMHByOqGXw6ccuh-MyuS-Ue_VmpapuWCljhNOrUAEXEhVDYWtWCydalXaPJFuGERSxUECEkh8D_SejFkSu4pJwUTkRQIdq8iOvG1SyvJM7RDKw8BhgeRgYSkwe4SAo9SDIwSdPLDC-C4po4z7rwWtRn8u3r0_2o_JarN32-q3rts3-2QNVxWTwVx-QErT8UwdkmX5Nk0n4yO9Lb4AdxW9_A |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2023+International+Russian+Smart+Industry+Conference+%28SmartIndustryCon%29&rft.atitle=The+Parallelization+of+Computations+for+Ensuring+Information+Security+in+Connected+Vehicle+Systems+Using+Q-Effective+Programming%3A+The+Example+of+Dijkstra%27s+Algorithm&rft.au=Sokolov%2C+Mikhail+P.&rft.au=Manatin%2C+Pavel+A.&rft.au=Zyulyarkina%2C+Natalya+D.&rft.date=2023-03-27&rft.pub=IEEE&rft.spage=438&rft.epage=442&rft_id=info:doi/10.1109%2FSmartIndustryCon57312.2023.10110745&rft.externalDocID=10110745 |