Improvements in multiprocessor system design

Rodgers, David

doi:10.1145/327070.327215

Cited by 93 publications

(44 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It further accelerates the synthesis speed of Propw/oWB by 9.9% and 9.1% at maximum for 2-thread and 4-thread cases, respectively. Speedup approaching to theoretical maximum given by Amdahl's law [12] is achieved with negligible quality degradation. Table 3 demonstrates the efficiency of the proposed algorithm for view interpolation.…”

Section: Partition Location Decisionmentioning

confidence: 80%

Region adaptive workload prediction for parallel view synthesis

Liu

Jin

Dai

2015

2015 Visual Communications and Image Processing (VCIP)

View full text Add to dashboard Cite

In this paper, a parallel system together with a real-time workload balancing algorithm is proposed for view synthesis on multi-core platforms. First, a numerical relationship between the number of holes after warping and the workload of view synthesis is derived based on correlation analysis for the texture regions. Then, according to the location of the holes (whether they lie around an edge or at a homogeneous region), different models are proposed to predict the synthesis workload accurately. Experimental results show that the workload difference among cores is reduced largely and higher speedup ratio is achieved with negligible quality degradation by the proposed workload balancing system. Index Terms-Parallel view synthesis, depth image based rendering, workload prediction, depth gradient, FTV

show abstract

Section: Partition Location Decisionmentioning

confidence: 80%

Region adaptive workload prediction for parallel view synthesis

Liu

Jin

Dai

2015

2015 Visual Communications and Image Processing (VCIP)

View full text Add to dashboard Cite

show abstract

“…Furthermore, according to Amdahl's law [24], the speedup S of an algorithm running on a multi-core server depends on the number of threads of execution, and most importantly, on the sequential fraction of the algorithm. Specifically, let n ∈ N be the number of threads of execution and B ∈ [0, 1] be the fraction of the algorithm that is strictly serial, then the time T (n) the algorithm would take to finish when running on n threads of execution is calculated by the following Table 10: The speedups achieved when the parallel fraction of the homomorphic addition algorithm is executed by some common processors having different number of cores and threads.…”

Section: Number Ofmentioning

confidence: 99%

Design and implementation of a secure cloud-based billing model for smart meters as an Internet of things using homomorphic cryptography

Mai

Khalil

2017

Future Generation Computer Systems

View full text Add to dashboard Cite

“…When comparing a high throughput computation with sequential runs, the benefit of using parallelized code on massively parallel systems is the performance achieved by smaller time necessary to accomplish each parallel run. It may however be limited due to bottlenecks or inherently sequential parts of the parallelized application (Amdahl's Law, [17]). …”

Section: Performance and Scalability Analysismentioning

confidence: 99%

Architecture, implementation and parallelization of the software to search for periodic gravitational wave signals

Poghosyan

Matta

Streit

et al. 2015

Computer Physics Communications

View full text Add to dashboard Cite

The parallelization, design and scalability of the PolGrawAllSky code to search for periodic gravitational waves from rotating neutron stars is discussed. The code is based on an efficient implementation of the F -statistic using the Fast Fourier Transform algorithm. To perform an analysis of data from the advanced LIGO and Virgo gravitational wave detectors' network, which will start operating in 2015, hundreds of millions of CPU hours will be required -the code utilizing the potential of massively parallel supercomputers is therefore mandatory. We have parallelized the code using the Message Passing Interface standard, implemented a mechanism for combining the searches at different sky-positions and frequency bands into one extremely scalable program. The parallel I/O interface is used to escape bottlenecks, when writing the generated data into file system. This allowed to develop a highly scalable computation code, which would enable the data analysis at large scales on acceptable time scales. Benchmarking of the code on a Cray XE6 system was performed to show efficiency of our parallelization concept and to demonstrate scaling up to 50 thousand cores in parallel.

show abstract

Improvements in multiprocessor system design

Cited by 93 publications

References 4 publications

Region adaptive workload prediction for parallel view synthesis

Region adaptive workload prediction for parallel view synthesis

Design and implementation of a secure cloud-based billing model for smart meters as an Internet of things using homomorphic cryptography

Architecture, implementation and parallelization of the software to search for periodic gravitational wave signals

Contact Info

Product

Resources

About