المؤلفون: Feoktistov, Alexander, Kostromin, Roman, Sidorov, Ivan, Gorsky, Sergey, Oparin, Gennady

المصدر: Procedia Computer Science; 2019, Vol. 150, p171-178, 8p

مصطلحات موضوعية: HETEROGENEOUS distributed computing, ALGORITHMS, GRID computing

مستخلص: Nowadays, a provision of the computational process fault-tolerance in Grid is a relevant issue. In the paper, we address a fault-tolerance improvement in solving large-scale scientific and applied problems that are implemented through modular programming in heterogeneous distributed computing environments. We describe a computational process by an abstract program (problem-solving scheme) that correlates to a workflow. The problem-solving scheme specifies modules (applied software) and their relations with each other. This paper proposes a new multi-agent algorithm for re-allocating Grid-resources when the computational process fails. The algorithm execution involves forming a residual problem-solving scheme using methods of the abstract program specialization and reallocating its modules between agents that represent computational resources. In comparison to the known algorithms for the same purpose, the proposed algorithm implements an adaptive multi-scenario solving this issue and therefore increases a degree of computational process fault-tolerance. Extensive modeling and practical experiments demonstrate the practicability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Alexeev, V.A., Domashnev, P.V., Lavrukhina, T.V., Nazarkin, O.A.

المصدر: Procedia Computer Science; 2019, Vol. 150, p61-68, 8p

مصطلحات موضوعية: DISTRIBUTED computing, HIGH performance computing, GRID computing

مستخلص: Large-scale grid compute projects may use computational capabilities of web browser sessions on numerous client devices to run distributed data processing algorithms. WebSocket protocol is the basis of duplex communications between browser worker nodes. Publish/Subscribe pattern defines communication scheme for client-server messaging. The downside of WebSocket-based Publish/Subscribe implementations is the stateful nature of long-living network connections. This aspect makes WebSocket scaling and load balancing a challenging task. In present work, we state that the intelligent balancer needs to consider different behavior types of client connections. We propose the negotiation-like mechanism between client and the load balancing system about the target server to set the client on. Our construction principles of scalable multi-server infrastructure with effective inter-server communications intensively use Redis instances, because Redis is a mature, well-tested, high performance system, rich of functions. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Favorskaya, Alena, Golubev, Vasily, Khokhlov, Nikolay

المصدر: Procedia Computer Science; 2018, Vol. 126, p1082-1090, 9p

مصطلحات موضوعية: COMPUTATIONAL complexity, GRID computing, SEISMIC waves, GEOMETRIC modeling, KARST

مستخلص: Two approaches to the calculation of air subdomains are compared in this paper, i.e. the use of imaginary points and explicit allocation. They are completely mathematically equivalent to each other, but there is a difference in their complexity of implementation, complexity of parallelization and computational resources needed for performing calculations and their applications. The explicit allocation of air subdomains requires a lot of separated grids, the use of imaginary points requires more memory and calculation time. It is of interest to estimate how important the contribution of interfaces between the grids is. Usually, estimates of the memory and time costs are calculated based on the geometric characteristics of the model under consideration. In this paper, the corresponding formulas are presented for the case of full wave simulation of the impact of seismic waves on a multi-storey building. The question under consideration was whether theoretical estimates of this type are valid. In order to do this we consider 7 building types, i.e. an underground shelter, a barn, barracks, a summer cottage, a residential building of an old building type, a residential building of a new building type, and a skyscraper. We use a solid-state drive memory device. The results of the studies can also be extrapolated to the case of direct problems in geophysics to describe, for example, a geological medium containing gas-saturated pores or karst areas. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Gao, Tiancheng, Li, Aihua, Meng, Fan

المصدر: Procedia Computer Science; 2017, Vol. 122, p595-602, 8p

مصطلحات موضوعية: K-means clustering, DATA mining, FUZZY clustering technique, GRID computing, HIERARCHICAL clustering (Cluster analysis)

مستخلص: Based on traditional FCM clustering algorithm, this paper proposed the data stream clustering algorithm based on FCM. When dealing with data stream, inheriting the membership degree matrix can make traditional FCM more effective for data stream. The conclusion is that the result of data stream FCM is basically same as traditional FCM. But some points with similar distances from different centers of the clusters are easily misclassified. In computing time, data stream FCM is more sensitive to the number of parts the data divided. But it isn’t so sensitive to the number of data arrives per time. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Matsumoto, Ryota, Tokumitsu, Masahiro, Koshimizu, Hironao, Ishida, Yoshiteru

المصدر: Procedia Computer Science; 2017, Vol. 112, p2497-2505, 9p

مصطلحات موضوعية: LATTICE networks, GAME theory, COMPUTER networks, GRID computing, COMPUTER science

مستخلص: A number of studies have revealed and investigated how the clusters organized by cooperators emerge in a spatial prisoner’s dilemma. However, a qualitative analysis of the clusters formed by the cooperators has not yet been studied. This paper aims to propose a new technique for quantifying clusters that consist of players with cooperative strategies. The proposed method can be applied to the spatial prisoner’s dilemma in a square lattice network. In the proposed method, a minimum cluster is defined as a group of the cooperators based on a small square (2 by 2). This paper also defines a degree of the clusters by extending the small squares that based on how the players organize themselves into coordinated groups. The authors analyze and compare with typical examples of the clusters in the spatial prisoner’s dilemma. By analyzing the examples, this paper demonstrates that the proposed method quantifies the degree of the clusters organized by the cooperators. The authors also examine the significance of the proposed method by the simulations of the spatial prisoner’s dilemma. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Yamakawa, Masashi, Mitsunari, Naoya, Asao, Shinichi

المصدر: Procedia Computer Science; 2017, Vol. 108, p1883-1892, 10p

مصطلحات موضوعية: ROTORS -- Design & construction, FLUID flow, GRID computing, COMPUTER simulation, CONSERVATION laws (Mathematics)

مستخلص: To compute flows around objects with complicated motion like the intermeshing rotors, the unstructured moving grid finite volume method was developed. Computational elements are added and eliminated according to motion of rotors, to keep the computation domain around rotors which mutually reverse. Also, the geometric conservation law is satisfied in the method, using four dimensional space time unified domain for control volume. Using the method, accurate computation is carried out without interpolation of physical quantities. Applying to a flow around a sphere, computation procedure was established with introduction of concept of a hierarchical grid distinction. Then, the results of application to the flow around intermeshing rotors showed efficacy of the method. The results also showed applicability of the method to compute flows around any complicated motion. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Toporkov, Victor, Yemelyanov, Dmitry, Bobchenkov, Alexander

المصدر: Procedia Computer Science; 2017, Vol. 108, p1394-1403, 10p

مصطلحات موضوعية: PRODUCTION scheduling, GRID computing, VIRTUAL reality, RESOURCE management, DECISION making

مستخلص: In this paper, a heuristic user job-flow scheduling approach for Grid virtual organizations with non-dedicated resources is discussed. Users’ and resource providers’ preferences, virtual organization’s internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing resources utilization level the available resources set and corresponding decision space are reduced. This further complicates the task of efficient scheduling. In order to improve overall scheduling efficiency we propose a heuristic anticipation scheduling approach. Initially it generates a near optimal but infeasible scheduling solution which is then used as a reference for efficient resources allocation. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Tajiri, Kyohei, Nishida, Hidetoshi, Tanaka, Mitsuru

المصدر: Procedia Computer Science; 2017, Vol. 108, p1933-1942, 10p

مصطلحات موضوعية: GRID computing, COMPUTER simulation, COMPUTATIONAL fluid dynamics, BOUNDARY value problems, CARTESIAN coordinates

مستخلص: In the Cartesian grid approach, the immersed boundary method (IBM) is well used to handle the boundary of an object with complicated shape on the Cartesian grid. However, the conventional IBM generates the unphysical pressure oscillations near the boundary because of the pressure jump between inside and outside of the boundary. The IBM considering pressure condition was proposed in order to remove the pressure oscillations by solving the governing equations considering the pressure condition on the boundary. In this method, there are two ways of the handling the pressure on the boundary in the Poisson solver. In this paper, the effect of removing the pressure oscillations by the IBM considering the pressure condition is investigated. And, the influence by the difference in the handling of the pressure on the boundary in the Poisson solver is investigated. In the numerical simulations of incompressible flow around a 2D circular cylinder, the present IBM indicates a greate effect of removing the pressure oscillations. And, it does not occur difference of the result by the difference of the handling the pressure on the boundary in the Poisson solver. Therefore, it is possible to select a method with less computational amount in the Poisson solver without degrading the quality of the result. It is concluded that the present IBM is very promising as improved method in order to remove the pressure oscillations in the conventional IBM. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Chillarón, Mónica, Vidal, Vicente, Segrelles, Damián, Blanquer, Ignacio, Verdú, Gumersindo

المصدر: Procedia Computer Science; 2017, Vol. 108, p1195-1204, 10p

مصطلحات موضوعية: CANCER diagnosis, GRID computing, IMAGE reconstruction, CANCER tomography, SOFTWARE libraries (Computer programming), COMPUTERS in medicine

مستخلص: Computed tomography (CT) is one of the most widely used methods in Medical Imaging. Despite of its relevance in the diagnosis of diseases with a high impact in our society (such as cancer), it is one of the most potentially harmful modalities. CT requires a high X-ray dose to be induced to the patients. Solving the CT Image Reconstruction problem iteratively in order to approximate the solution allows working with only a subset of the input data required by direct methods. This directly implies a reduction of the radiation received by the patient and a strong reduction on the potential morbidity. Therefore, we aim to study the feasibility of such methods for their actual application, with the purpose of concluding if they are accurate and can obtain good quality images with a lower dose of X rays. This paper discusses the use of containers within a Grid Computing platform to perform a thorough study of all the possible configurations and parameters of various methods being developed to reconstruct CT images iteratively, which could lead to find the optimal configuration of the parameters. The work compares two approaches for managing the software dependencies of the code: store the software libraries on a Storage Element and using containers for executing the job. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

المؤلفون: Braun, Peter, Cuzzocrea, Alfredo, Leung, Carson K., Pazdor, Adam G.M., Tran, Kimberly

المصدر: Procedia Computer Science; 2016, Vol. 96, p682-691, 10p

مصطلحات موضوعية: BIG data, DATA mining, APPLICATION software, GRID computing, CLOUD computing, GRAPHIC methods

مستخلص: High volumes of a wide variety of valuable data can be easily collected and generated from a broad range of data sources of different veracities at a high velocity. In the current era of big data, many traditional data management and analytic approaches may not be suitable for handling the big data due to their well-known 5V's characteristics. Over the past few years, several systems and applications have developed to use cluster, cloud or grid computing to manage and analyze big data so as to support data science (e.g., knowledge discovery and data mining). In this paper, we present a knowledge-based system for social network analysis so as to support big data mining of interesting patterns from big social networks that are represented as graphs. [ABSTRACT FROM AUTHOR]

: Copyright of Procedia Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)