• The Journal of the Korea Contents Association
• /
• v.12 no.2
• /
• pp.60-68
• /
• 2012

This paper describes design and implementation of a distributed rendering management system using existing rendering module. Currently, most of 3D commercial software provide modeling, rendering and distributed environment in the whole package. So, the server and client should use the given renderer as is, without the required features. In this paper, we propose a distributed rendering management system that consist of rendering module and distributed rendering client-server. The rendering module can be executed independently and managed by the distributed rendering client. The server requests rendering for each connected client. After the execution, the server gathers rendering result from each client. After gathering, the server provides the rendering result to the user.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.77-82
• /
• 2023

Multi-cloud rendering has been attracting attention recently as the computational load of rendering fluctuates over time and each rendering process can be performed independently. However, it is challenging in multi-cloud rendering to deliver large amounts of input data instantly with consistency constraints. In this paper, we develop a new distributed file system for multi-cloud rendering. In our file system, a local machine maintains a file server that manages versions of rendering input files, and each cloud node maintains a rendering cache manager, which performs distributed cooperative caching by considering file versions. Measurement studies with rendering workloads show that the proposed file system performs better than NFS and the uploading schemes by 745% and 56%, respectively, in terms of I/O throughput and execution time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.582-588
• /
• 2002

Scalable displays generate large and high resolution images and provide an immersive environment. Recently, scalable displays are built on the networked clusters of PCs, each of which has a fast graphics accelerator, memory, CPU, and storage. However, the distributed rendering on clusters is a network bound work because of limited network bandwidth. In this paper, we present a new algorithm for reducing the network bandwidth and implement it with a conventional distributed rendering system. This paper describes the algorithm called geometry tracking that avoids the redundant geometry transmission by indexing geometry data. The experimental results show that our algorithm reduces the network bandwidth up to 42%.

• Journal of Korea Game Society
• /
• v.18 no.1
• /
• pp.115-124
• /
• 2018

Various kinds of tile-based ultra-high resolution display devices have been developed by, for example, constructing display walls using many commodity LCD displays. To represent 3D applications like computer games on these devices, one has to develop 3D applications or develop particular APIs only for representing on these devices. If one can develop a distributed rendering system using legacy 3D APIs such as OpenGL and Direct3D by extending a remote rendering system, commercial computer games can be represented on such display devices without modifying their source codes. The purpose of the paper is to propose a new Dired3D-based distribute rendering system by extending a Direct3D-based remote rendering system and to show its feasibility technically by appling it to a sample Direct3D application and performing a few experimentations.

• Journal of Korea Game Society
• /
• v.19 no.5
• /
• pp.5-14
• /
• 2019

This paper proposes a remote partitioned rendering method for displaying 3D applications on large tiled displays, which were developed using the Unity game engine. With the proposed method, one can represent them without additional development or any modifications to the applications. The paper verifies its feasibility by applying to a sample Unity-based application.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.111-120
• /
• 2010

In this paper, we propose a volume rendering method using grid computing for large-scale volume data. Grid computing is attractive because medical institutions and research facilities often have a large number of idle computers. A large-scale volume data is divided into sub-volumes and the sub-volumes are rendered using grid computing. When using grid computing, different computers rarely have the same processor speeds. Thus the return order of results rarely matches the sending order. However order is vital when combining results to create a final image. Job-Scheduling is important in grid computing for volume rendering, so we use an obstacle-flag which changes priorities dynamically to manage sub-volume results. Obstacle-Flags manage visibility of each sub-volume when line of sight from the view point is obscured by other subvolumes. The proposed Dynamic Job-Scheduling based on visibility substantially increases efficiency. Our Dynamic Job-Scheduling method was implemented on our university's campus grid and we conducted comparative experiments, which showed that the proposed method provides significant improvements in efficiency for large-scale volume rendering.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.398-407
• /
• 2012

We propose a tree modeling method of expressing realistically and efficiently numerous trees distributed on a broad terrain. This method combines and simplifies the recursive hierarchy of tree branch and branch generation process through self-organizing from buds, allowing users to generate trees that can be used more intuitively and efficiently. With the generation process the leveled structure and the appearance such as branch length, distribution and direction can be controlled interactively by user. In addition, we introduce an environment-adaptive model that allows to grow a number of trees variously by controlling at the same time and we propose an efficient application method of growing environment. For the real-time rendering of the complex tree models distributed on a broad terrain, the rendering process, the LOD(level of detail) for the branch surfaces, and shader instancing are introduced through the GPU(Graphics Processing Unit). Whether the numerous trees are expressed realistically and efficiently on wide terrain by proposed models are confirmed through simulation.

• Journal of Aerospace System Engineering
• /
• v.13 no.5
• /
• pp.1-8
• /
• 2019

Recently, avionics has been migrating from a federated architecture to an integrated modular architecture based on a multi-core to reduce the number of systems, weight, power consumption, and platform redundancy. The volume of data which must bo provided to the pilot through the display device has increased, because an integrated single device performs multiple functions. For this reason, the volume of data processed by the graphic processor within a fixed operation period has increased. In this paper, we provide a multi-core-based rendering engine in to perform more graphics processing within a fixed operation period. We assume the proposed method uses a multi-core-based partitioning operating system using the AMP (Asymmetric Multi-Processing) architecture.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.24-30
• /
• 1996

The ray tracing method, which is one of many photorealistic rendering techniques, requires heavy computational processing to synthesize images. Parallel processing can be used to reduce the computational processing time. A parallel algorithm for the ray tracing has been implemented and executed for various images on transputer systems. In order to develop a scalable parallel algorithm, a processor farming technique has been exploited. Since each image is divided and distributed to each farming processor, the scalability of the parallel system and load balancing are achieved naturally in the proposed algorithm. Efficiency of the parallel algorithm is obtained up to 95% for nine processors. However, the best size of a distributed task is much higher in simple images due to less computational requirement for every pixel. Efficiency degradation is observed for large granularity tasks because of load unbalancing caused by the large task. Overall, transputer systems behave as good scalable parallel processing system with respect to the cost-performance ratio.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.106-115
• /
• 2011

In this paper, we evaluate the effectiveness of previous shading algorithms in depicting shape of 3d objects. We perform a study in which people are shown an image of one of ten 3D objects shaded with one of eight styles and asked to orient a gauge to coincide with the surface normal at many positions on the object's surface. The normal estimates are compared with each other and with ground truth data provided by a registered 3D surface model to analyze accuracy and precision. Our experiments suggest that people interpret certain shape differently depending on shading of 3d object. This paper offers substantial evidence that current computer graphics shading algorithms can effectively depict shape of 3d objects where the algorithms have the properties of lots of tone steps and uniformly distributed tone steps. This type of analysis can guide the future development of new CG shading algorithms in computer graphics for the purpose of shape perception.