Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
A Tutorial And Future Research For Building A Blockchain-Based Secure Communication Scheme For Internet Of Intelligent Things, Mohammad Wazid, Ashok Kumar Das, Sachin Shetty, Minho Jo
A Tutorial And Future Research For Building A Blockchain-Based Secure Communication Scheme For Internet Of Intelligent Things, Mohammad Wazid, Ashok Kumar Das, Sachin Shetty, Minho Jo
Computational Modeling & Simulation Engineering Faculty Publications
The Internet of Intelligent Things (IoIT) communication environment can be utilized in various types of applications (for example, intelligent battlefields, smart healthcare systems, the industrial internet, home automation, and many more). Communications that happen in such environments can have different types of security and privacy issues, which can be resolved through the utilization of blockchain. In this paper, we propose a tutorial that aims in desiging a generalized blockchain-based secure authentication key management scheme for the IoIT environment. Moreover, some issues with using blockchain for a communication environment are discussed as future research directions. The details of different types of …
Implementing Asynchronous Linear Solvers Using Non-Uniform Distributions, Erik Jensen, Evan C. Coleman, Masha Sosonkina
Implementing Asynchronous Linear Solvers Using Non-Uniform Distributions, Erik Jensen, Evan C. Coleman, Masha Sosonkina
Computational Modeling & Simulation Engineering Faculty Publications
Asynchronous iterative methods present a mechanism to improve the performance of algorithms for highly parallel computational platforms by removing the overhead associated with synchronization among computing elements. This paper considers a class of asynchronous iterative linear system solvers that employ randomization to determine the component update orders, specifically focusing on the effects of drawing the order from non-uniform distributions. Results from shared-memory experiments with a two-dimensional finite-difference discrete Laplacian problem show that using distributions favoring the selection of components with a larger contribution to the residual may lead to faster convergence than selecting uniformly. Multiple implementations of the randomized asynchronous …