Model Of Distributed Computation Research Articles

An Enhanced Lightweight Security Gateway Protocol for the Edge Layer

With the rapid expansion of the Internet of Things (IoT), the necessity for lightweight communication is also increasing due to the constrained capabilities of IoT devices. This paper presents the design of a novel lightweight protocol called the Enhanced Lightweight Security Gateway Protocol (ELSGP) based on a distributed computation model of the IoT layer. This model introduces a new type of node called a sub-server to assist edge layer servers and IoT devices with computational tasks and act as a primary gateway for dependent IoT nodes. This paper then introduces six features of ELSGP with developed algorithms that include access token distribution and validation, authentication and dynamic interoperability, attribute-based access control, traffic filtering, secure tunneling, and dynamic load distribution and balancing. Considering the variability of system requirements, ELSGP also outlines how to adopt a system-defined policy framework. For fault resiliency, this paper also presents fault mitigation mechanisms, especially Trust and Priority Impact Relation for Byzantine, Cascading, and Transient faults. A simulation study was carried out to validate the protocol’s performance. Based on the findings from the performance evaluation, further analysis of the protocol and future research directions are outlined.

Real-time Distributed Computing Model of Low-Voltage Flow Data in Digital Power Grid under Autonomous and Controllable Environments

Motivated by the progress in artificial intelligence and edge computing, this paper proposes a real-time distributed computing model for low-voltage flow data in digital power grids under autonomous and controllable environments. The model utilizes edge computing through wireless offloading to efficiently process and analyze data generated by low-voltage devices in the power grid. Firstly, we evaluate the performance of the system under consideration by measuring its outage probability, utilizing both the received signal-to-noise ratio (SNR) and communication and computing latency. Subsequently, we analyze the system’s outage probability by deriving an analytical expression. To this end, we utilize the Gauss-Chebyshev approximation to provide an approximate closed-form expression. The results of our experimental evaluation demonstrate the effectiveness of the proposed model in achieving real-time processing of low-voltage flow data in digital power grids. Our model provides an efficient and practical solution for the processing of low-voltage flow data, making it a valuable contribution to the field of digital power grids.

Developing a system for diagnosing diabetes mellitus using bigdata

Diabetes is among the socially significant diseases, which leads to high costs for the diagnosis and treatment of diabetes. Diagnosis and treatment of diabetes is currently one of the important tasks in medicine at the present stage of development of medical services. An important direction in the development of medical services for the population is the development and implementation of various problem-oriented information systems. Similar systems developed earlier did not cover the entire amount of heterogeneous information that is collected when diagnosing and prescribing the course of diabetes treatment, nor did they use technologies and cloud services as tools for Big Data. In this article, let’s make use of the predictive analytic to forecast and categorize the type of diabetes which offers an effective method for treating and curing patients at a reduced cost, with improved results such as affordability and availability. An information system platform has been developed and configured to manage the Hadoop cluster, as well as a non-relational database that uses and processes unstructured data in various formats. All experimental research, development of methods and algorithms, as well as solving computational problems were implemented using software languages for application development. The novelty lies in the research of distributed computing models that provide efficient execution of developed algorithms using the conceptual model of the processes of search, extraction and analysis of unstructured data in large data sets. The practical implementation of algorithms was carried out on the basis of methods of object-oriented programming and object-oriented databases

On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem

A knot in a directed graph G is a strongly connected subgraph Q of G with size at least two, such that no vertex in V(Q) is an in-neighbor of a vertex in V(G)∖V(Q). Knots are important graph structures in Computer Science because they characterize the existence of deadlocks in a classical distributed computation model, the so-called OR-model. Given a directed graph G, and a positive integer k, the Knot-Free Vertex Deletion (KFVD) problem consists of determining whether G has a subset S⊆V(G) with size at most k such that G[V∖S] contains no knot. KFVD is an NP-complete graph problem with natural applications in deadlock resolution. In this paper, we present a parameterized complexity analysis of KFVD. We prove that: KFVD is W[1]-hard when parameterized by the size of the solution; it can be solved in 2klog⁡φ⋅nO(1) time, but assuming SETH, it cannot be solved in (2−ϵ)klog⁡φ⋅nO(1) time, where φ is the size of the largest strongly connected subgraph of G; it can be solved in 2ϕ⋅nO(1) time, but assuming ETH, it cannot be solved in 2o(ϕ)⋅nO(1) time, where ϕ is the number of vertices with out-degree at most k; it can be solved in 2O(twlog⁡tw)⋅nO(1) time, but assuming ETH it cannot be solved in 2o(tw)⋅nO(1) time, where tw is the treewidth of the underlying undirected graph; and, it can be solved in FPT time when parameterized by the clique-width of the directed graph. In addition, lower bounds for kernelization are also provided.

Event camera simulator design for modeling attention-based inference architectures

In recent years, there has been a growing interest in realizing methodologies to integrate more and more computation at the level of the image sensor. The rising trend has seen an increased research interest in developing novel event cameras that can facilitate CNN computation directly in the sensor. However, event-based cameras ca be expensive, limiting performance exploration on high-level models and algorithms. This paper presents an event camera simulator that can be a potent tool for hardware design prototyping, parameter optimization, attention-based innovative algorithm development, and benchmarking. The proposed simulator implements a distributed computation model to identify relevant regions in an image frame. Our simulator’s relevance computation model is realized as a collection of modules and performs computations in parallel. The distributed computation model is configurable, making it highly useful for design space exploration. The Rendering engine of the simulator samples frame-regions only when there is a new event. The simulator closely emulates an image processing pipeline similar to that of physical cameras. Our experimental results show that the simulator can effectively emulate event vision with low overheads

Bargaining Game Based Offloading Service Algorithm for Edge-Assisted Distributed Computing Model

Bargaining Game Based Offloading Service Algorithm for Edge-Assisted Distributed Computing Model

A survey on the scope of cloud computing

Distributed computing is an accelerated innovation that has resulted in major transformations and opportunities in India in different fields. This is an inevitable approximation of how to change the knowledge system and management that is increasingly interested in the use of distributed computing in the field of training. This study seeks to survey an applied distributed model of computation between the academic network and the society for a composite effort. This paper presents distributed electronic computing, with points: its functions, its organisational structure, its goals and its problems. This document represents an intelligent evaluation of the work of distributed computer processing in the field of advice for working companies. The requisite evaluation was finished with the key partners of the specific preparation systems, which are performed for informative use. The course was conducted through the use of distributed computing and the right subjective approach in the exam classroom. Approximately 8 evaluation tasks were perceived following a thorough examination of open writing and addressed the significance of cloud in the school environment and the ease of significant usage. The examination considers and evaluates that the main accomplices in planning should be used. The comprehensive research indicates that familiarization with board preparation is practical in order to make the desirable circumstances clearer.

Distributed Computing Model Based on Three-layer B/S Mode

Distributed Computing Model Based on Three-layer B/S Mode

A Survey on the Scope of Cloud Computing

Distributed computing is an accelerated innovation that has resulted in major transformations and opportunities in India in different fields. This is an inevitable approximation of how to change the knowledge system and management that is increasingly interested in the use of distributed computing in the field of training. This study seeks to survey an applied distributed model of computation between the academic network and the society for a composite effort. This paper presents distributed electronic computing, with points: its functions, its organizational structure, its goals and its problems. This document represents an intelligent evaluation of the work of distributed computer processing in the field of advice for working companies. The requisite evaluation was finished with the key partners of the specific preparation systems, which are performed for informative use. The course was conducted through the use of distributed computing and the right subjective approach in the exam classroom. Approximately 8 evaluation tasks were perceived following a thorough examination of open writing and addressed the significance of cloud in the school environment and the ease of significant usage. The examination considers and evaluates that the main accomplices in planning should be used. The comprehensive research indicates that familiarization with board preparation is practical in order to make the desirable circumstances clearer.

A Heterogeneous Distributed Computing Model Based on Web Service

Based on the in-depth study of the existing database synchronization model, in order to improve the cross platform ability of the system and facilitate the construction of small and medium-sized enterprise information platform, this paper proposes a heterogeneous distributed computing scheme based on Web service. The scheme uses JMS to realize the message transmission between systems, and uses web service technology to realize cross platform data reading and writing. In the aspect of distributed transaction processing, the two-phase commit protocol is improved to reduce the probability of system deadlock and effectively ensure the consistency of distributed database data. In order to improve the performance of distributed database system, cache technology is introduced, and the way of integrating cache and database transaction processing is proposed, which effectively ensures the validity of cache data. The architecture is oriented to program developers, who can develop efficient and convenient distributed database system on the basis of this architecture. Finally, this architecture is applied to the background management system of mobile express service. The running results show that the architecture can well meet the business requirements of distributed heterogeneous database system synchronization.

Scalable distributed gate-model quantum computers

A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a computational problem in a distributed manner. We study the impacts of decoherence on distributed objective function evaluation.

Information technologies for the study of the planned and profile model of the flux creep in the transit channel

The article presents the inlet chamber computer models for the Beloyarskyin take structure: a computer model of the depth distribution and a computer model of the water level distribution for determining the hydrodynamic structure of the flux creep in the transit channel. To build a computer model, the depth survey of the inlet chamber was used during hydro meteorological surveys. The water level at the survey time is 15.30 m. The construction of a depth distribution computer model in the inlet chamber at the intake structure for the water supply of the Beloyarsky city was carried out by the finite element method on a personal computer in the Multiphysics software product. The uneven distribution of average velocities on the verticals, both along the channel width and length, is explained by the significant expansion of the inlet chamber in the intermediate sections 2-2, 3-3, 4-4, 5-5 in relation to the input 1-1 and output sections. Deepening the channel in the entrance section 1-1 by an average of 1.3-1.5 m will increase its flow rate to 10, 2m3/s or 10 times with an increase in the average speeds on the verticals by 2.0-2.5 times. Such an increase in the flow rate in the input section will lead to an increase in the average speeds in other sections 2-2, 3-3, etc. Hence, the passage of increased flow through the transit channel after clearing a number of shallow areas will create better conditions for preventing algae spread.

Computer modeling of distribution of dispersed particles by the cross-section of cylindrical dispersion-strengthened metal materials

The article presents the process of creating a computer model for predicting the distribution of particles during centrifugal casting using the ANSYS FLUENT 16.0 software module. To predict the distribution of particles by volume in the world at the moment there are several mathematical models. Most of them are based on the steady state assumption: models describing the criteria for dropping particles by a growing crystallization front and models calculating critical particle absorption rates by growing dendritic crystals. Some models attempt to describe the dynamic state of the system or to determine the criterion for capturing non-metallic inclusions by the solidification front during centrifugal casting of metal. The process of creating the new model, its scheme and geometry are described. Its preprocessor takes into account such phenomena as two-phase flow, energy equation, lamellar flow, introduction of discrete phases (strengthening particles), melting/crystallization. The model considers account of interaction of two liquid phases: air and steel melt; interfacial interaction is described by the equation of surface tension. As the materials used, the authors used steel grade 12Kh18N10T as the base metal, carbides of tungsten, boron and yttrium oxide as input particles. During simulation, the physicochemical parameters of these substances were taken into account. The process of modeling the distribution of particles during centrifugal casting using the Skif-Ural computing cluster, included in the TOP-500 of the world’s most powerful computers, is presented. As a result of the simulation, in addition to graphical display, data arrays were obtained that describe the coordinates of each particle at each moment in time in increments of 0.00001 seconds, which allows us to predict the exact location of each particle at each moment of casting. The results of the work indicate that centrifugal casting technology with the introduction of dispersed particles during the casting process allows obtaining dispersion-strengthened metal materials with predicting the distribution of refractory particles.

Distributed PageRank Computation: An Improved Theoretical Study

PageRank is a classic measure that effectively evaluates the node importance in large graphs, and has been applied in numerous applications ranging from data mining, Web algorithms, recommendation systems, load balancing, search, and identifying connectivity structures. Computing PageRank for large graphs is challenging and this has motivated the studies of distributed algorithms to compute PageRank. Previously, little works have been spent on the distributed PageRank algorithms with provably desired complexity and accuracy. Given a graph with n nodes and if we model the distributed computation model as the well-known congested clique model, the state-of-the-art algorithm takes O(√logn) communication rounds to approximate the PageRank value of each node in G, with a probability at least 1−1/n. In this paper, we present improved distributed algorithms for computing PageRank. Particularly, our algorithm performs O(log log√n) rounds (a significant improvement compared with O(√logn) rounds) to approximate the PageRank values with a probability at least 1−1/n. Moreover, under a reasonable assumption, our algorithm also reduces the edge bandwidth (i.e., the maximum communication message size that can be exchanged through an edge during a communication round) by a O(logn) factor compared with the state-of-the-art algorithm. Finally, we show that our algorithm can be adapted to efficiently compute another variant of PageRank, i.e., the batch one-hop Personalized PageRanks, in O(log logn) communication rounds.

Construction and investigation of the computer model of distribution of the composition of products from equilibrium condensation telomomerization

Based on the mechanism of the course of polycondensation, we have built a scheme of reaction for the equilibrium condensation telomerization as a polycondensation process whose chain is disrupted by a monofunctional telogen chain. Given this scheme, we constructed the material balance equations for structural elements, which include an infinite number of terms. If a Flory principle about equal reactivity of terminal groups is fulfilled, the infinite sums represent geometric progressions with the same denominator. This makes it possible to collapse the process model into a closed system of four non-linear algebraic equations.Our research into properties of the model that involved mathematical analysis and computer experiments has established the following:– the distribution of telomerization products is a superposition of geometric distributions of base structural components with the same denominator of progression, but different magnitudes of starting concentrations. A Flory distribution for homopolycondensation can be considered as a special case of this distribution;– the system of model's equations can have up to 4 real roots. At a single solution to the system with a random selection of initial approximation, ~74 % of cases yield a false positive root. To verify the validity of the root, we have developed a criterion based on the magnitude of denominator in a converging geometric progression, and proposed a procedure of computer solution to the system, making it possible to find the true root;– the model has been found to demonstrate regularities in the influence of reactants concentration on the composition of an equilibrium mixture at a constant concentration of the low-molecular by-side product of condensation. It is shown that when this concentration tends to zero the composition ceases to depend on the values for equilibrium constants.The constructed model makes it possible to calculate a composition of the equilibrium mixture of oligomers depending on the ratio of monomer concentrations, telogen, and a low-molecular condensation product. That makes it useful in practice for preliminary quantifying the composition of equilibrium mixtures of oligomers when planning syntheses using a method of condensation telomerization

Evaluation of worker quality in crowdsourcing system on Hadoop platform

Crowdsourcing is a new emerging distributed computing and problem solving production model on the backdrop of internet. The data size of crowdsources and tasks grows rapidly due to the rapid development of the crowdsourcing system. To evaluate the worker quality, based on the big data technology has become a more complex challenge. In this paper, we propose a general worker quality evaluation algorithm which can be applied to any critical tasks without wasting resources. Realising the evaluation algorithm in the Hadoop platform using MapReduce parallel programming is also involved. Efficiency and accuracy of the algorithm is effectively verified in the wide variety of many big data scenarios.

Electronic structure and effective charges on atoms near anion point defects in uranium dioxide

The computer modeling of electronic structure and electron density distribution in the large fragments of crystal lattices of uranium dioxide was carried out using Molecular Dynamics and ab initio Relativistic Discrete Variational method (RDV). The five types of clusters with oxygen vacancy and metal and oxygen atoms in the center were considered. At the first step of simulation, the geometry of clusters corresponded to the regular crystals, and at the second step, the distorted structures around one oxygen vacancy and one oxygen interstitial point defects were considered. In each case, the transformation of electronic states and chemical bonding were investigated, as well the estimation of effective charges on atoms of several coordination spheres around defects was performed. For the calculations of atomic charges we used the original procedure based on spatial integration of electron density. Unlike previous simulations ignoring point symmetry of isolated defects, our model included the charge transfer between defects and all nearest and next nearest neighbors. Our study showed that the transfer of electron density between atoms around defects is more complex than that predicted in previous calculations using ab initio and pair-potential models.

An efficient algorithm for skyline queries in cloud computing environments

Skyline query processing has recently received a lot of attention in database and data mining communities. However, most existing algorithms consider how to efficiently process skyline queries from base tables. Obviously, when the data size and the number of skyline queries increase, the time cost of skyline queries will increase exponentially, which will seriously influence the query efficiency. Motivated by the above, in this paper, we consider improving the query efficiency via skyline views and propose a cost-based algorithm (abbr. CA) to efficiently select the optimal set of skyline views for storage. The CA algorithm mainly includes two phases: (i) reduce the skyline views selection to the minimum steiner tree problem and obtain the approximate optimal set AOS of skyline views, and (ii) adjust AOS and produce the final optimal set FOS of skyline views based on the simulated annealing. Moreover, in order to improve the extendibility of the CA algorithm, we implement it based on the map/reduce distributed computation model in cloud computing environments. The detailed theoretical analyses and extensive experiments demonstrate that the CA algorithm is both efficient and effective.

Computer Modeling of Depth Distribution of Vacancy Nanoclusters in Ion-Irradiated Materials

In this work, the calculation algorithms of cascade and probability functions and vacancy nanoclusters concentration were developed and their calculations for various incident particles in silicon and iron were made.

A programming model and foundation for lineage-based distributed computation

AbstractThe most successful systems for “big data” processing have all adopted functional APIs. We present a new programming model, we callfunction passing, designed to provide a more principled substrate, or middleware, upon which to build data-centric distributed systems like Spark. A key idea is to build up a persistent functional data structure representing transformations on distributed immutable data by passing well-typed serializable functions over the wire and applying them to this distributed data. Thus, the function passing model can be thought of as a persistent functional data structure that isdistributed, where transformations performed on distributed data are stored in its nodes rather than the distributed data itself. One advantage of this model is that failure recovery is simplified by design – data can be recovered by replaying function applications atop immutable data loaded from stable storage. Deferred evaluation is also central to our model; by incorporating deferred evaluation into our design only at the point of initiating network communication, the function passing model remains easy to reason about while remaining efficient in time and memory. Moreover, we provide a complete formalization of the programming model in order to study the foundations of lineage-based distributed computation. In particular, we develop a theory of safe, mobile lineages based on a subject reduction theorem for a typed core language. Furthermore, we formalize a progress theorem that guarantees the finite materialization of remote, lineage-based data. Thus, the formal model may serve as a basis for further developments of the theory of data-centric distributed programming, including aspects such as fault tolerance. We provide an open-source implementation of our model in and for the Scala programming language, along with a case study of several example frameworks and end-user programs written atop this model.