scholarly journals An implementation of ray tracing algorithm for the multiprocessor machines

2006 ◽  
Vol 16 (1) ◽  
pp. 125-135 ◽  
Author(s):  
Aleksandar Samardzic ◽  
Dusan Starcevic ◽  
Milan Tuba
Keyword(s):  
Parallel Algorithm ◽  
Ray Tracing ◽  
Shared Memory ◽  
Parallel Machines ◽  
Lighting Condition ◽  
Posix Threads ◽  
Scene Description ◽  
Tracing Algorithm

Ray Tracing is an algorithm for generating photo-realistic pictures of the 3D scenes, given scene description, lighting condition and viewing parameters as inputs. The algorithm is inherently convenient for parallelization and the simplest parallelization scheme is for the shared-memory parallel machines (multiprocessors). This paper presents two implementations of the algorithm developed by the authors for alike machines, one using the POSIX threads API and another one using the OpenMP API. The paper also presents results of rendering some test scenes using these implementations and discusses our parallel algorithm version efficiency.

scholarly journals Correction to: Parallel optimization of the ray-tracing algorithm based on the HPM model

2021 ◽  
Author(s):  
Wang Jun-Feng ◽  
Ding Gang-Yi ◽  
Wang Yi-Ou ◽  
Li Yu-Gang ◽  
Zhang Fu-Quan
Keyword(s):  
Ray Tracing ◽  
Parallel Optimization ◽  
Tracing Algorithm

Uncertainties evaluations in the ray-tracing algorithm based on Monte Carlo method

2014 ◽  
Author(s):  
Guojin Feng ◽  
Ping Li ◽  
Yingwei He ◽  
Yu Wang ◽  
Houping Wu
Keyword(s):  
Monte Carlo ◽  
Monte Carlo Method ◽  
Ray Tracing ◽  
Tracing Algorithm

An Efficient Parallel Algorithm for Rectangular Packing Based on Bintree Expression

1996 ◽  
Author(s):  
Aihu Wang ◽  
Jianzhong Cha ◽  
Jinmin Wang
Keyword(s):  
Computational Complexity ◽  
Problem Solving ◽  
Parallel Algorithm ◽  
Shared Memory ◽  
Optimal Packing ◽  
Packing Process ◽  
Left Corner ◽  
Rectangular Packing ◽  
Packing Scheme ◽  
Sequential Decomposition

Abstract In this paper, a method using bintree structure to express the states of the packing space of rectangular packing is proposed. Through the sequential decomposition of the packing space, the optimal packing scheme of various sized rectangular packing can be obtained by every time putting the optimal piece that satisfies specular conditions toward the current packing space and by locating it at the up-left corner of the current packing space. Different optimal packing schemes that satisfy different demands can be obtained by adjusting the values of the ordering factors KA and KB. A parallel algorithm based on SIMD-CREW shared-memory computer is designed through the analysis of the parallelism of the bintree expression. The whole packing process is clearly expressed by the bintree. The computational complexity of the algorithm is shown to be O(n2logn). Both the experimental results and the comparison with other sequential packing algorithms have proved that the parallel packing algorithm is efficient. What is more, it nearly doubles the problem solving speed.

scholarly journals High performance radar images modelling and recognition of real objects

2019 ◽  
pp. 549-552
Author(s):  
D A Zherdev ◽  
V V Prokudin
Keyword(s):  
Parallel Algorithm ◽  
High Performance ◽  
3D Models ◽  
Parallel Program ◽  
Antenna Aperture ◽  
Radar Images ◽  
Scene Description ◽  
Real Objects

In the work there is a modernization of the parallel algorithm for the radar images formation of 3D models with the synthesis of the antenna aperture. In the formation of the scene description, the various structures are used in which it is possible to use more efficient and derived calculations. In addition, it is the topical task to recognize objects on radar images. Thus, on the basis of the implemented parallel program for modelling, the high performance required for simulating multiple radar images can be achieved.

Sign in / Sign up

Export Citation Format

Share Document