{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:27:49Z","timestamp":1768548469671,"version":"3.49.0"},"reference-count":24,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03n04","funder":[{"name":"EU Marie Sk\u0142odowska-Curie Actions for Ukraine"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:p> Novel paradigm of Sleptsov Net Computing (SNC) mends imperfections of modern HPC architecture with computing memory implementation and provides a vivid graphical language, fine granulation of concurrent processes, and wide application of formal methods for reliable software design. IDE and VM for SNC have been developed and described in early papers. In the present paper, we considerably reduce GPU memory and thread consumption of the previous prototype implementation, introducing a matrix with condensed columns (MCC), and enhance performance, using the first fireable transition choice on the transition sequence reordered according to the lattice of priorities. MCC takes into consideration procedures of Sleptsov net (SN) arcs processing to enhance performance with rather little overhead compared to traditional sparse matrix formats. We represent a matrix of SN arcs by a pair of considerably smaller matrices, having the same number of columns, with the number of rows equal to the maximal number of nonzero elements over the source matrix columns. The first matrix contains the indexes within the source matrix, the second matrix contains the values within the source matrix. To run an SN, we use the corresponding rectangular matrix of GPU threads, with very few indirect memory accesses via MCC. As a result, we increase VM performance in 2\u20134 times, and reduce by hundred times GPU memory and thread consumption on programs from the SN software collection. <\/jats:p>","DOI":"10.1142\/s0129626424500129","type":"journal-article","created":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T05:06:12Z","timestamp":1732338372000},"source":"Crossref","is-referenced-by-count":2,"title":["GPU Based Virtual Machine for Sleptsov Net Computing"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4799-3842","authenticated-orcid":false,"given":"Tatiana R.","family":"Shmeleva","sequence":"first","affiliation":[{"name":"Max Planck Institute for Software Systems, Paul-Ehrlich Strasse G 26, Kaiserslautern, 67663, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5450-2696","authenticated-orcid":false,"given":"Ivan D.","family":"Zaitsev","sequence":"additional","affiliation":[{"name":"University of the West of England, Unconventional Computing Laboratory, Coldharbour Lane, Bristol, BS16 1QY, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6739-0272","authenticated-orcid":false,"given":"Werner","family":"Retschitzegger","sequence":"additional","affiliation":[{"name":"Johannes Kepler Universit\u00e4t Linz, Department of Information Systems, Altenberger Stra\u00dfe 69, Linz, 4040, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"S0129626424500129BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2444414"},{"key":"S0129626424500129BIB002","doi-asserted-by":"publisher","DOI":"10.1177\/1687814016640159"},{"key":"S0129626424500129BIB003","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2023.2201002"},{"key":"S0129626424500129BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114346"},{"key":"S0129626424500129BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.11.098"},{"key":"S0129626424500129BIB007","volume-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson J. L.","year":"1981"},{"key":"S0129626424500129BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"S0129626424500129BIB009","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/1.1.2"},{"key":"S0129626424500129BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/BF02943551"},{"key":"S0129626424500129BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2347933"},{"key":"S0129626424500129BIB012","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2021.1991340"},{"key":"S0129626424500129BIB013","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626423500068"},{"key":"S0129626424500129BIB014","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2017.1283410"},{"key":"S0129626424500129BIB018","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2021.1945054"},{"key":"S0129626424500129BIB019","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2021.1945055"},{"key":"S0129626424500129BIB022","volume-title":"Professional CUDA C Programming","author":"Cheng John","year":"2014"},{"key":"S0129626424500129BIB023","volume-title":"Clans of Petri Nets: Verification of protocols and performance evaluation of networks","author":"Zaitsev D. A.","year":"2013"},{"key":"S0129626424500129BIB024","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2873354"},{"key":"S0129626424500129BIB025","doi-asserted-by":"publisher","DOI":"10.1002\/9780470611012"},{"key":"S0129626424500129BIB026","doi-asserted-by":"publisher","DOI":"10.1080\/00207540412331312688"},{"key":"S0129626424500129BIB027","volume-title":"Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach","author":"Li Z. W.","year":"2009"},{"key":"S0129626424500129BIB028","volume-title":"Sparse Matrix Computations","author":"Bunch R.","year":"1976"},{"key":"S0129626424500129BIB029","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881"},{"key":"S0129626424500129BIB030","volume-title":"Computational Methods for General Sparse Matrices","author":"Zlatev Z.","year":"2013"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626424500129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T14:47:18Z","timestamp":1732978038000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129626424500129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":24,"journal-issue":{"issue":"03n04","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["10.1142\/S0129626424500129"],"URL":"https:\/\/doi.org\/10.1142\/s0129626424500129","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]},"article-number":"2450012"}}