• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.327-332
• /
• 2007

An engineering design problem involving Multi-Disciplinary Analysis(MDA) generally requires a large amounts of CPU time for the entire design process, and therefore Multiple Processing System (MPS) are essential to reduce the completion time. However, when applying conventional parallel processing techniques, all of the CAE S/W required for the MDA should be installed on all the servers making up NIPS because of characteristic of MDA and it would be a great expense in CAE S/W licenses. To solve this problem, we propose a Weight-based Multiqueue Load Balancing algorithm for a heterogeneous MPS where performance of servers and CAE S/W installed on each server are different of each other. To validate the performance, a computational experiments comparing the First Come First Serve algorithm and our proposed algorithm was accomplished.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.107-118
• /
• 2007

A single-server queueing model with infinite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of an accepted batch arrive one-by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. Analysis of the joint distribution of the number batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. Effect of control on the main performance measures of the system is demonstrated numerically.

• Journal of the Korea Society for Simulation
• /
• v.12 no.2
• /
• pp.55-62
• /
• 2003

The explosive Increase of wireless networks and the advancement of mobile devices lead to the expansion of mobile environment. In accordance with the development of mobile environment, the need to use mobile database is increased sharply, and also it accompanies the related problems. The current mobile database system is based on the centralized method from which a synchronized server manages multiple mobile database management system to synchronize. From this mobile system architecture, several kinds of problems can be detected such as the management of synchronization issues between mobile databases and the transaction management issues. Furthermore, the current mobile database management system does not consider any solution on the fault tolerance. To solve those problems, this paper proposes the mobile agent-based mobile database management system. The proposed system provide high confidence and efficiency by enhancing the network efficiency and fault tolerance through the mobile grouping.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.5 no.4
• /
• pp.270-275
• /
• 2005

As the features of mobile phones are being enhanced and the performance is being greatly improved, the generic operating systems are being incrementally used in mobile phones. However, since the mobile phones have different requirements in both features and performance compared with desktop or server systems, the operating systems for generic systems could not be used without customization and modification. This case study paper describes the design and implementation of a Linux-based smartphone hardware and software. The enhancements and additional implementations in both kernel and middleware layers are explained. As an experiment, the power consumption of the implemented mobile phone under a number of user scenarios has been measured.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.12-17
• /
• 2008

In this paper, the 128bit AES block cipher algorithm OCB (Offset Code Book) mode for privacy and authenticity of high speed packet data was efficiently designed in C language level and was optimized to support the required capacity of contents server using high performance DSP. It is known that OCB mode is about two times faster than CBC-MAC mode. As an experimental result, the encryption / decryption speed of the implemented block cipher was 308Mbps, 311 Mbps respectively at 1GHz clock speed, which is 50% faster than a general design with 3.5% more memory usage.

• Publications of The Korean Astronomical Society
• /
• v.26 no.1
• /
• pp.37-44
• /
• 2011

We constructed a photometric database system which is optimally designed for microlensing events from KMTNet (Korea Microlensing Telescope Network) observation. We developed a framework software for the convenience of archiving, uploading, searching, and downloading of processed photometric data. From various tests for optimal data archiving engines, we found that the MyISAM storage engine shows the best performance. For the high performance of database system, data types of each field are carefully suggested from various combinations of tests especially to correct round-off errors. The developed framework provides the convenience of access to the database server using query forms via web pages, and displays the light curve of selected target for a quick view.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.103-110
• /
• 2004

In this paper we study and analyze the influence of caching strategies on the performance of WWW servers, We propose a new strategy called file type based caching that aims to obtain a well-balanced mixture between large and small files in the cache, and moreover, it provides good performance for both small and large file as expected, By using the type based caching good results are obtained for both the hit rate and the byte hit rate.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.408-411
• /
• 2006

Currently, the nano economy threatens the mass economy. This is based on the internet business models. In the nano business models based on internet, the diversely personalized services are needed. Many researches of the personalization on the web have been studied. The web usage mining using click stream data is a tool for personalization model. In this paper, we propose an internet business model using evolutionary support vector machine and web response survey as a web usage mining. After analyzing click stream data for web usage mining, a personalized service model is constructed in our work. Also, using an approach of web response survey, we improve the performance of the customers' satisfaction. From the experimental results, we verify the performance of proposed model using two data sets from KDD Cup 2000 and our web server.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.79-84
• /
• 2023

Due to the rapid performance improvement of smartphones, multitasking on mobile platforms has become an essential feature. Unlike traditional desktop or server environments, mobile applications are mostly interactive jobs where response time is important, and some applications are classified as real-time jobs with deadlines. When interactive and real-time jobs run concurrently, memory allocation between multitasking applications is a challenging issue as they have different time requirements. In this paper, we study how to allocate memory space when real-time and interactive jobs are simultaneously executed in a smartphone to meet the multitasking requirements between heterogeneous jobs. Specifically, we analyze the memory size required to satisfy the constraints of real-time jobs and present a new model for allocating memory space between heterogeneous multitasking jobs. Trace-driven simulations show that the proposed model provides reasonable performance for interactive jobs while guaranteeing the requirement of real-time jobs.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.207-208
• /
• 2009

Peer-to-Peer (P2P) network has great potential on utilizing the network while reducing the server loads. Video on Demand (VoD) has become widely used since we can watch contents we like without having to download the overall file first. The mobile users may not need high quality of video; they only need good enough quality that can be played in the limited resource of physical device and network. So does with the devices with very limited network bandwidth. These issues emerge an idea of allowing Free-Rider in the P2P VoD system, where those low performance devices will only optimize the network utilization, affecting none to the performance of main system.