• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.442-460
• /
• 2001

In video-on-demand(VOD) systems it is important to minimize initial latency and memory requirements. The minimization of initial latency enables the system to provide services with short response time, and the minimization of memory requirements enables the system to service more concurrent user requests with the same amount of memory. In VOD systems, since initial latency and memory requirement increase according to the increment of buffer size allocated to user requests, the buffer size allocated to user requests must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that thy system is in fully loaded state. Thus, when the system is in partially loaded state, the scheme allocates user requests unnecessarily large buffers. This paper proposes a dynamics buffer allocation scheme that allocates user requests the minimum buffer size in fully loaded state as well as a partially loaded state. This scheme dynamically determines the buffer size based on the number of user requests in service and the number of user requests arriving while servicing current requests. In addition, through analyses and simulations, this paper validates that the dynamics buffer allocation outperforms the statics buffer allocation in initial latency and the number of concurrent user requests that can be supported. Our simulation results show that, in proportion to the static buffer allocation scheme, the dynamic buffer allocation scheme reduces the average initial latency by 29%~65%, and in a systems having several disks. increases the average number of concurrent user requests by 48%~68%. Our results show that the dynamic buffer allocation scheme significantly improves the performance and reduce the capacity requirements of VOD systems.

• Journal of KIISE:Software and Applications
• /
• v.28 no.3
• /
• pp.211-223
• /
• 2001

본 논문에서 제안하는 시나리오기반 검증기법의 목적은 UML로 작성된 객체지향 분석모델의 완전성 및 일관성을 진단하는 것이다. 검증기법의 전체 절차는 요구분석을 위한 Use Case 모델링 과정에서 생성되는 Use Case 시나리오와 UML 분석모델로부터 역공학적 방법으로 도출된 객체행위 시나리오와의 상호참조과정 및 시나리오 정보트리 추적과정을 이용하여 단계적으로 수행된다. 본 검증절차를 위하여 우선, UML로 작성된 객체지향 분석모델들은 우선 정형명세언어를 사용하여 Use Case 정형명세로 변환하다. 그 다음에, Use Case 정형명세로부터 해당 Use Case 내의 객체의 정적구조를 표현하는 시나리오 정보트리를 구축하고, Use Case 정형명세 내에 포함되어 있는 객체 동적행위 정보인 메시지 순차에 따라 개별 시나리오흐름을 시나리오 정보트리에 표현한다. 마지막으로 시나리오 정보트리 추적과 시나리오 정보 테이블 참조과정을 중심으로 완전성 및 일관성 검증작업을 수행한다. 즉, 검증하고자 하는 해당 Use Case의 시나리오 정보트리를 이용한 시나리오 추적과정을 통해 생성되는 객체행위 시나리오와 요구분석 과정에서 도출되는 Use Case 시나리오와의 일치여부를 조사하여 분석모델과 사용자 요구사양과의 완전성을 검사한다. 그리고, 시나리오 추적과정을 통해 수집되는 시나리오 관련종보들을 가지고 시나리오 정보 테이블을 작성한 후, 분석과정에서 작성된 클래스 관련정보들의 시나리오 포함 여부를 확인하여 분석모델의 일관성을 검사한다. 한편, 본 논문에서 제안하는 검증기법의 효용성을 증명하기 위해 대학의 수강등록시스템 개발을 위해 UML을 이용해 작성된 분석모델을 특정한 사례로써 적용하여 보았다. 프로세싱 오버헤드 및 메모리와 대역폭 요구량 측면에서 MARS 모델보다 유리함을 알 수 있었다.과는 본 논문에서 제안된 프리페칭 기법이 효율적으로 peak bandwidth를 줄일 수 있다는 것을 나타낸다.ore complicate such a prediction. Although these overestimation sources have been attacked in many existing analysis techniques, we cannot find in the literature any description about questions like which one is most important. Thus, in this paper, we quantitatively analyze the impacts of overestimation sources on the accuracy of the worst case timing analysis. Using the results, we can identify dominant overestimation sources that should be analyzed more accurately to get tighter WCET estimations. To make our method independent of any existing analysis techniques, we use simulation based methodology. We have implemented a MIPS R3000 simulator equipped with several switches, each of which determines the accuracy level of the

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.1
• /
• pp.1-10
• /
• 2012

The way-lookup cache and the way-tracking cache are considered to be the most energy-efficient when used for level 1 and level 2 caches, respectively. This paper proposes an energy-efficient set-associative cache using the bi-mode way-selector that combines the way selecting techniques of the way-tracking cache and the way-lookup cache. The simulation results using an Alpha 21264-based system show that the bi-mode way-selecting L1 instruction cache consumes 27.57% of the energy consumed by the conventional set-associative cache and that it is as energy-efficient as the way-lookup cache when used for L1 instruction cache. The bi-mode way-selecting L1 data cache consumes 28.42% of the energy consumed by the conventional set-associative cache, which means that it is more energy-efficient than the way-lookup cache by 15.54% when used for L1 data cache. The bi-mode way-selecting L2 cache consumes 15.41% of the energy consumed by the conventional set-associative cache, which means that it is more energy-efficient than the way-tracking cache by 16.16% when used for unified L2 cache. These results show that the proposed cache can provide the best level of energy-efficiency regardless of the cache level.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.26-32
• /
• 2009

The multi-level storage architecture has been widely adopted in servers and data centers. However, while prefetching has been shown as a crucial technique to exploit sequentiality in accesses common for such systems and hide the increasing relative cost of disk I/O, existing multi-level storage studies have focused mostly on cache replacement strategies. In this paper, we show that prefetching algorithms designed for single-level systems may have their limitations magnified when applied to multi-level systems. Overly conservative prefetching will not be able to effectively use the lower-level cache space, while overly aggressive prefetching will be compounded across levels and generate large amounts of wasted prefetch. We design and implement a hierarchy-aware lower-level prefetching strategy called PMS(Prefetching strategy for Multi-level Storage system) that applicable to any upper level prefetching algorithms. PMS does not require any application hints, a priori knowledge from the application or modification to the va interface. Instead, it monitors the upper-level access patterns as well as the lower-level cache status, and dynamically adjusts the aggressiveness of the lower-level prefetching activities. We evaluated the PMS through extensive simulation studies using a verified multi-level storage simulator, an accurate disk simulator, and access traces with different access patterns. Our results indicate that PMS dynamically controls aggressiveness of lower-level prefetching in reaction to multiple system and workload parameters, improving the overall system performance in all 32 test cases. Working with four well-known existing prefetching algorithms adopted in real systems, PMS obtains an improvement of up to 35% for the average request response time, with an average improvement of 16.56% over all cases.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.4
• /
• pp.125-135
• /
• 2009

Owing to its fast computing capability for fusing images, the FIHS(Fast Intensity Hue Saturation) fusion is widely used for fusion purposes. However, the FIHS fusion also distorts color in the same way such as the IHS(Intensity Hue Saturation) fusion technique. In this paper, a FIHS fusion technique(FIHS-BR) which reduces color distortion by using the ratio of each spectral band and an adaptive FIHS fusion(FIHS-SABR) using spatial information and the ratio of each spectral band are proposed. The proposed FIHS-BR fusion reduces color distortion by adding different spatial detail improvement values for each spectral band. The spatial detail improvement values are derived from the ratio of spectral band. And the proposed FIHS-SABR fusion reduces more color distortion by readjusting the spatial detail improvement values for each spectral band according to the ratio of the spectral bands. The spatial detail improvement values are derived adaptively from the characteristics of spatial information of the local image. To evaluate the performance of the proposed FIHS-BR fusion and FIHS-SABR fusion, a computer simulation is performed for IKONOS remote sensing image. Results from the experiments show that the proposed methods have less color distortion for the forest regions which reveal severe color distortion in the traditional FIHS fusion. From the evaluation results of the characteristics of spectral information for fused image, we show that the proposed methods have best results.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.4
• /
• pp.12-19
• /
• 2014

A signal plan focused on vehicle traffic could easily overlook vulnerable priority signals, although the importance of vulnerable movements is increasingly recognized in recent years. Especially, the vulnerable are sometimes faced with dangerous situations when crossing roads with a signal plan based on design values of average, non-vulnerable persons. This study is focused on how to minimize the vehicle delay while simultaneously considering traffic flow and providing traffic safety by increasing road crossing time for pedestrians. For this purpose, a priority signal control strategy for the vulnerable, considering vehicle traffic flow, has been tested. Practical implication and a microscopic computer simulation has shown that the proposed method could provide a small decrease (about 6.2%) in pedestrian delay, a small increase (about 8.5~13.3%) in travel speed of passing traffic, and a considerable decrease (16.2~26.9%) in vehicle travel time. These findings suggest that the proposed signal control strategy could increase pedestrian safety and diminish delay of vehicle travel.

• Korean Journal of Optics and Photonics
• /
• v.17 no.5
• /
• pp.383-390
• /
• 2006

The SharkHartmann wavefront sensors are the most popular devices to measure wavefront in the field of adaptive optics. The Shack-Hartmann sensors measure the centroids of spot irradiance distribution formed by each corresponding micro-lens. The centroids are linearly proportional to the local mean slopes of the wavefront defined within the corresponding sub-aperture. The wavefront is then reconstructed from the evaluated local mean slopes. The uncertainty of the Shack-Hartmann sensor is caused by various factors including the detector noise, the limited size of the detector, the magnitude and profile of spot irradiance distribution, etc. This paper investigates the noise propagation in two major centroid evaluation algorithms through computer simulation; 1st order moments of the irradiance algorithms i.e. center of gravity algorithm, and correlation algorithm. First, the center of gravity algorithm is shown to have relatively large dependence on the magnitudes of noises and the shape & size of irradiance sidelobes, whose effects are also shown to be minimized by optimal thresholding. Second, the correlation algorithm is shown to be robust over those effects, while its measurement accuracy is vulnerable to the size variation of the reference spot. The investigation is finally confirmed by experimental measurements of defocus wavefront aberrations using a Shack-Hartmann sensor using those two algorithms.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.11
• /
• pp.263-270
• /
• 2019

Vehicular cloud computing is a new emerging technology that can provide drivers with cloud services to enable various vehicular applications. A vehicular cloud is defined as a set of vehicles that share their own resources. Vehicles should collaborate with each other to construct vehicular clouds through vehicle-to-vehicle communications. Since collaborating vehicles to construct the vehicular cloud have different speeds, directions and locations respectively, the vehicular cloud is constructed in multi-hop communication range. Due to intermittent wireless connectivity and low density of vehicles with the limited resources, the construction of vehicular cloud with multi-hop communications has become challenging in vehicular environments in terms of the service success ratio, the service delay, and the transmitted packet number. Thus, we propose a multi-hop vehicular cloud construction protocol that increases the service success ratio and decreases the service delay and the transmitted packet number. The proposed protocol uses a connection time-based intermediate vehicle selection scheme to reduce the cloud failure probability of multi-hop vehicular cloud. Simulation results conducted in various environments verify that the proposed protocol achieves better performance than the existing protocol.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.12
• /
• pp.301-312
• /
• 2018

In industrial wireless sensor networks, the continuous object detection such as fire or toxic gas detection is one of major applications. A continuous object occurs at a specific point and then diffuses over a wide area. Therefore, many studies have focused on accurately detecting a continuous object and delivering data to a static sink with an energy-efficient way. Recently, some applications such as fire suppression require mobile sinks to provide real-time response. However, the sink mobility support in continuous object detection brings challenging issues. The existing approaches supporting sink mobility are designed for individual object detection, so they establish one-to-one communication between a source and a mobile sink for location update. But these approaches are not appropriate for a continuous object detection since a mobile sink should establish one-to-many communication with all sources. The one-to-many communication increases energy consumption and thus shortens the network lifetime. In this paper, we propose the origin-centric communication scheme to support sink mobility in a continuous object detection. Simulation results verify that the proposed scheme surpasses all the other work in terms of energy consumption.

• Journal of Energy Engineering
• /
• v.27 no.4
• /
• pp.103-110
• /
• 2018

In this paper, we introduce evaluation method of time series prediction model with new approach of Mean Absolute Percentage Error(hereafter MAPE) and Symmetric Mean Absolute Percentage Error(hereafter sMAPE). There are some problems using MAPE and sMAPE. First MAPE can't evaluate Zero observation of dataset. Moreover, when the observed value is very close to zero it evaluate heavier than other methods. Finally it evaluate different measure even same error between observations and predicted values. And sMAPE does different evaluations are made depending on whether the same error value is over-predicted or under-predicted. And it has different measurement according to the each sign, even if error is the same distance. These problems were solved by Maximum Mean Absolute Percentage Error(hereafter mMAPE). we used the absolute maximum of observed value as denominator instead of the observed value in MAPE, when the value is less than 1, removed denominator then solved the problem that the zero value is not defined. and were able to prevent heavier measurement problem. Also, if the absolute maximum of observed value is greater than 1, the evaluation values of mMAPE were compared with those of the other evaluations. With Beijing PM2.5 temperature data and our simulation data, we compared the evaluation values of mMAPE with other evaluations. And we proved that mMAPE can solve the problems that we mentioned.