As modern industrial chains grow increasingly complex and time-sensitive, traditional transportation planning methods face efficiency bottlenecks. To address this, we propose a parallelization method based on Sparse M...
详细信息
the proceedings contain 311 papers. the topics discussed include: a robust image hashing with enhanced randomness by using random walk on zigzag blocking;securing fast learning! ridge regression over encrypted big dat...
ISBN:
(纸本)9781509032051
the proceedings contain 311 papers. the topics discussed include: a robust image hashing with enhanced randomness by using random walk on zigzag blocking;securing fast learning! ridge regression over encrypted big data;computational trust model for repeated trust games;formal analysis of selective disclosure attribute-based credential system in applied Pi calculus;node trust prediction framework in mobile ad hoc networks;trust enhancement over range search for encrypted data;healthcare fraud detection based on trustworthiness of doctors;integrated security for services hosted in virtual environments;a permissioned blockchain framework for supporting instant transaction and dynamic block size;trust validation of cloud IaaS: a customer-centric approach;distributed bitcoin account management;trusted Boolean search on cloud using searchable symmetric encryption;and dynamic attribute-based access control in cloud storage systems.
the proceedings contain 45 papers. the topics discussed include: asynchronous language and system of numerical algorithms fragmented programming;analyzing metadata performance in distributed file systems;towards param...
ISBN:
(纸本)3642032745
the proceedings contain 45 papers. the topics discussed include: asynchronous language and system of numerical algorithms fragmented programming;analyzing metadata performance in distributed file systems;towards parametric verification of prioritized time Petri Nets;software transactional memories: an approach for multicore programming;sparse matrix operations on multi-core architectures;multi-granularity parallelcomputing in a genome-scale molecular evolution application;efficient parallelization of the preconditioned conjugate gradient method;parallel FFT with Eden skeletons;parallel implementation of generalized Newton method for solving large-scale LP problems;dynamic real-time resource provisioning for massively multiplayer online games;2D fast Poisson solver for high-performance computing;solution of large-scale problems of global optimization on the basis of parallel algorithms and cluster implementation of computing processes;and efficiency of parallel Monte Carlo method to solve nonlinear coagulation equation.
the proceedings contain 29 papers. the topics discussed include: energy-efficient server rack cooling using feedforward control: benefits and problems;design of a reconfigurable pipelined switch for faulty on-chip net...
ISBN:
(纸本)9780889868649
the proceedings contain 29 papers. the topics discussed include: energy-efficient server rack cooling using feedforward control: benefits and problems;design of a reconfigurable pipelined switch for faulty on-chip networks;on BPC permutations admissibility to variable-stage hybrid optical shuffle-exchange networks;efficient data service design for a SOA approach to scientific computing;task allocation method for avoiding contentions by the information of concurrent communications;an online system for octuple-precision computation;performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors;failure prediction in video-streaming servers through performance analysis of server and client-server interactions;adaptive thread scheduling techniques for improving scalability of software transactional memory;and reexamining the parallelization schemes for standard full tableau simplex method on distributed memory environments.
A parallel version of a new automatic Harris-based corner detector is presented. A scheduler to dynamically and homogeneously distribute high computational workload on heterogeneous parallel architectures such as Grid...
详细信息
ISBN:
(纸本)9781424452910
A parallel version of a new automatic Harris-based corner detector is presented. A scheduler to dynamically and homogeneously distribute high computational workload on heterogeneous parallel architectures such as Grid systems has been implemented to speedup the whole procedure. Experimental results show the robustness of the underlying scheduler, which can be easily exploited in various automatic image analysis systems.
Withthe advent of multi-core processors, desktop application developers must finally face parallelcomputing and its challenges. A large portion of the computational load in a program rests within iterative computati...
详细信息
ISBN:
(纸本)9781424452910
Withthe advent of multi-core processors, desktop application developers must finally face parallelcomputing and its challenges. A large portion of the computational load in a program rests within iterative computations. In object-oriented languages these are commonly handled using iterators which are inadequate for parallel programming. Consequently, the powerful parallel Iterator concept was developed. this paper presents various developments of the parallel Iterator, such as parallel traversal of complex collections with partial ordering (such as a tree). Other features include reductions, parallel remove semantics and exception handling. Along withthe ease of use, the results reveal great speedup in comparison to traditional Java parallelism approaches.
Finding a vast array of applications, the problem of computingthe convex hull of a set of sorted points in the plane is one of the fundamental tasks in pattern recognition, morphology and image processing. the main c...
详细信息
ISBN:
(纸本)9781424452910
Finding a vast array of applications, the problem of computingthe convex hull of a set of sorted points in the plane is one of the fundamental tasks in pattern recognition, morphology and image processing. the main contribution of this paper is to show a simple parallel algorithm for computingthe convex hull of a set of n sorted points in the plane and evaluate the performance on the dual quad-core processors. the experimental results show that, our implementation achieves a speed-up factor of approximately 7 using 8 processors. Since the speed-up factor of more than 8 is not possible, our parallel implementation for computingthe convex hull is close to optimal. Also, for 2 or 4 processors, we achieved a super linear speed up.
Withparallelcomputing system scaling up, the system reliability drastically decreases, so parallelapplications running on such system must tolerate hardware failures. Checkpointing is widely used in the domain of l...
详细信息
ISBN:
(纸本)9781424452910
Withparallelcomputing system scaling up, the system reliability drastically decreases, so parallelapplications running on such system must tolerate hardware failures. Checkpointing is widely used in the domain of large-scale parallelcomputing, which periodically saves the state of computation to stable storage. this produces innegligible fault tolerance overhead. the traditional speedup only measures the performance of failure-free system. In this paper, we firstly propose the speedup metric taking into account checkpointing overhead. the new metric unifies the performance and reliability measures, and evaluates the practical speedup of parallel application with checkpointing. Furthermore, this paper classifies and analyzes existing parallel systems according to the proposed speedup metric, and makes suggestions on system design and fault tolerance techniques improvement. Finally, we validate the analysis of this new speedup metric by experiment. the experimental results indicate that the proposed speedup for parallel application with checkpointing is an effective metric.
Many data mining techniques have been proposed for parallelapplications performance analysis, the most interesting being clustering analysis. Most cases have been used to detect processors with similar behavior. In p...
详细信息
ISBN:
(纸本)9781424452910
Many data mining techniques have been proposed for parallelapplications performance analysis, the most interesting being clustering analysis. Most cases have been used to detect processors with similar behavior. In previous work, we presented a different approach: clustering was used to detect the computation structure of the applications and how these different computation phases behave. In this paper, we present a method to evaluate the accuracy of this structure detection. this new method is based on the Single Program Multiple Data (SPMD) paradigm exhibited by real parallel programs. Assuming an SPMD structure, we expect that all tasks of a parallel application execute the same operation sequence. Using a Multiple Sequence Alignment (MSA) algorithm, we check the sequence ordering of the detected clusters to evaluate the quality of the clustering results.
暂无评论