• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.123-140
• /
• 2011

In this paper, we propose an Energy Efficient Media Access Control (EE-MAC) protocol for wireless sensor networks. The proposed scheme is designed to save power consumption and guarantee quality-of-service for real-time traffic. EE-MAC uses the superframe structure which is bounded by the transmission of a beacon frame and can have an active and an inactive portion. The active period is divided into the contention free period (CFP) for real-time traffic transmission and the contention access period (CAP) for non-real-time traffic transmission. We propose the exclusively allocated backoff scheme which assigns a unique backoff time value to each real-time node based on bandwidth allocation and admission control. This scheme can avoid collision between real-time nodes by controlling distributed fashion and take effect a statistical time division multiple access. We also propose the algorithm to change the duty cycle adaptively according to channel utilization of media depending on network traffic load. This algorithm can prolong network lifetime by reducing the amount of energy wasted on idle listening.

• Journal of Welding and Joining
• /
• v.15 no.5
• /
• pp.84-91
• /
• 1997

The metal transfer phenomenon of the pulsed-GMAW is simulated by formulating the electromagnetic force incorporated with the Volume of Fluid algorithm. The free surface profiles, pressure and velocity distributions within the drop are computed numerically. Axial velocity and acceleration generated during peak current period are found to have a significant effect on drop detachment. Therefore, the accelerated inertia force becomes one of important factors affecting metal transfer in the pulsed-GMAW. When the pulse current parameters are selected properly, the molten drop is detached just after current pulse, and the operating range of the pulsing frequency increases with higher peak current and duty cycle. Calculated operating ranges show reasonably good agreements with the available experimental data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.22-34
• /
• 2002

In this paper, we consider ring embeding problem in faulty (n,k) star graphs which is recently proposed as an alternative interconnection network topology, By effectively utilizing such strategies as series of dimension expansions and even distribution of faulty nodes into sub-stars in graph itself. we prove that it is possible to construct a maximal fault-free ring excluding only faulty nodes when the number of faults is no more than n-3 and $n-k{\geq}2$, and also propose an algorithm which can embed the corresponding ring in (n.k)-star graphs This results will be applied into the multicasting applications that the underlying cycle properties on the multi-computer system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5307-5327
• /
• 2016

Restricted by finite battery energy, traditional wireless sensor networks (WSNs) can only maintain for a limited period of time, resulting in serious performance bottleneck in long-term deployment of WSN. Fortunately, the advancement in the wireless energy transfer technology provides a potential to free WSNs from limited energy supply and remain perpetual operational. A mobile charger called wireless charging vehicle (WCV) is employed to periodically charge each sensor node and keep its energy level above the minimum threshold. Aiming at maximizing the ratio of the WCV's vocation time over the cycle time as well as guaranteeing the perpetual operation of networks, we propose a feasible and optimal solution to this issue within the context of a real-time large-scale deployed WSN. First, we develop two different types of charging cycles: initialization cycles and renewable cycles and give relevant algorithms to construct these two cycles for each sensor node. We then formulate the optimization problem into an optimal construction algorithm and prove its correctness through theoretical analysis. Finally, we conduct extensive simulations to demonstrate the effectiveness of our proposed algorithms.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.355-364
• /
• 2005

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

• Korean Journal of Remote Sensing
• /
• v.37 no.6_1
• /
• pp.1545-1557
• /
• 2021

Crops show sensitive spectral characteristics according to their species and growth conditions and although frequent observation is required especially in summer, it is difficult to utilize optical satellite images due to the rainy season. To solve this problem, Constrained Cloud-Maximum Normalized difference vegetation index Composite (CC-MNC) algorithm was developed to generate periodic composite images with minimal cloud effect. In thisstudy, using this method, monthly Sentinel-2A/B Normalized Difference Vegetation Index (NDVI) composite images were produced for paddies and high-latitude cabbage fields from 2019 to 2021. In August 2020, which received 200mm more precipitation than other periods, the effect of clouds, was also significant in MODIS NDVI 16-day composite product. Except for this period, the CC-MNC method was able to reduce the cloud ratio of 45.4% of the original daily image to 14.9%. In the case of rice paddy, there was no significant difference between Sentinel-2A/B and MODIS NDVI values. In addition, it was possible to monitor the rice growth cycle well even with a revisit cycle 5 days. In the case of high-latitude cabbage fields, Sentinel-2A/B showed the short growth cycle of cabbage well, but MODIS showed limitations in spatial resolution. In addition, the CC-MNC method showed that cloud pixels were used for compositing at the harvest time, suggesting that the View Zenith Angle (VZA) threshold needsto be adjusted according to the domestic region.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.413-420
• /
• 2006

Most vendors of digital signal processors (DSPs) support a Harvard architecture, which has two or more memory buses, one for program and one or more for data and allow the processor to access multiple words of data from memory in a single instruction cycle. We already addressed how to efficiently assign data to multi-memory banks in our previous work. This paper reports on our recent attempt to optimize run-time memory. The run-time environment for dual data memory banks (DBMBs) requires two run-time stacks to control activation records located in two memory banks corresponding to calling procedures. However, activation records of two memory banks for a procedure are able to have different size. As a consequence, dual run-time stacks can be unbalanced whenever a procedure is called. This unbalance between two memory banks causes that usage of one memory bank can exceed the extent of on-chip memory area although there is free area in the other memory bank. We attempt balancing dual run-time slacks to enhance efficiently utilization of on-chip memory in this paper. The experimental results have revealed that although our algorithm is relatively quite simple, it still can utilize run-time memories efficiently; thus enabling our compiler to run extremely fast, yet minimizing the usage of un-time memory in the target code.

• Journal of Korean Society of Transportation
• /
• v.33 no.5
• /
• pp.478-487
• /
• 2015

This study proposed a Variable Speed Limits(VSL) algorithm to use traffic information based on Cumulative Demand-Capacity Analysis and evaluated its performance. According to the analysis result, the total of delay consisted of 3 separate parts. There was no change in total travel time although the total of delay decreased. These effects was analysed theoretically and then, evaluated through VISSIM, a microscopic simulator. VISSIM simulation results show almost same as those of theoretical analysis. Furthermore in SSAM analysis with VISSIM simulation log, the number of high risk collisions decreased 36.0 %. However, the total delay decrease effect is not real meaning of decrease effect because the drivers' desired speed is same whether the VSL model is operated or not. Nevertheless this VSL model maintains free flow speed for longer and increases the cycle of traffic speed fluctuation. In other words, this is decrease of delay occurrence and scale. The decrease of speed gap between upstream and downstream stabilizes the traffic flow and leads decrease number of high risk collision. In conclusion, we can expect increase of safety through total delay minimization according to this VSL model.