A Service for Parallel Processing of Protected Information Queries in a Multi-Server Environment

2021 ◽  
Vol 27 (11) ◽  
pp. 592-599
Author(s):  
R. E. Asratian ◽  

The principles of organizing an Internet service designed to implement parallel processing of protected queries in distributed information systems that are oriented to work in complex network environments with many processing servers are considered. Distinctive feature of the service consists in a possibility to combine sequential ("pipelined") and parallel query processing in a multi-server environment. The service architecture is based on the concept of a "Protected message" corresponding to a container for electronic documents (information query or response) that can be provided with one or more electronic digital signatures. In contrast, for example, to the Web services technology, the described service is based not on the model of calling methods of remote objects, but on the message exchange model. In this case, this means that all service processing functions (methods) have the same strict specification: they receive an array of objects of the "Protected message" program class as a parameter and return an array of objects of the same class. In sequential processing, both arrays usually contain one "Protected message" object each. However, when using parallel processing, arrays can contain multiple elements that correspond to the results of processing by multiple software threads. These processing functions are grouped into one or more dynamic libraries, which are connected to the PMS server when it starts working (each library can be considered as a remote analogue of a Web service), and become available to clients.

Author(s):  
Pavlos Kranas ◽  
Boyan Kolev ◽  
Oleksandra Levchenko ◽  
Esther Pacitti ◽  
Patrick Valduriez ◽  
...  

2018 ◽  
Author(s):  
Ζαιντ Μομανι

Μαζικά σύνολα δεδομένων με πρωτοφανείς διαστάσεις εμφανίζονται πρόσφατα σε πολλούς τομείς. Αυτά τα σύνολα δεδομένων απαιτούν ειδικά εργαλεία ώστε να αναλύονται αποτελεσματικά και να εξάγονται χρήσιμες πληροφορίες από αυτά. Για την αντιμετώπιση αυτών των προκλήσεων έχουν δημιουργηθεί παράλληλα εργαλεία κατάλληλα για μαζικά δεδομένα. Το σημαντικότερο είναι να δοθεί ιδιαίτερη έμφαση ώστε να μπορούμε να παραλληλίσουμε διεργασίες στον βέλτιστο δυνατό βαθμό. Εν αντιστοιχία,ο σκοπός αυτής της διατριβής είναι να παράσχει μια μέθοδο απάντησης επερωτήσεων χρησιμοποιώντας ένα μόνο γύρο της τεχνικής του MapReduce. Αυτό επιτυγχάνεται δίδοντας ιδιαίτερη έμφαση στα δεδομένα εισόδου,δηλαδή σε δυαδικές ή «παχιές» σχέσεις δεδομένων . Yλοποιούμε έναν αλγόριθμο πολλαπλών συζεύξεων (“multiway join”) στους δύο αυτούς τύπους εισόδων και πραγματοποιούμε συγκρίσεις, όπου διαπιστώνουμε ότι οι «παχιές» σχέσεις δεδομένων επιτυγχάνουν καλύτερο χρόνο επεξεργασίας λόγω της φύσης αυτών των συνόλων δεδομένων. Η περίπτωση των "παχιών"σχέσεων δεδομένων, εξετάζεται στο πλαίσιο της ενοποίησης δεδομένων,συγκεκριμένα προτείνεται μια εφαρμογή για τη διασταύρωση των πληροφοριών στις πηγές των πολλαπλών δεδομένων, όταν υπάρχουν αντικρουόμενες πληροφορίες. Η περίπτωση των δυαδικών σχέσεων δεδομένων μελετάται επίσης σε σχέση με τα σύνολα δεδομένων RDF, τα οποία αποτελούν μια σημαντική εφαρμογή στον τομέα της διαχείρισης των σημασιολογικών δεδομένων ιστού και επιτυγχάνουμε σημαντική αύξηση στην ταχύτητα της επεξεργασίας επερωτημάτων.


Compiler ◽  
2012 ◽  
Vol 1 (2) ◽  
Author(s):  
Devia Tito Setyaningsih ◽  
Hero Wintolo ◽  
Dwi Nugraheny

One of the internet service used by the people of Indonesia is a blog that can be accessed via http://blogspot.com or http://wordpress.com and others. Everyone can use this medium for the purpose of publication of information in the form of text, images, sounds, or video without having to master web programming languages. One of the obstacles a person who has a blog is a way of increasing number of visitors to his blog. In order for many visitors the blog owner needs to understand about SEO (Search Engine Optimization).To allow users to blog in increasing the number of visitors and ranking his blog, they invented a system that utilizes parallel processing techniques and create a new method, named TSC (Together in a Single Connection) to increase the number of visitors, number of pages viewed and ranking.Increase blog traffic system based on parallel processing can improve the effectiveness in increasing traffic to a blog. With this system the blog owner is expected to be easier to rise to visit his blog.


Author(s):  
Wei Yan

In order to solve the problem of storage and query for massive XML data, a method of efficient storage and parallel query for a massive volume of XML data with Hadoop is proposed. This method can store massive XML data in Hadoop and the massive XML data is divided into many XML data blocks and loaded on HDFS. The parallel query method of massive XML data is proposed, which uses parallel XPath queries based on multiple predicate selection, and the results of parallel query can satisfy the requirement of query given by the user. In this chapter, the map logic algorithm and the reduce logic algorithm based on parallel XPath queries based using MapReduce programming model are proposed, and the parallel query processing of massive XML data is realized. In addition, the method of MapReduce query optimization based on multiple predicate selection is proposed to reduce the data transfer volume of the system and improve the performance of the system. Finally, the effectiveness of the proposed method is verified by experiment.


Author(s):  
Cepi Ramdani ◽  
Indah Soesanti ◽  
Sunu Wibirama

Fuzzy C Means algorithm or FCM is one of many clustering algorithms that has better accuracy to solve problems related to segmentation. Its application is almost in every aspects of life and many disciplines of science. However, this algorithm has some shortcomings, one of them is the large amount of processing time consumption. This research conducted mainly to do an analysis about the effect of segmentation parameters towards processing time in sequential and parallel. The other goal is to reduce the processing time of segmentation process using parallel approach. Parallel processing applied on Nvidia GeForce GT540M GPU using CUDA v8.0 framework. The experiment conducted on natural RGB color image sized 256x256 and 512x512. The settings of segmentation parameter values were done as follows, weight in range (2-3), number of iteration (50-150), number of cluster (2-8), and error tolerance or epsilon (0.1 – 1e-06). The results obtained by this research as follows, parallel processing time is faster 4.5 times than sequential time with similarity level of image segmentations generated both of processing types is 100%. The influence of segmentation parameter values towards processing times in sequential and parallel can be concluded as follows, the greater value of weight parameter then the sequential processing time becomes short, however it has no effects on parallel processing time. For iteration and cluster parameters, the greater their values will make processing time consuming in sequential and parallel become large. Meanwhile the epsilon parameter has no effect or has an unpredictable tendency on both of processing time.


2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Ok-Kyoon Ha ◽  
Keonpyo Lee ◽  
Wan-Jin Kim ◽  
Kun Su Yoon

Techniques for analyzing and avoiding hazardous objects and situations on the seabed are being developed to ensure the safety of ships and submersibles from various hazards. Improvements in accuracy and real-time response are critical for underwater object recognition, which rely on underwater sonar detection to remove noises and analyze the data. Therefore, parallel processing is being introduced for real-time processing of two-dimensional (2D) underwater sonar detector images for seabed monitoring. However, this requires optimized parallel processing between the modules for image processing and the data processing of a vast amount of data. This study proposes an effective parallel processing method, called Task Partitioning, based on central and graphical processing units for monitoring and identifying underwater objects in real time based on 2D-imaging sonar. The practicality of the proposed method is evaluated experimentally by comparing it to the sequential processing method. The experimental results show that the Task Partitioning method significantly improves the processing time for sonar images because it reduces the average execution time to 1% and 5% of the sequential processing method and general parallelization, respectively.


2017 ◽  
Vol 64 (6) ◽  
pp. 1-58 ◽  
Author(s):  
Paul Beame ◽  
Paraschos Koutris ◽  
Dan Suciu

Sign in / Sign up

Export Citation Format

Share Document