Pub Date : 2023-02-05DOI: 10.1080/17445760.2023.2173752
Alessio Masola, Nicola Capodieci
Modern Cyber Physical Systems (CPS) applications require hardware capable of optimized performance-per-watt efficency. This is usually obtained through massively parallel accelerators such as the GPU. Recent research is therefore investigating novel designs to optimize GPU energy consumption and performance for various applications in the Internet-of-things, autonomous navigation, and industrial robotics domains. This paper presents a survey of the current state-of-the-art approaches for optimizing GPU performance metrics; we present a complete and up-to-date summary of ideas, mechanisms, and potential improvements for next-generation GPU devices. GRAPHICAL ABSTRACT
{"title":"Optimization strategies for GPUs: an overview of architectural approaches","authors":"Alessio Masola, Nicola Capodieci","doi":"10.1080/17445760.2023.2173752","DOIUrl":"https://doi.org/10.1080/17445760.2023.2173752","url":null,"abstract":"Modern Cyber Physical Systems (CPS) applications require hardware capable of optimized performance-per-watt efficency. This is usually obtained through massively parallel accelerators such as the GPU. Recent research is therefore investigating novel designs to optimize GPU energy consumption and performance for various applications in the Internet-of-things, autonomous navigation, and industrial robotics domains. This paper presents a survey of the current state-of-the-art approaches for optimizing GPU performance metrics; we present a complete and up-to-date summary of ideas, mechanisms, and potential improvements for next-generation GPU devices. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"140 - 154"},"PeriodicalIF":1.1,"publicationDate":"2023-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46677906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-02-05DOI: 10.1080/17445760.2023.2172576
D. Davendra, Magdalena Metlicka, M. Bialic-Davendra
A parallel version of Ant Lion Optimizer algorithm using the CUDA platform is introduced in this paper. Efficient kernel, memory and thread management approaches have been developed to maximize its performance. The new algorithm was tested against the canonical algorithm on 15 scalable problems of different sizes, with a total of 172 experiments. The solution costs and the execution times were compared using relative percentage difference and significance tests. The results showed the CUDA antlion algorithm significantly improves upon the execution time, while retaining the same solution quality.
{"title":"CUDA implementation of the antlion optimization algorithm","authors":"D. Davendra, Magdalena Metlicka, M. Bialic-Davendra","doi":"10.1080/17445760.2023.2172576","DOIUrl":"https://doi.org/10.1080/17445760.2023.2172576","url":null,"abstract":"A parallel version of Ant Lion Optimizer algorithm using the CUDA platform is introduced in this paper. Efficient kernel, memory and thread management approaches have been developed to maximize its performance. The new algorithm was tested against the canonical algorithm on 15 scalable problems of different sizes, with a total of 172 experiments. The solution costs and the execution times were compared using relative percentage difference and significance tests. The results showed the CUDA antlion algorithm significantly improves upon the execution time, while retaining the same solution quality.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"118 - 139"},"PeriodicalIF":1.1,"publicationDate":"2023-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43058439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-31DOI: 10.1080/17445760.2022.2161093
Shanshan Yin, Liqiong Xu, Zhecheng Yu
Reliability evaluation of interconnection networks is of significant importance to the design and maintenance of interconnection networks. The component connectivity is an important parameter for the reliability evaluation of interconnection networks and is a generalization of the traditional connectivity. Let be an integer and G be a connected graph. A g-component cut of G is a vertex set S such that G−S has at least g components. The g-component connectivity of G is the size of the smallest g-component cut. Determining the g-component connectivity is still an unsolved problem in many interconnection networks. In this paper, we prove the lower bound of the g-component connectivity of any n-dimensional hypercube-like networks. We also determine the g-component connectivity of varietal hypercubes and crossed cubes which are the members of hypercube-like networks. As a by-product, we characterize the optimal g-component cut under the condition that any two vertices have exactly two common neighbors if they have of any n-dimensional hypercube-like networks.
{"title":"On the g-component connectivity of hypercube-like networks","authors":"Shanshan Yin, Liqiong Xu, Zhecheng Yu","doi":"10.1080/17445760.2022.2161093","DOIUrl":"https://doi.org/10.1080/17445760.2022.2161093","url":null,"abstract":"Reliability evaluation of interconnection networks is of significant importance to the design and maintenance of interconnection networks. The component connectivity is an important parameter for the reliability evaluation of interconnection networks and is a generalization of the traditional connectivity. Let be an integer and G be a connected graph. A g-component cut of G is a vertex set S such that G−S has at least g components. The g-component connectivity of G is the size of the smallest g-component cut. Determining the g-component connectivity is still an unsolved problem in many interconnection networks. In this paper, we prove the lower bound of the g-component connectivity of any n-dimensional hypercube-like networks. We also determine the g-component connectivity of varietal hypercubes and crossed cubes which are the members of hypercube-like networks. As a by-product, we characterize the optimal g-component cut under the condition that any two vertices have exactly two common neighbors if they have of any n-dimensional hypercube-like networks.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"110 - 117"},"PeriodicalIF":1.1,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45968449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-06DOI: 10.1080/17445760.2022.2153248
E. Goles, Laura Leal, Pedro Montealegre, I. Rapaport, M. R. Wilson
ABSTRACT A Maximal Independent Set (MIS) is an inclusion maximal set of pairwise non-adjacent vertices. The computation of an MIS is one of the core problems in distributed computing. In this article, we introduce and analyze a finite-state distributed randomized algorithm for computing a Maximal Independent Set (MIS) on arbitrary undirected graphs. Our algorithm is self-stabilizing (reaches a correct output on any initial configuration) and can be implemented on systems with very scarce conditions. We analyze the convergence time of the proposed algorithm, showing that in many cases the algorithm converges in logarithmic time with high probability.
{"title":"Distributed maximal independent set computation driven by finite-state dynamics","authors":"E. Goles, Laura Leal, Pedro Montealegre, I. Rapaport, M. R. Wilson","doi":"10.1080/17445760.2022.2153248","DOIUrl":"https://doi.org/10.1080/17445760.2022.2153248","url":null,"abstract":"ABSTRACT A Maximal Independent Set (MIS) is an inclusion maximal set of pairwise non-adjacent vertices. The computation of an MIS is one of the core problems in distributed computing. In this article, we introduce and analyze a finite-state distributed randomized algorithm for computing a Maximal Independent Set (MIS) on arbitrary undirected graphs. Our algorithm is self-stabilizing (reaches a correct output on any initial configuration) and can be implemented on systems with very scarce conditions. We analyze the convergence time of the proposed algorithm, showing that in many cases the algorithm converges in logarithmic time with high probability.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"85 - 97"},"PeriodicalIF":1.1,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48467405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-10DOI: 10.1080/17445760.2022.2136372
T. Alexeeva, L. Chechurin, V. Dodonov, Zahra Honarmand, Nikolay V. Kuznetsov, P. Neittaanmäki
ABSTRACT The task of looking for the optimal allocation of resources in an economy is fraught with a number of severe restrictions. This is manifested in the complexity of the technical implementation of the solution even in the case of a low dimension of the problem. In this paper, we consider two approaches, analytical and numerical, for deriving the dynamical optimal allocation of resources in a three-sector economy and show that the use of modern artificial intelligence (AI) technologies such as genetic algorithms (GA), can be useful for expanding the range of effective tools and new contributions to this problem. GRAPHICAL ABSTRACT
{"title":"Optimal control and genetic algorithms in modeling dynamical allocation of resources for a three-sector economy","authors":"T. Alexeeva, L. Chechurin, V. Dodonov, Zahra Honarmand, Nikolay V. Kuznetsov, P. Neittaanmäki","doi":"10.1080/17445760.2022.2136372","DOIUrl":"https://doi.org/10.1080/17445760.2022.2136372","url":null,"abstract":"ABSTRACT The task of looking for the optimal allocation of resources in an economy is fraught with a number of severe restrictions. This is manifested in the complexity of the technical implementation of the solution even in the case of a low dimension of the problem. In this paper, we consider two approaches, analytical and numerical, for deriving the dynamical optimal allocation of resources in a three-sector economy and show that the use of modern artificial intelligence (AI) technologies such as genetic algorithms (GA), can be useful for expanding the range of effective tools and new contributions to this problem. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"99 - 109"},"PeriodicalIF":1.1,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44960559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-31DOI: 10.1080/17445760.2022.2140341
T. Matsuoka, T. Oya
We propose a single-electron (SE) information processing circuit that mimics the behavior of slime mold. While SE circuits have advantages such as parallel processing and low power consumption, a suitable information processing method has not yet been established for them. Thus, we focus on the behavior of slime mold to develop a suitable information processing method. Reportedly, slime molds can solve the traveling salesman problem (TSP) if their behaviors (i.e. stretching and shrinking) are harnessed. In a simulation results, our information processing method for SE circuits mimics a series of slime mold behaviors to derive the optimal solutions for the TSP. GRAPHICAL ABSTRACT
{"title":"Design of comb-shaped single-electron slime mold circuit and its application to traveling salesman problem","authors":"T. Matsuoka, T. Oya","doi":"10.1080/17445760.2022.2140341","DOIUrl":"https://doi.org/10.1080/17445760.2022.2140341","url":null,"abstract":"We propose a single-electron (SE) information processing circuit that mimics the behavior of slime mold. While SE circuits have advantages such as parallel processing and low power consumption, a suitable information processing method has not yet been established for them. Thus, we focus on the behavior of slime mold to develop a suitable information processing method. Reportedly, slime molds can solve the traveling salesman problem (TSP) if their behaviors (i.e. stretching and shrinking) are harnessed. In a simulation results, our information processing method for SE circuits mimics a series of slime mold behaviors to derive the optimal solutions for the TSP. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"613 - 622"},"PeriodicalIF":1.1,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46995361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-30DOI: 10.5121/ijdps.2022.13501
Abrar Naeem Shah, S. Kang
Routing is crucial in internet “communication” and is based on routing protocols. The routing protocol outlines the rules that routers use to share information between a source and a destination. In contrast, they do not move data from a source to the destination, but instead update the routing table containing data or, as we say, messages or information. Many routing protocols are available today, but they all serve the same goal-static and dynamic routing protocols. Dynamic routing is carried out automatically. Topology-based updates are made to routers, and routing tables are updated when topology changes. As a part of this research study, we will look at and analyze the protocols along with other associated research of RIP, EIGRP, and OSPF. In this study, we provide a practical analysis report by designing and implementing numerous LAN topology scenarios using the emulator (Graphical Network Simulator-3). Because of the proliferation of enormous commercial networks; their design uses a variety of routing protocols. so that a large network can remain connected; Network routers are required to implement route redistribution. This research develops the three phases on the same designed network topology and assesses the presentation of route redistribution across three routing technologies. RIP, EIGRP is the first phase, EIGRP, OSPF is the second, and RIP, OSPF is the third. This research also analyses the compatibility of the two separate versions of routing information protocol on the designed network topology in order to assess how two versions may interact with one other. This offers us the notion that there is a way out of it when the same problem emerges associated to EIGRP, OSPF, or BGP if protocols, as we know, Version-1 and Version-2 do not interact to one other. In this research, we also design the network lAN architecture and setup by utilising GNS-3 in order to evaluate how rip supports merely subnetted networks and eigrp supports major networks.
{"title":"A Practical Analysis Report of Rip, EIGRP, And an OSPF Dynamic Routing Protocol using the Network Simulator Tool GNS-3","authors":"Abrar Naeem Shah, S. Kang","doi":"10.5121/ijdps.2022.13501","DOIUrl":"https://doi.org/10.5121/ijdps.2022.13501","url":null,"abstract":"Routing is crucial in internet “communication” and is based on routing protocols. The routing protocol outlines the rules that routers use to share information between a source and a destination. In contrast, they do not move data from a source to the destination, but instead update the routing table containing data or, as we say, messages or information. Many routing protocols are available today, but they all serve the same goal-static and dynamic routing protocols. Dynamic routing is carried out automatically. Topology-based updates are made to routers, and routing tables are updated when topology changes. As a part of this research study, we will look at and analyze the protocols along with other associated research of RIP, EIGRP, and OSPF. In this study, we provide a practical analysis report by designing and implementing numerous LAN topology scenarios using the emulator (Graphical Network Simulator-3). Because of the proliferation of enormous commercial networks; their design uses a variety of routing protocols. so that a large network can remain connected; Network routers are required to implement route redistribution. This research develops the three phases on the same designed network topology and assesses the presentation of route redistribution across three routing technologies. RIP, EIGRP is the first phase, EIGRP, OSPF is the second, and RIP, OSPF is the third. This research also analyses the compatibility of the two separate versions of routing information protocol on the designed network topology in order to assess how two versions may interact with one other. This offers us the notion that there is a way out of it when the same problem emerges associated to EIGRP, OSPF, or BGP if protocols, as we know, Version-1 and Version-2 do not interact to one other. In this research, we also design the network lAN architecture and setup by utilising GNS-3 in order to evaluate how rip supports merely subnetted networks and eigrp supports major networks.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"31 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89567239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-27DOI: 10.1080/17445760.2022.2126975
G. Krishna, A. Saha
ABSTRACT Quantum computing has gained an advantage in recent years due to its compatibility and usage in various fields. The IoT environment is huge, and almost the whole world relies on it to acquire efficient data transmissions. Combining quantum computing with the IoT improves the system’s performance to a drastic level. The proposed technique focuses on introducing quantum computing into the IoT to optimise the sensor space without degrading the sensing ability of the sensors. To optimise the sensor space, the Quantum Computing based Rider Optimisation (QCRO) is introduced with optimal global search behaviour inspired by the Rider Optimisation Algorithm (ROA). After optimising sensor space, the Glued Tree based on Continuous quantum Walks (GTCW) is used to minimise the energy loss in the network. The continuous quantum walks are introduced into the Glued Trees (GT) to find the optimal path that can provide a minimised error rate. The experimental results demonstrated the effectiveness of the proposed approach against the other existing techniques in terms of data accuracy, data temporal efficiency and data cost. GRAPHICAL ABSTRACT
{"title":"Optimal sensor spacing in IoT network based on quantum computing technology","authors":"G. Krishna, A. Saha","doi":"10.1080/17445760.2022.2126975","DOIUrl":"https://doi.org/10.1080/17445760.2022.2126975","url":null,"abstract":"ABSTRACT Quantum computing has gained an advantage in recent years due to its compatibility and usage in various fields. The IoT environment is huge, and almost the whole world relies on it to acquire efficient data transmissions. Combining quantum computing with the IoT improves the system’s performance to a drastic level. The proposed technique focuses on introducing quantum computing into the IoT to optimise the sensor space without degrading the sensing ability of the sensors. To optimise the sensor space, the Quantum Computing based Rider Optimisation (QCRO) is introduced with optimal global search behaviour inspired by the Rider Optimisation Algorithm (ROA). After optimising sensor space, the Glued Tree based on Continuous quantum Walks (GTCW) is used to minimise the energy loss in the network. The continuous quantum walks are introduced into the Glued Trees (GT) to find the optimal path that can provide a minimised error rate. The experimental results demonstrated the effectiveness of the proposed approach against the other existing techniques in terms of data accuracy, data temporal efficiency and data cost. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"58 - 84"},"PeriodicalIF":1.1,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42072444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-20DOI: 10.1080/17445760.2022.2124411
Satakshi Ghosh, Pritam Goswami, Avisek Sharma, B. Sau
ABSTRACT The ARBITRARY PATTERN FORMATION (APF) is widely studied in distributed computing for swarm robots. This paper deals with the APF problem in an infinite grid under an asynchronous scheduler. In [Bose K, Adhikary R, Kundu MK, et al. Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor Comput Sci. 2020;815:213–227], the authors proposed an algorithm for APF problem in model under an asynchronous scheduler, but the proposed algorithm was neither time optimal nor move optimal. This work provides two algorithms that solve APF problem in an asynchronous scheduler. The first algorithm is move optimal considering model and the second algorithm is move and time optimal considering the model, where each robot has one light having three distinct colours.
{"title":"Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid","authors":"Satakshi Ghosh, Pritam Goswami, Avisek Sharma, B. Sau","doi":"10.1080/17445760.2022.2124411","DOIUrl":"https://doi.org/10.1080/17445760.2022.2124411","url":null,"abstract":"ABSTRACT The ARBITRARY PATTERN FORMATION (APF) is widely studied in distributed computing for swarm robots. This paper deals with the APF problem in an infinite grid under an asynchronous scheduler. In [Bose K, Adhikary R, Kundu MK, et al. Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor Comput Sci. 2020;815:213–227], the authors proposed an algorithm for APF problem in model under an asynchronous scheduler, but the proposed algorithm was neither time optimal nor move optimal. This work provides two algorithms that solve APF problem in an asynchronous scheduler. The first algorithm is move optimal considering model and the second algorithm is move and time optimal considering the model, where each robot has one light having three distinct colours.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"35 - 57"},"PeriodicalIF":1.1,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45482655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-25DOI: 10.1080/17445760.2022.2113398
B. Pröll, W. Retschitzegger, W. Schwinger, T. Shmeleva, D. Zaitsev
Proof-of-work agreement protocol, offered by Keller and Böhme, is analysed by coloured Petri nets and refined. Blockchain technology, based on proof-of-work procedure and Nakomoto consensus negotiations, represents fundamentals of many kinds of cryptocurrency widespread recently. The protocol, called , works in continuous time which is simulated using random exponential distribution function of CPN Tools system, obtained values rounded to map them into discrete time of a coloured Petri net. Hierarchical model consists of an environment subnet and a given number of nodes communicating via an unstructured network represented by a single place; the model of node is further structured based on event handlers of the protocol source specification such as initialisation, activation, message delivering, and termination condition check. Based on the simulation results, modifications of the protocol and its parameters are recommended which improve some imperfections of the protocol. GRAPHICAL ABSTRACT
{"title":"Modelling proof-of-work agreement protocol by coloured Petri nets","authors":"B. Pröll, W. Retschitzegger, W. Schwinger, T. Shmeleva, D. Zaitsev","doi":"10.1080/17445760.2022.2113398","DOIUrl":"https://doi.org/10.1080/17445760.2022.2113398","url":null,"abstract":"Proof-of-work agreement protocol, offered by Keller and Böhme, is analysed by coloured Petri nets and refined. Blockchain technology, based on proof-of-work procedure and Nakomoto consensus negotiations, represents fundamentals of many kinds of cryptocurrency widespread recently. The protocol, called , works in continuous time which is simulated using random exponential distribution function of CPN Tools system, obtained values rounded to map them into discrete time of a coloured Petri net. Hierarchical model consists of an environment subnet and a given number of nodes communicating via an unstructured network represented by a single place; the model of node is further structured based on event handlers of the protocol source specification such as initialisation, activation, message delivering, and termination condition check. Based on the simulation results, modifications of the protocol and its parameters are recommended which improve some imperfections of the protocol. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"597 - 612"},"PeriodicalIF":1.1,"publicationDate":"2022-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47565115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：