• Title/Summary/Keyword: graphics hardware

Search Result 198, Processing Time 0.031 seconds

Development of a 3-D Racing Game Using Java (Java를 이용한 3차원 레이싱 게임 개발)

  • Jeong, Gab-Joong;Jang, Jae-Won
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.627-630
    • /
    • 2005
  • This paper describes the development of a racing game with three-dimensional computer graphics as one of web-based game contents. Client user using web can access and run java applet program with download of Java Bytecode with the independence of hardware system. It consists of graphic user interface module, initial space generation module, event handler module, and thread control module. It uses 2-D linked list data structure for the 3-D graphic objects that are located in three-dimensional space for high-speed object searching and sorting. It enhances the dynamic object moving and viewing in three-dimensional space. We can use the developed racing game to inform game users of information for an advertisement like tourism information, and can apply the proposed 3-D drawing technology to 3-D game graphic engine core.

  • PDF

An Effective Multivariate Control Framework for Monitoring Cloud Systems Performance

  • Hababeh, Ismail;Thabain, Anton;Alouneh, Sahel
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.86-109
    • /
    • 2019
  • Cloud computing systems' performance is still a central focus of research for determining optimal resource utilization. Running several existing benchmarks simultaneously serves to acquire performance information from specific cloud system resources. However, the complexity of monitoring the existing performance of computing systems is a challenge requiring an efficient and interactive user directing performance-monitoring system. In this paper, we propose an effective multivariate control framework for monitoring cloud systems performance. The proposed framework utilizes the hardware cloud systems performance metrics, collects and displays the performance measurements in terms of meaningful graphics, stores the graphical information in a database, and provides the data on-demand without requiring a third party software. We present performance metrics in terms of CPU usage, RAM availability, number of cloud active machines, and number of running processes on the selected machines that can be monitored at a high control level by either using a cloud service customer or a cloud service provider. The experimental results show that the proposed framework is reliable, scalable, precise, and thus outperforming its counterparts in the field of monitoring cloud performance.

Analysis of Impact of Correlation Between Hardware Configuration and Branch Handling Methods Executing General Purpose Applications (범용 응용프로그램 실행 시 하드웨어 구성과 분기 처리 기법에 따른 GPU 성능 분석)

  • Choi, Hong Jun;Kim, Cheol Hong
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.3
    • /
    • pp.9-21
    • /
    • 2013
  • Due to increased computing power and flexibility of GPU, recent GPUs execute general purpose parallel applications as well as graphics applications. Programmers can use GPGPU by using the APIs from GPU vendors. Unfortunately, computational resources of GPU are not fully utilized when executing general purpose applications because of frequent branch instructions. To handle the branch problem, several warp formations have been proposed. Intuitively, we expect that the warp formations providing higher computational resource utilization show higher performance. Contrary to our expectations, according to simulation results, the performance of the warp formation providing better utilization is lower than that of the warp formation providing worse utilization. This is because warp formation providing high utilization causes serious memory bottleneck due to increased memory request. Therefore, warp formation providing high computation utilization cannot guarantee high performance without proper hardware resources. For this reason, we will analyze the correlation between hardware configuration and warp formation. Our simulation results present the guideline to solve the underutilization problem due to branch instructions when designing recent GPU.

Education Equipment for FPGA Design of Sensor-based IOT System (센서 기반의 IOT 시스템의 FPGA 설계 교육용 장비)

  • Cho, Byung-woo;Kim, Nam-young;Yu, Yun-seop
    • Journal of Practical Engineering Education
    • /
    • v.8 no.2
    • /
    • pp.111-120
    • /
    • 2016
  • Education equipment for field programmable gate array (FPGA) design of sensor-based IOT (Internet Of Thing) system is introduced. Because sensors have different interfaces, several types of interface controller on FPGA need. Using this equipment, several types of interface controller, which can control ADC (analog-to-digital converter) for analog sensor outputs and $I^2C$ (Inter-Integrated Circuit), SPI (Serial Peripheral Interface Bus), and GPIO (General-Purpose Input/Output) for digital sensor outputs, can be designed on FPGA. Image processing hardware using image sensors and display controller for real and image-processed images or videos can be design on FPGA chip. This equipment can design a SOC (System On Chip) consisting of a hard process core on Linux OS and a FPGA block for IOT system which can communicate with wire and wireless networks. Using the education equipment, an example of hardware design using image sensor and accelerometer is described, and an example of syllabus for "Digital system design using FPGA" course is introduced. Using the education equipment, students can develop the ability to design some hardware, and to train the ability for the creative capstone design through conceptual, partial-level, and detail designs.

A Study on 3D Character Design for Games (About Improvement efficiency with 2D Graphics) (3D Game 제작을 위한 Character Design에 관한 연구 (3D와 2D Graphics의 결합효율성에 관하여))

  • Cho, Dong-Min;Jung, Sung-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1310-1318
    • /
    • 2007
  • First of all, What was the modeling technique used to model 3D-Game character? It's a technique developed along several years, by experience... here is the bases Low polygons characters I always work in low polygon for two reasons -You can easily modify a low-poly character, change shapes, make morph for facial expressions etc -You can easily animate a low-poly character When the modeling is finished, Second, In these days, Computer hardware technologies have been bring about that expansion of various 3D digital motion pictured information and development. 3D digital techniques can be used to be diversity in Animation, Virtual-Reality, Movie, Advertisement, Game and so on. Besides, as computing power has been better and higher, the development of 3D Animations and Character are required gradually. In order to satisfy the requirement, Research about how to make 3D Game modeling that represents Character's emotions, sensibilities, is beginning to set its appearance. 3D characters in 3D Games are the core for the communications of emotion and the informations through their facial expression and characteristic motions, Sounds to Users. All concerning about 3D motion and facial expression are getting higher with extension of frequency in use. Therefore, in this study we suggest the effective method of modeling for 3D character and which are based on 2D Graphics.

  • PDF

OpenGL ES 1.1 Implementation Using OpenGL (OpenGL을 이용한 OpenGL ES 1.1 구현)

  • Lee, Hwan-Yong;Baek, Nak-Hoon
    • The KIPS Transactions:PartA
    • /
    • v.16A no.3
    • /
    • pp.159-168
    • /
    • 2009
  • In this paper, we present an efficient way of implementing OpenGL ES 1.1 standard for the environments with hardware-supported OpenGL API, such as desktop PCs. Although OpenGL ES was started from the existing OpenGL features, it becomes a new three-dimensional graphics library customized for embedded systems through introducing fixed-point arithmetic operations, buffer management with fixed-point data type supports, completely new texture mapping functionalities and others. Currently, it is the official three dimensional graphics library for Google Android, Apple iPhone, PlayStation3, etc. In this paper, we achieved improvements on the arithmetic operations for the fixed-point number representation, which is the most characteristic data type for OpenGL ES. For the conversion of fixed-point data types to the floating-point number representations for the underlying OpenGL, we show the way of efficient conversion processes even with satisfying OpenGL ES standard requirements. We also introduced a simple memory management scheme to mange the converted data for the buffer containing fixed-point numbers. In the case of texture processing, the requirements in both standards are quite different and thus we used completely new software-implementations. Our final implementation result of OpenGL ES library provides all of over than 200 functions in OpenGL ES 1.1 standard and completely passed its conformance test, to show its compliance with the standard. From the efficiency viewpoint, we measured its execution times for several OpenGL ES-specific application programs and achieved at most 33.147 times improvements, to become the fastest one among the OpenGL ES implementations in the same category.

Fast GPU Implementation for the Solution of Tridiagonal Matrix Systems (삼중대각행렬 시스템 풀이의 빠른 GPU 구현)

  • Kim, Yong-Hee;Lee, Sung-Kee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.692-704
    • /
    • 2005
  • With the improvement of computer hardware, GPUs(Graphics Processor Units) have tremendous memory bandwidth and computation power. This leads GPUs to use in general purpose computation. Especially, GPU implementation of compute-intensive physics based simulations is actively studied. In the solution of differential equations which are base of physics simulations, tridiagonal matrix systems occur repeatedly by finite-difference approximation. From the point of view of physics based simulations, fast solution of tridiagonal matrix system is important research field. We propose a fast GPU implementation for the solution of tridiagonal matrix systems. In this paper, we implement the cyclic reduction(also known as odd-even reduction) algorithm which is a popular choice for vector processors. We obtained a considerable performance improvement for solving tridiagonal matrix systems over Thomas method and conjugate gradient method. Thomas method is well known as a method for solving tridiagonal matrix systems on CPU and conjugate gradient method has shown good results on GPU. We experimented our proposed method by applying it to heat conduction, advection-diffusion, and shallow water simulations. The results of these simulations have shown a remarkable performance of over 35 frame-per-second on the 1024x1024 grid.

Technology to create a 360-degree panorama of a square room using a single projector and a hemispherical mirror (1대의 프로젝터와 반구형 반사경을 이용한 사각방 360도 파노라마 생성 기법)

  • Lee, Jung-jik;Park, Yoen-yong;Lee, Yun-sang;Lee, Jun-yuep;Jung, Eun-yeong;Yu, Rim;Kang, Myongjin;Jung, Moon-ryul
    • Journal of the Korea Computer Graphics Society
    • /
    • v.26 no.3
    • /
    • pp.133-142
    • /
    • 2020
  • In this research, we describe the method of implementing a 360-degree panorama using one projector, in terms of hardware and in the production of projected pre-distortion images. We propose a method of installing a projector and a reflector on the central ceiling of the space to minimize the shadows generated based on the position of the spectators. We used a virtual camera and virtual space where the projector and hemisphere positions were set to the same as in the exhibition space in Unity. After the image projected on the screen was mapped on the wall of the virtual space, the pre-distortion image was created by the method of capturing from the virtual camera using the ray tracing technique. When the produced pre-distortion image is hemispherical reflected and projected by the projector installed at the same position as the virtual camera, the image is reflected and projected 360 degrees on the panoramic screen.

A Novel Cooperative Warp and Thread Block Scheduling Technique for Improving the GPGPU Resource Utilization (GPGPU 자원 활용 개선을 위한 블록 지연시간 기반 워프 스케줄링 기법)

  • Thuan, Do Cong;Choi, Yong;Kim, Jong Myon;Kim, Cheol Hong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.5
    • /
    • pp.219-230
    • /
    • 2017
  • General-Purpose Graphics Processing Units (GPGPUs) build massively parallel architecture and apply multithreading technology to explore parallelism. By using programming models like CUDA, and OpenCL, GPGPUs are becoming the best in exploiting plentiful thread-level parallelism caused by parallel applications. Unfortunately, modern GPGPU cannot efficiently utilize its available hardware resources for numerous general-purpose applications. One of the primary reasons is the inefficiency of existing warp/thread block schedulers in hiding long latency instructions, resulting in lost opportunity to improve the performance. This paper studies the effects of hardware thread scheduling policy on GPGPU performance. We propose a novel warp scheduling policy that can alleviate the drawbacks of the traditional round-robin policy. The proposed warp scheduler first classifies the warps of a thread block into two groups, warps with long latency and warps with short latency and then schedules the warps with long latency before the warps with short latency. Furthermore, to support the proposed warp scheduler, we also propose a supplemental technique that can dynamically reduce the number of streaming multiprocessors to which will be assigned thread blocks when encountering a high contention degree at the memory and interconnection network. Based on our experiments on a 15-streaming multiprocessor GPGPU platform, the proposed warp scheduling policy provides an average IPC improvement of 7.5% over the baseline round-robin warp scheduling policy. This paper also shows that the GPGPU performance can be improved by approximately 8.9% on average when the two proposed techniques are combined.

Medical Image Compression Using JPEG International Standard (JPEG 표준안을 이용한 의료 영상 압축)

  • Ahn, Chang-Beom;Han, Sang-Woo;Kim, Il-Yoen
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.504-506
    • /
    • 1993
  • The Joint Photographic Experts Group (JPEG) standard was proposed by the International Standardization Organization (ISO/SC 29/WG 10) and the CCITT SG VIII as an international standard for digital continuous-tone still image compression. The JPEG standard has been widely accepted in electronic imaging, computer graphics, and multi-media applications, however, due to the lossy character of the JPEG compression its application in the field of medical imaging has been limited. In this paper, the JPEG standard was applied to a series of head sections of magnetic resonance (MR) images (256 gray levels, $256{\times}256$ size) and its performance was investigated. For this purpose, DCT-based sequential mode of the JPEG standard was implemented using the CL550 compression chip and progressive and lossless coding was implemented by software without additional hardware. From the experiment, it appears that the compression ratio of about 10 to 20 was obtained for the MR images without noticeable distortion. It is also noted that the error signal between the reconstructed image by the JPEG and the original image was nearly random noise without causing any special-pattern-related artifact. Although the coding efficiency of the progressive and hierarchical coding is identical to that of the sequential coding in compression ratio and SNR, it has useful features In fast search of patient Image from huge image data base and in remote diagnosis through slow public communication channel.

  • PDF