This paper discusses how to make a distributed object system flexible so as to satisfy applications' requirements in change of the system environment. The system change is modeled to be the change of not only type...
详细信息
ISBN:
(纸本)0818686030
This paper discusses how to make a distributed object system flexible so as to satisfy applications' requirements in change of the system environment. The system change is modeled to be the change of not only types of service but also quality of service (QoS) supported by the objects. There are two types of methods changing the objects, one for manipulating the states of the objects and another for changing QoS of the objects. We discuss new relations among methods with respect to QoS. By using the QoS-based relations, we newly discuss a QoS-based compensating way to recover the abject from the less qualified state.
The ongoing production of Petabytes of multimedia data per year creates, an urgent need for the organisation, management, and retrieval of multimedia information. Related memory. bandwidth, and computational requireme...
详细信息
ISBN:
(纸本)0769512305
The ongoing production of Petabytes of multimedia data per year creates, an urgent need for the organisation, management, and retrieval of multimedia information. Related memory. bandwidth, and computational requirements, often surpass the capabilities of traditional database systems and computer architectures. Moreover, improved retrieval techniques allow a manual selection of regions of interest, which are subsequently searched in all media in the database by using, dynamically extracted features. This paper presents techniques for parallel multimedia retrieval by considering an image database as, an example. The discussed cluster architecture depicts one, possible solution for the performance problem. The distribution of the image data over a large number of nodes enables a parallelprocessing of the compute intensive operations for dynamic image retrieval. Thus, the partitioning of the data and the, applied strategies for workload balancing have a decisive impact on the performance,, efficiency, and the usability of such image databases.
High performance image analytics is an important challenge for big data processing as image and video data is a huge portion of big data e.g. generated by a tremendous amount of image sensors worldwide. This paper pre...
详细信息
High performance image analytics is an important challenge for big data processing as image and video data is a huge portion of big data e.g. generated by a tremendous amount of image sensors worldwide. This paper presents a case study for image analytics namely the parallel connected component labeling (CCL) which is one of the first steps of image analytics in general. It is shown that a high performance CCL implementation can be obtained on a heterogeneous platform if parts of the algorithm are processed on a fine grain parallel field programmable gate array (FPGA) and a multicore processor simultaneously. The proposed highly efficient architecture and implementation is suitable for the processing of big image and video data in motion and reduces the amount of memory required by the hardware architecture significantly for typical image sizes.
Deep learning especially image recognition techniques have been extensively used in various applications such as unmanned driving. The robustness of deep learning models is of critical importance since fault image rec...
详细信息
ISBN:
(纸本)9781665414852
Deep learning especially image recognition techniques have been extensively used in various applications such as unmanned driving. The robustness of deep learning models is of critical importance since fault image recognition results may result in serious incidents. In this paper, we propose a fast quantifying method by general imageprocessing to evaluate the robustness of five typical deep learning models under the Keras framework (i.e., VGG16, InceptionV3, ResNet50, DenseNet, and MobileNet). We analyze six metrics in terms of accuracy, precision, recall, F1, recognition time, and impact factor. The evaluation data is publicly accessible image data sets from Kaggle. In our evaluation, the adversary samples are generated by generally imageprocessingmethods such as gray-scaling, color-reversing, and image-flipping, which is ordinary operations and easily launched. The different models over various imageprocessingmethods are evaluated and compared comprehensively. The evaluation results show that DenseNet performs best over three conditions such as baseline, gray-scaling and horizontal flipping. MobileNet costs the shortest delay in decision over all imageprocessingmethods. F1 score varies with different attack intensity. InceptionV3 presents overall robustness in most conditions.
An ongoing work is presented for accurately predicting the performance of distributed applications in heterogeneous systems. We are developing dPerf, a tool built using the Rose framework for performing static analysi...
详细信息
ISBN:
(纸本)9780769543284
An ongoing work is presented for accurately predicting the performance of distributed applications in heterogeneous systems. We are developing dPerf, a tool built using the Rose framework for performing static analysis and an automatic instrumentation on the input source code of programs written in C, C++ or Fortran. The accuracy in predicting program computation time resides in using hardware counters, as well as in applying two block benchmarking techniques that we propose in this paper. The current work makes use of a network simulator in order to calculate the communication time used in our approach. Afterwards, the computation and communication times are being summed up obtaining an estimation of the distributed application execution time. The approach is proven experimentally using NAS Integer Sort benchmark, the communications being simulated with SimGrid.
Although block-based image compression techniques seem to be straightforward to implement on parallel MIMD architectures, problems might arise due to architectural restrictions on such parallel machines (e.g. memory c...
详细信息
ISBN:
(纸本)0819424358
Although block-based image compression techniques seem to be straightforward to implement on parallel MIMD architectures, problems might arise due to architectural restrictions on such parallel machines (e.g. memory constraints on distributed memory architectures). In this paper we discuss possible solutions to such problems occurring in different image compression techniques. Experimental results are included for adaptive wavelet block coding and fractal compression.
Aim of the paper is to demonstrate how by integrating unsupervised and supervised parallel neural clustering methods in a GPU platform we may carry out a fast image segmentation with a satisfactory compromise between ...
详细信息
ISBN:
(纸本)9781467325851;9781467325837
Aim of the paper is to demonstrate how by integrating unsupervised and supervised parallel neural clustering methods in a GPU platform we may carry out a fast image segmentation with a satisfactory compromise between the topological preservation of the original image and the minimization of the quantization error, also known as clustering accuracy. For this reason, an unsupervised parallel clustering method inspired by the Extended SOM (ESOM) powered by a Learning Vector Quantization (LVQ) like algorithm is proposed. Then, its parallel supervised versions is presented to further minimize the quantization error in case proper prototypes of the desired clusters are known. Finally, the GPU implementation of both these methods are illustrated to show how we may support time critical tasks such as real time surveillance, interactive medical diagnosis, and control of dynamical systems. The performance of the GPU implementation is discussed with the help of small examples and realistic processing tasks.
The geometric shape of molecular surfaces strongly influences the docking processes where, although electrostatic, hydrophobic and van der Waals interactions affect greatly the binding affinity of the molecules, shape...
详细信息
ISBN:
(纸本)9780769535449
The geometric shape of molecular surfaces strongly influences the docking processes where, although electrostatic, hydrophobic and van der Waals interactions affect greatly the binding affinity of the molecules, shape complementarity is a necessary condition. The vast majority of molecular docking algorithms uses a brute force enumeration of the transformation space, which requires extremely long running times. Few other methods use local shape feature matching to reduce the search to those relative positions which satisfy geometric constraints. Based on a shape analysis tool developed in Computer Graphics, in this paper we introduce ProTailor, a parallel algorithm for efficient multi-scale detection of morphological features on molecular surfaces. Thanks to an almost linear speed-up, we show how ProTailor is well suited to efficiently identify salient features like cavities and depressions, saddle areas or bridges. Feature identification may serve as a powerful tool to automatically locate potential binding sites or as a pre-processing step for efficient shape complementarity assessment in docking prediction.
As an extension of using image segmentation to do stereo matching, firstly, by using self-organizing map (som) and K-means algorithms, this paper provides a self-distributed segmentation method that allocates segments...
详细信息
ISBN:
(纸本)9783319393841
As an extension of using image segmentation to do stereo matching, firstly, by using self-organizing map (som) and K-means algorithms, this paper provides a self-distributed segmentation method that allocates segments according to image's texture changement where in most cases depth discontinuities appear. Then, for stereo, under the fact that the segmentation of left image is not exactly same with the segmentation of right image, we provide a matching strategy that matches segments of left image to pixels of right image as well as taking advantage of border information from these segments. Also, to help detect occluded regions, an improved aggregation cost that considers neighbor valid segments and their matching characteristics is provided. For post processing, a gradient border based median filter that considers the closest adjacent valid disparity values instead of all pixels' disparity values within a rectangle window is provided. As we focus on real-time execution, these time-consumming works for segmentation and stereo matching are executed on a massively parallel cellular matrix GPU computing model. Finaly, we provide our visual dense disparity maps before post processing and final evaluation of sparse results after post-processing to allow comparison with several ranking methods top listed on Middlebury.
There is an opportunity for distributed Computing Infrastructures (DCIs) to embrace container-based virtualisation to support efficient execution of scientific applications without the performance penalty commonly int...
详细信息
ISBN:
(纸本)9781509060580
There is an opportunity for distributed Computing Infrastructures (DCIs) to embrace container-based virtualisation to support efficient execution of scientific applications without the performance penalty commonly introduced by Virtual Machines (VMs). However, containers (e.g. Docker) and VMs feature different image formats and disparate procedures for deployment and management, thus hindering the adoption of hybrid DCIs (HDCIs) comprised of those kind of resources. This paper describes a workflow based on open-source tools and standards to introduce coherent application delivery on HDCIs in which applications require to be deployed on both VMs and Docker containers. Leveraging and extending the TOSCA standard to describe application requirements, and adopting DevOps practices, resulted in the coherent creation of the artifacts required for the execution of the applications on different platforms. The paper features the adoption of this approach in the INDIGO-DataCloud project.
暂无评论