International Journal of Parallel Emergent and Distributed Systems最新文献

{"title":"Fault tolerant synchronisation of integer and fractional order 6D hyper-chaotic systems via two control signals","authors":"A. Sabaghian, S. Balochian","doi":"10.1080/17445760.2021.1991923","DOIUrl":"https://doi.org/10.1080/17445760.2021.1991923","url":null,"abstract":"In this study, two 6D hyper-chaotic systems with integer and fractional orders in the presence of external disturbance and bounded parametric uncertainty with unknown bounds with two control signals are synchronised using an adaptive-sliding mode controller. In the definition of fractional order differentiation, Riemann-Louiville definition is used. To this end, the sliding surface and proper active feedback control law area determined and proper estimation laws are proposed for estimating unknown uncertainty bounds and the disturbance. The stability of the closed-loop control system is proved using the Lyapunov theorem. Simulation results in MATLAB demonstrate the desired efficiency of this method in the presence of disturbance and parametric uncertainty.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"152 - 166"},"PeriodicalIF":1.1,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45546052","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}

{"title":"What can we learn from universal Turing machines?","authors":"M. Margenstern","doi":"10.1080/17445760.2021.2001468","DOIUrl":"https://doi.org/10.1080/17445760.2021.2001468","url":null,"abstract":"In the present paper, we construct what we call a pedagogical universal Turing machine. We try to understand which comparisons with biological phenomena can be deduced from its encoding and from its working.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"123 - 151"},"PeriodicalIF":1.1,"publicationDate":"2021-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46831642","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}

{"title":"Study of Task Scheduling Strategy based on Trustworthiness","authors":"Jun Qin, Yanyan Song, Ping Zong","doi":"10.5121/ijdps.2021.12501","DOIUrl":"https://doi.org/10.5121/ijdps.2021.12501","url":null,"abstract":"MapReduce is a distributed computing model for cloud computing to process massive data. It simplifies the writing of distributed parallel programs. For the fault-tolerant technology in the MapReduce programming model, tasks may be allocated to nodes with low reliability. It causes the task to be reexecuted, wasting time and resources. This paper proposes a reliability task scheduling strategy with a failure recovery mechanism, evaluates the trustworthiness of resource nodes in the cloud environment and builds a trustworthiness model. By using the simulation platform CloudSim, the stability of the task scheduling algorithm and scheduling model are verified in this paper.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"15 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80391807","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}

{"title":"Trust in the Adoption of Internet of Things for Smart Agriculture in Developing Countries","authors":"Tsitsi Zengeya, P. Sambo, N. Mabika","doi":"10.5121/ijdps.2021.12502","DOIUrl":"https://doi.org/10.5121/ijdps.2021.12502","url":null,"abstract":"Trust in online environments is based on beliefs in the trustworthiness of a trustee, which is composed of three distinct dimensions - integrity, ability, and benevolence. Zimbabwe has slowly adopted Internet of Things for smart agriculture as a way of improving on food security in the country, though there is hesitancy by most farmers citing trust issues as monitoring of crops, animals and farm equipment’s would be done online through connecting several devices and accessing data. Farmers are facing difficulties in trusting that the said technology has the ability to perform as expected in a specific situation or to complete a required task, i.e. if the technology will work consistently and reliably in monitoring the environment, nutrients, temperatures and equipment status. The integrity of the collected data as it will be used for decision making. There is a growing need to determine how trust in the technology influence the adoption of IoT for smart agriculture in Zimbabwe. The mixed methodology was used to gather data from 50 A2 model farmers randomly sampled in Zimbabwe. The findings revealed that McKnight etal. trust in technology model can be used to influence the adoption of IoT through trusting that the technology will be reliable and will operate as expected.Additional constructs such as security and distrust of technology can be used as reference for future research.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"100 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83338825","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}

{"title":"Preface for special issue Petri/Sleptsov net based technology of programming for parallel, emergent and distributed systems","authors":"D. Zaitsev, D. Probert","doi":"10.1080/17445760.2021.1970158","DOIUrl":"https://doi.org/10.1080/17445760.2021.1970158","url":null,"abstract":"Schemata for concurrent processes sharing some resources first appeared for manufacture processes in works of family research duet Frank and Lillian Gilbreth in 1921. Flow chart standard, developed in 1947 by Herman Goldstine and John von Neumann, did not contain blocks for parallel processing of information. Program schemata, including concurrent programs, was developed in Novosibirsk, Russia, during 1950–1960 that includes program schemes of Yanov, Martiniuk, Ershov, and Lavrov for formal proof of (concurrent) program correctness andmaximising their efficiency. Place-transition nets, which were introduced in doctoral dissertation of Carl Petri in 1962 represent, in essence, a unification of the mentioned approaches having only two types of nodes in a directed bipartite graph; a crucial amendment of Carl Petri was the introduction of a dynamical process on the graphwith tokens situated inside places which were produced and consumed as a result of transitions firing. An attractionof Petri netswas apossibility of applying formal techniquesof analysis developed in 1970–1980by Hack, Molloy, TadaoMurata and others. Nets were widely applied for modelling concurrent programs, manufacturing and transportation systems etc. Concurrent programming languages appeared which were loading elements of Petri net graph by constructs of convectional programming languages. According to the Carl Petri firing rule, a single transition fires at a step chosen in nondeterminiatic way among the set of firable transitions. It was a brilliant abstraction to study behaviour of concurrent systems with regard to ALL permitted possibilities that was especially useful for verification of communication protocols. Concurrent (parallel) programming gains speed-up at the expense of doing a few actions simultaneously that becomes the basic motivation of introducing in 1990 the Anjey Salvitsky firing rule published in works of Hans-Dieter Burkhard. It was also called the maximal firing strategy and transformed the net into a Turing-complete system. In 1976, Tilak Agerwala proved Turing-completeness of inhibitor Petri nets which contain a special inhibitor arc to check whether a place marking is zero. After constructing a series of universal Petri nets in an explicit form by Dmitry Zaitsev in 2010–2020, including minimal ones containing about forty vertices, it became clear that a Petri net runs exponentially slower than a Turing machine because of incremental way of computing arithmetic functions (similar to recursive functions of Kleene and Minsky counter automata). Anatoly Sleptsov, an outstanding Ukrainian scientist in computer science, a PhD supervisor of Dmitry Zaitsev during 1988–1991, hinted to Dmitry Zaitsev an idea of firing a transition in a few instances at the same time. The corresponding theoryof timedPetri netswithmultichannel transitions, including state equation and algebraic equivalent transformations, was developed in Dmitry Zaitsev doctoral dissertation and applied","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"495 - 497"},"PeriodicalIF":1.1,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42386652","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}

{"title":"Study and evaluation of automatic GPU offloading method from various language applications","authors":"Y. Yamato","doi":"10.1080/17445760.2021.1971666","DOIUrl":"https://doi.org/10.1080/17445760.2021.1971666","url":null,"abstract":"ABSTRACT Heterogeneous hardware other than a small-core central processing unit (CPU) is increasingly being used, such as a graphics processing unit (GPU), field-programmable gate array (FPGA) or many-core CPU. However, to use heterogeneous hardware, programmers must have sufficient technical skills to utilise OpenMP, CUDA, and OpenCL. On the basis of this, we previously proposed environment-adaptive software that enables automatic conversion, configuration, and high performance operation of once-written code, in accordance with the hardware to be placed. However, the source language for offloading was mainly C/C++ language applications, and there was no research into common offloading for various language applications. In this paper, for a new challenge, we study a common method for automatically offloading various language applications in not only C language but also Python and Java. We evaluate the effectiveness of the proposed method in multiple applications of various languages. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"22 - 39"},"PeriodicalIF":1.1,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45293595","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}

{"title":"Survey on the benefits of using memristors for PUFs","authors":"Muayad J. Aljafar, J. Acken","doi":"10.1080/17445760.2021.1972295","DOIUrl":"https://doi.org/10.1080/17445760.2021.1972295","url":null,"abstract":"This paper reviews memristive PUFs (Physical Unclonable Functions) reported in the literature. The paper explains the motivation for using memristor technology for implementing PUFs. It focuses on PUFs’ applications, sizes, analysis, and physical variations. In addition, the paper presents the number of samples generated using Monte Carlo simulation for evaluating the PUF circuits. This paper also describes the protocols, functionality, and methodologies proposed in the memristive PUF literature. Although memristive PUFs are not commercialized yet, there is a high expectation of exploiting the memristors as fundamental elements in the next generation of hardware security primitives (e.g. PUF) due to their unique characteristics such as forming process, temporal drift, nonlinearity, bidirectionality, nonvolatility and model complexity. There have been some survey papers on memristor PUFs in the past, however, the field has continued to develop so a comprehensive survey including recent publications seemed in order at this time. Lately, memristor technology improvement has accelerated, therefore creating a need for an updated survey of the applications of memristors for PUFs. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"40 - 67"},"PeriodicalIF":1.1,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45220575","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}

{"title":"Thermal and energy-aware utilisation management on MPSoC architectures","authors":"Dulana Rupanetti, Hassan A. Salamy","doi":"10.1080/17445760.2021.1941008","DOIUrl":"https://doi.org/10.1080/17445760.2021.1941008","url":null,"abstract":"High operating temperatures have been a major problem in embedded systems due to high throughput and compact designs required by modern applications. This paper introduces a novel strategy to subdue these high peak temperatures of MPSoC systems by incorporating task migration and task swapping, to eliminate hot spots and thermal gradients. The work further confirms that the proposed techniques help mitigate power consumption while maintaining a high throughput to satisfy the deadline requirements of the tasks in the system. A heuristic approach is presented that helps mitigate the hot spots and gradients specifically formed from the high-frequency execution of high-priority tasks. In addition, energy-aware task migration reduced the energy consumption in the system. Extensive experimental testing on actual hardware and simulation showed very plausible results to confirm the capability of the presented techniques to reduce peak temperatures along with reduced energy consumption in the system. The presented techniques performed better than many other standard and state-of-the-art published approaches in the literature. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"449 - 469"},"PeriodicalIF":1.1,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17445760.2021.1941008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48563759","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}

{"title":"Algorithm for identifying clients based on dynamic MAC addresses in narrowly targeted secure networks using deep learning neural networks","authors":"A. Tyutyunnik, E. Lobaneva, A. Lazarev","doi":"10.1080/17445760.2021.1941007","DOIUrl":"https://doi.org/10.1080/17445760.2021.1941007","url":null,"abstract":"Existing algorithms for identifying clients on a network segment are based on static client binding by MAC address. MAC address generation is based on pseudo-random sequences of 0–256 characters. With this feature in mind, software was developed based on an algorithm for generating MAC addresses using bidirectional neural networks, followed by integration of a decision support system module. A secondary feature of the developed software is the ability to set a MAC validity timeout, which will limit access to the network segment and increase the security factor.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"470 - 481"},"PeriodicalIF":1.1,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17445760.2021.1941007","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43281639","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}

{"title":"Star structure connectivities of pancake graphs and burnt pancake graphs","authors":"Subinur Dilixiati, Eminjan Sabir, J. Meng","doi":"10.1080/17445760.2021.1941006","DOIUrl":"https://doi.org/10.1080/17445760.2021.1941006","url":null,"abstract":"Let H be a connected subgraph of a graph G. The H-structure connectivity of G is the cardinality of a minimum set of subgraphs in G, whose deletion disconnects G and every element in the set is isomorphic to H. Similarly, the H-substructure connectivity of G is the cardinality of a minimum set of subgraphs in G, whose deletion disconnects G and every element in the set is isomorphic to a connected subgraph of H. Structure connectivity and substructure connectivity generalise the classic connectivity. Let and be the n-dimensional pancake graph and n-dimensional burnt pancake graph, respectively. In this paper we show , and .","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"440 - 448"},"PeriodicalIF":1.1,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17445760.2021.1941006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49082386","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}