the fuzzy joint points (FJP) is a method that uses a fuzzy neighborhood notion to deal with neighborhood parameter selection issue of classical density-based clustering and offers an unsupervised clustering tool. Rece...
详细信息
ISBN:
(纸本)9781509018413
the fuzzy joint points (FJP) is a method that uses a fuzzy neighborhood notion to deal with neighborhood parameter selection issue of classical density-based clustering and offers an unsupervised clustering tool. Recent works improved the method in terms of speed to enable the method for big data applications. However, space efficiency of the method is still a limiting factor. In this work, we discuss techniques to improve the space efficiency of the method, so that FJP is applicable regardless of the size of data and offer a distributed version of the algorithm.
In recent years, the technological advancements have led to a deluge of data from distinctive domains and the need for development of solutions based on parallel and distributedcomputing has still long way to go. tha...
详细信息
ISBN:
(纸本)9789811015366;9789811015359
In recent years, the technological advancements have led to a deluge of data from distinctive domains and the need for development of solutions based on parallel and distributedcomputing has still long way to go. that is why, the research and development of massive computing frameworks is continuously growing. At this particular stage, highlighting a potential research area along with key insights could be an asset for researchers in the field. therefore, this paper explores one of the emerging distributedcomputing frameworks, Apache Hama. It is a Top Level Project under the Apache Software Foundation, based on bulk synchronous parallel model. We present an unbiased and critical interrogation session about Apache Hama and conclude research directions in order to assist interested researchers.
One of the applications of wireless sensor networks is target tracking. there are several methods to target tracking and among these methods, particle filter has high capability in solving nonlinear/non-Gaussian syste...
详细信息
ISBN:
(纸本)9781509018413
One of the applications of wireless sensor networks is target tracking. there are several methods to target tracking and among these methods, particle filter has high capability in solving nonlinear/non-Gaussian systems. Particle filter is one of the methods for Bayesian recursive estimation for position estimation in wireless sensor networks. Clustered management of dense networks is a famous known method and has many benefits in comparison with other management schemes of sensor nodes. In this paper we designed a new distributed version of particle filtering which is more compatible with dynamic clustering of nodes. Our method decrease the processing overhead of sensor nodes and output results are more accurate than current distributed versions of particle filtering in target tracking applications.
Scientific problems, related to the interaction between IT-services suppliers and consumers in the cloud environments, has been described. the analysis of quality metrics, used for IT-services estimation, has been car...
详细信息
ISBN:
(纸本)9781509018413
Scientific problems, related to the interaction between IT-services suppliers and consumers in the cloud environments, has been described. the analysis of quality metrics, used for IT-services estimation, has been carried out taking into account the specificity of the cloud infrastructure that focuses on large-scale scientific problems solving. the technique, used for the visual express quality estimation of IT-services, has been proposed. the method of parallel coordinates has been used for multidimensional data visualization. the proposed technique can be used as an effective instrument for visual analysis of cloud services functioning (the dynamics of their quality indicators is considered).
there is a strong relationship between scientific research and technology advancement. the former generally focuses on studying phenomena happening in the real world, the latter improves tools that are at the basis of...
详细信息
ISBN:
(纸本)9781509009879
there is a strong relationship between scientific research and technology advancement. the former generally focuses on studying phenomena happening in the real world, the latter improves tools that are at the basis of this research. From this perspective, information and communication technologies allow the implementation of ever faster tools for analyzing data generated by experiments. the aim of DemoGRAPE project is to study the interaction of the upper earth atmosphere and the GNSS ( Global Navigation Satellite Systems) signals received at ground, in critical environments such as the polar regions. this paper describes the ICT infrastructure used to manage the software applications used to analyzed data collected during project experimental campaigns, taking into account the following constraints: (i) the intellectual property of the applications must be protected;(ii) the underlying infrastructure resembles a cloud-federation;(iii) data are over-sized;(iv) provide a unified vision of the available resources to the user (i.e., what are the available applications, and where experimental data reside). Leveraging on a lightweight virtualization system, we proposed a management system that copes with all these four constraints. A case study is used to show the process of deploying an application through the proposed system on a specific node where data of interest reside.
Now we have the need for methodics of teaching the topic "parallelcomputing" in secondary school. the paper presents a three-year experience of the author in this field: a methodical approach, the selection...
详细信息
Now we have the need for methodics of teaching the topic "parallelcomputing" in secondary school. the paper presents a three-year experience of the author in this field: a methodical approach, the selection of materials, the business games, experience of tasks on parallelcomputing at the contest "TRIZformashka", classes of tasks, examples of tasks, program executors, texts for propaedeutic textbook on informatics.
Graph partitioning is used to solve the problem of distributing computations to a number of processors, in order to improve the performance of time consuming applications in parallel environments. A common approach to...
详细信息
ISBN:
(纸本)9781467387767
Graph partitioning is used to solve the problem of distributing computations to a number of processors, in order to improve the performance of time consuming applications in parallel environments. A common approach to solve this problem is based on a multilevel framework, where the graph is firstly coarsened to a smaller instance and then it is partitioned in a number of parts using recursive bisection (RB) based methods. However, in applications where initial fixed vertices are used to model additional constraints of the problem, RB based methods often fail to produce partitions of good quality. In this paper, we propose a new direct k-way greedy graph growing algorithm, called KGGGP, that overcomes this issue and succeeds to produce partition with better quality than RB while respecting the constraint of fixed vertices. In the experimental section, we present results which compare KGGGP against state-of-the-art methods for graphs available from the popular DIMACS'10 collection.
We developed parallel algorithm for solving Vlasov-Poisson systems of equations using particle-in-cell method. It uses new technique of dynamic load balancing for processors, which are distributed between subdomains i...
详细信息
We developed parallel algorithm for solving Vlasov-Poisson systems of equations using particle-in-cell method. It uses new technique of dynamic load balancing for processors, which are distributed between subdomains in correspndance withthe number of modeling particles located in the subdomain. Domain decomposition method combines grid (eulerian) method for solving Poisson equation with lagrangian paricle method for solving Vlasov equation. It takes into account physical features of the modeling nonstationary rotating disks (both 2D and 3D).
Resource allocation and the associated deadlock prevention problem originated in the design and the implementation of the operating systems, comprising distributedcomputing, parallelcomputing and grid computing. thi...
详细信息
ISBN:
(纸本)9781614996378;9781614996361
Resource allocation and the associated deadlock prevention problem originated in the design and the implementation of the operating systems, comprising distributedcomputing, parallelcomputing and grid computing. this paper presents an improving deadlock prevention algorithm used to schedule the policies of resource supply for resource allocation on heterogeneous distributed platform. In the current scenario, deadlock prevention algorithm using two way search method has created the problem of taking higher time complexity of O (root m) arc traversal as the edge (v,w) is added to the graph. this paper proposes the algorithms for allocating multiple resources to competing services running in virtual machines on a heterogeneous distributed platform. We have implemented and performed our algorithm proposed by using CloudSim simulator. the experiments results show that our algorithm can quickly prevent deadlock and then resolve the situation of approximately orders of magnitude in practical cases.
the approach to the parallel composition in element-by-element scheme of finite element method is offered. this approach consists of two phases: partition mesh with desired properties (localization uncoupled mesh data...
详细信息
the approach to the parallel composition in element-by-element scheme of finite element method is offered. this approach consists of two phases: partition mesh with desired properties (localization uncoupled mesh data) and assembly (summation) distributed vectors. thus, a regular access to the components of finite-element vectors is provided and the number of conflicts when accessing the memory subsystem is reduced. Subsets of uncoupled finite elements excluding a race condition withparallel summation of vectors in a unit element by element are formed by using the ratio of the adjacency. Several variants the compositions are considered.
暂无评论