Empirical studies investigating the complexity of data decomposition and communication are lacking.
Optimising the general computational structure of Fluidity, along with work to improve the data decomposition and parallel load balancing enabled simulations to be run over three times faster than with the original code, even when using thousands of computational cores.
This paper also presents the design of customized biorthogonal wavelet filters using the lifting method that are used for data decomposition and image reconstruction and compares them to other commonly known wavelets.
This chapter provides an overview of the main multiway methods used for data decomposition, calibration and pattern recognition.
In this paper, we regard the feature selection as a clustering process with data decomposition technique and propose a novel feature selection method based on the non-negation matrix factorization (NMF).
In short, the concept of a 'network' and the form they take depends on the assumptions made in the data decomposition approach, and none should be considered necessarily better than the other (assuming they show similar objective performance, e.g., Bayesian model evidence and reproducibility), but instead they each offer different perspectives on the nature of the brain's activity.
The survey, through the sorting case study, allow us to identify some algorithmic issues and software challenges to master heterogeneous cluster platforms in order to better utilize them: data decomposition techniques, scheduling and load balancing methods.
The rest is spent on the other phases such as the preparation phase (memory allocation and setting up FFT plans [12] on GPU; and the data padding and the data decomposition on CPU), data transfers between CPU and GPU and finally the data composition.
EMD, a new adaptive and effective data decomposition method aiming at non-linear and non-stationary data, was presented by NE Huang in 1998 [12].
There are four key issues to implement a parallel agent-based Schelling model, i.e., the ability to handle (1) the complexity of real data processing; (2) spatial data decomposition; (3) the preference and tolerance rates for multiple ethnic groups; and (4) the communication between agents.
A review of typical parallel FPM algorithms uncovers the major challenges, methodologies, and research problems in the field of parallel frequent pattern discovery, such as work-load balancing, finding good data layouts, and data decomposition.
