Performance Evaluation of Convolution on the Cell Broadband Engine Processor

Ismail, Leila; Guerchi, Driss

doi:10.1109/tpds.2010.70

Cited by 10 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…25 It simulates the evolution of particle distribution functions over a 3D lattice over many timesteps. For each time-step, at each grid point, the computation performed involves directional density values for the grid point and its face (6) and edge (12) neighbors (also referred to as D3Q19).…”

Section: Lattice Boltzmann Methods (Lbm)mentioning

confidence: 99%

See 1 more Smart Citation

Can traditional programming bridge the ninja performance gap for parallel computing applications?

et al. 2015

View full text Add to dashboard Cite

Section: Lattice Boltzmann Methods (Lbm)mentioning

confidence: 99%

“…12 8 K on 1.28 M pixels 1.9 × 10 6 Pixels/sec BlackScholes 20 1 M call + put options 8. compiler generated extra spill/fill instructions, that resulted in performance gap of 1.4X. 5: LIBOR: LIBOR 4 has an outer loop over all paths of the Monte Carlo simulation, and an inner loop over the forward rates on a single path.…”

Section: Best Optimized Performancementioning

confidence: 99%

Can traditional programming bridge the ninja performance gap for parallel computing applications?

et al. 2015

View full text Add to dashboard Cite

“…Complicated applications often require a huge amount of available computing processing and network capacity, provided as an infrastructure as a service (IaaS), in support of large-scale experiments. Examples of such applications are in the domain of seismic imaging [14], aerospace [15], meteorology [16], and convolution-based applications [9]. In this work, we focus on divisible load applications, where an application load can be divided into a number of tasks that can be processed independently in parallel ( [17][18][19]).…”

Section: Background and Motivationsmentioning

confidence: 99%

“…For instance, it is used in Google map-reduce programming model [7]; i.e., the rationale of why we have chosen the master-worker model as a base model. The master-worker model arises in divisible-load applications, where there is no communication between the workers, such as search for a pattern, compression, join, graph coloring and generic search applications [8], convolution-based applications [9], and image processing applications [10]. Furthermore, as stated in [5], a Cloud is considered as a candidate platform to run heavy-load applications to satisfy performance requirements.…”

Section: Introductionmentioning

confidence: 99%

Modeling and Performance Analysis to Predict the Behavior of a Divisible Load Application in a Cloud Computing Environment

Ismail

Liren

2012

Algorithms

Self Cite

View full text Add to dashboard Cite

Cloud computing is an emerging technology where IT resources are virtualized to users as a set of a unified computing resources on a pay per use basis. The resources are dynamically chosen to satisfy a user Service Level Agreement and a required level of performance. Divisible load applications occur in many scientific and engineering applications and can easily be mapped to a Cloud using a master-worker pattern. However, those applications pose challenges to obtain the required performance. We model divisible load applications tasks processing on a set of cloud resources. We derive a novel model and formulas for computing the blocking probability in the system. The formulas are useful to analyze and predict the behavior of a divisible load application on a chosen set of resources to satisfy a Service Level Agreement before the implementation phase, thus saving time and platform energy. They are also useful as a dynamic feedback to a cloud scheduler for optimal scheduling. We evaluate the model in a set of illustrative scenarios

show abstract

“…Several methods have been used to assist NCC for reducing its searching and computing times in image matching, such as the pyramid method [3,7]. In addition, many parallel algorithms of the inner-product have been published that can perform fast cross-correlation for NCC [16,17], where the Distributed Arithmetic (DA) with look-up table has not multiplication, but needs much Read-Only Memory (ROM) [18].…”

Section: Introductionmentioning

confidence: 99%

The Algorithm and Structure for Digital Normalized Cross-Correlation by Using First-Order Moment

Pan

Xia

et al. 2020

Sensors

View full text Add to dashboard Cite

Normalized cross-correlation is an important mathematical tool in digital signal processing. This paper presents a new algorithm and its systolic structure for digital normalized cross-correlation, based on the statistical characteristic of inner-product. We first introduce a relationship between the inner-product in cross-correlation and a first-order moment. Then digital normalized cross-correlation is transformed into a new calculation formula that mainly includes a first-order moment. Finally, by using a fast algorithm for first-order moment, we can compute the first-order moment in this new formula rapidly, and thus develop a fast algorithm for normalized cross-correlation, which contributes to that arbitrary-length digital normalized cross-correlation being performed by a simple procedure and less multiplications. Furthermore, as the algorithm for the first-order moment can be implemented by systolic structure, we design a systolic array for normalized cross-correlation with a seldom multiplier, in order for its fast hardware implementation. The proposed algorithm and systolic array are also improved for reducing their addition complexity. The comparisons with some algorithms and structures have shown the performance of the proposed method.

show abstract

Performance Evaluation of Convolution on the Cell Broadband Engine Processor

Cited by 10 publications

References 8 publications

Can traditional programming bridge the ninja performance gap for parallel computing applications?

Can traditional programming bridge the ninja performance gap for parallel computing applications?

Modeling and Performance Analysis to Predict the Behavior of a Divisible Load Application in a Cloud Computing Environment

The Algorithm and Structure for Digital Normalized Cross-Correlation by Using First-Order Moment

Contact Info

Product

Resources

About