• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.609-612
• /
• 2003

하드웨어의 성능 및 처리속도의 급격한 증가와 그래픽 개발 환경의 다양한 발전은 사용자들에게 화려한 영상을 제공하고 있으며 영화, 게임, 가상현실, 의료영상 등에서 제공되는 3차원 그래픽스 애니메이션은 그 현실감을 날로 더해가고 있는 실정이다. 파티클 시스템이란 아주 많은 입자들을 생성하여 운동법칙에 따라 이동하도록 하여 불꽃, 폭발, 분수 등의 여러 가지 현상을 나타내는데 이용하는 기술이다. 본 논문에서는 입자를 다루기 위해 파티클 시스템 API를 이용하여 메모리의 절약, 계산 시간의 단축 등을 통해 하드웨어적인 제약을 극복할 수 있으며, 효과적으로 여러 가지 자연현상 즉, 특수효과를 구현한다.

• Journal of Internet Computing and Services
• /
• v.4 no.5
• /
• pp.77-86
• /
• 2003

This paper introduces the extension of SIP protocol for Multiparty Conference and the implementation of IP-based Multi-Conference. SIP protocol is a signaling protocol for initiating, modifying and terminating interactive sessions (voice, video, text, application). Multiparty conference system is implemented by RTP protocol for real time transmission and by H.323 for call setup. As H.323 fits into PSTN, it has some problems (call setup delay, hard implementation) for IP applications. IETF developed SIP protocol used for signaling in IP networks. However this SIP protocol doesn't explain signal protocol about multimedia conference, which is different from the existing H.323. So this paper describes the extension of SIP according to SIP Specification and case study for the multimedia conference.

• Journal of IKEEE
• /
• v.19 no.3
• /
• pp.357-365
• /
• 2015

Recently, embedded systems such as aircraft and automobilie, are developed as modular architecture instead of federated architecture because of SWaP(Size, Weight and Power) issues. In addition, partition operating system that support multiple logical node based on partition concept were recently appeared. Distributed recovery block is fault tolerance design scheme that applicable to mission critical real-time system to support real-time take over via real-time synchronization between participated nodes. Because of real-time synchronization, single-core based computer is not suitable for partition based distributed recovery block design scheme. Multi-core and AMP(Asymmetric Multi-Processing) based partition architecture is required to apply distributed recovery block design scheme. In this paper, we proposed design scheme of distributed recovery block on the multi-core based supervised-AMP architecture partition operating system. This paper implements flight control simulator for avionics to check feasibility of our design scheme.

• Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.94-102
• /
• 2003

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.177-182
• /
• 2015

The era of multi-core processors has begun since the limit of the clock speed has been reached. These days, multi-core technology is used not only in desktops, servers, and table PCs, but also in smartphones. In this architecture, there is always interference between processes, because of the sharing of system resources. To address this problem, cache partitioning is used, which can be roughly divided into two types: software and hardware cache partitioning. When it comes to dynamic cache partitioning, hardware cache partitioning is superior to software cache partitioning, because it needs no page copy. In this paper, we compare the effectiveness of hardware and software cache partitioning on the AMD Opteron 6282 SE, which is the only commodity processor providing hardware cache partitioning, to see whether this technique can be effectively deployed in dynamic environments.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.52-63
• /
• 2009

The problem of scheduling simply periodic task systems upon a uniform multiprocessor is considered. Partitioning of periodic task systems requires solving the bin-packing problem, which is known to be intractable (NP-hard in the strong sense). This paper presents a global scheduling algorithm which transforms a given simply periodic task system into another using a "task-splitting" technique. Each transformed simply periodic task system is guaranteed to be successfully scheduled upon any uniform multiprocessor using a partitioned scheduling algorithm. It is proven that the proposed algorithm achieves the theoretical maximum utilization bound upon any uniform multiprocessor platform.

• Journal of Korea Multimedia Society
• /
• v.10 no.8
• /
• pp.1060-1067
• /
• 2007

We need various methods to develop MMORPG that is game genre which many users use among various game genre using Internet. Specially, to heighten efficiency of distributing work, Object-oriented language such as C++ is used and we need design techniques that can take advantage of enough object-oriented concept when making large-scale game. There is various pattern that can apply in software breakup design in GoF's design pattern for these design techniques. If you apply Observer pattern to Party System Design for forming community between game users, you can easily add new class and maintain system later. Party Play is one of the important system that is used to form game users' community in MMORPG games. The main point that must be considered in Party-Play-System is to divide evenly experience value and acquisition that is got by Party-Play among users according to each user's level. To implement Party Play System that consider maintenance of system, in this paper, we propose a method using GoF's Observer-Pattern, showing you that proposed method which has advantage to dynamic memory allocation and to virtual method call can be used usefully to change object to real time at program run and to add new class and to maintain system new.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1824-1837
• /
• 1994

Broadband ISDN will support advanced communication services such as multimedia conference, VOD and electronic news service. Because many of these advanced services require multimedia data delivery, future communication networks must have flexible and efficient multiparty communications capabilities. In this paper we propose a new multicasting method which uses packer filtering capabilities both in a physical network and in a logical network layers. This new scheme has potential to reduce the transmission and packet processing overheads of multicast communications. For the new multicasting method, we develop a group matching algorithm which finds a suitable set of groups that covers multiple target hosts. We show the application of the multicasting method and the group matching algorithm with two simple examoles.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.5
• /
• pp.139-146
• /
• 2022

With the recent development of the Internet of Things (IoT) and the convergence of vehicles and IT technologies, high-performance applications such as autonomous driving are emerging, and multi-access edge computing (MEC) has attracted lots of attentions as next-generation technologies. In order to provide service to these computation-intensive tasks in low latency, many methods have been proposed to partition tasks so that they can be performed through cooperation of multiple MEC servers(MECSs). Conventional methods related to task partitioning have proposed methods for partitioning tasks on vehicles as mobile devices and offloading them to multiple MECSs, and methods for offloading them from vehicles to MECSs and then partitioning and migrating them to other MECSs. In this paper, the performance of task partitioning methods using offloading and migration is compared and analyzed in terms of service delay, blocking rate and energy consumption according to the method of selecting partitioning targets and the number of partitioning. As the number of partitioning increases, the performance of the service delay improves, but the performance of the blocking rate and energy consumption decreases.

• The Journal of the Korea Contents Association
• /
• v.12 no.5
• /
• pp.62-69
• /
• 2012

The newly developed field of media art is quickly making progress to include various and up-to-date forms of expression. Unlike in traditional art, the communication between the art and the viewer has become vastly important, in which the viewer is an active agent who participates and interacts with the artwork. These digital artworks can now be readily observed in everyday places and things, rather than being confined solely in the gallery space. By encouraging open interaction with the public, media art has become more accessible. Accordingly, this thesis examines the construction of a real-time multimedia clock piece using particle systems. Time has always been a significant theme in the realm of traditional art, which continues to be explored extensively in various forms of expression. In an attempt to express the continuity of time and the state of being value of existence based on technological skills, the thesis presents an artwork that uses the popular medium of a clock while also providing both usability and emotional satisfaction for the viewer's sensibility through interaction.