• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.1-8
• /
• 2018

In this paper, we propose an adaptive partition cache replacement policy and evaluate the performance of our scheme using various monitoring ratios to help lifetime extension of non-volatile main memory systems without performance degradation. The proposal combines conventional LRU (Least Recently Used) replacement policy and Early Eviction Zone (E2Z), which considers a dirty bit as well as LRU bits to select a candidate block. In particular, this paper shows the performance of non-volatile memory using various monitoring ratios and determines optimized monitoring ratio and partition size of E2Z for reducing the number of writebacks using cache hit counter logic and hit predictor. In the experiment evaluation, we showed that 1:128 combination provided the best results of writebacks and runtime, in terms of performance and complexity trade-off relation, and our proposal yielded up to 42% reduction of writebacks, compared with others.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.445-450
• /
• 2007

본 논문에서는 "확률적 배낭(stochastic knapsack)" 문제에 대하여 잘 알려진 Complete Sharing(CS), Complete Partitioning(CP)이 트래픽 특성에 따라 성능의 차이가 나타난다는 약점과 각 정책(policy)들의 평균 성능에 대한 최적 파라미터들을 트래픽 특성에 따라 결정하여야 한다는 약점을 보완하는 모델에 근거한 "Parallel Rollout(PR)"에 기초한 적응적인 정책(adaptive policy)을 제안한다. 주어진 트래픽 모델을 병합한 확률적 배낭 문제를 마코프 결정 과정(Markov Decision Process, MDP)으로 모델링하고, 마코프 결정 과정상에서 기존의 주어진 정책들을 PR 기법을 적용, 하나의 정책으로 융합하고 그 정책이 기존의 주어진 어떤 정책보다도 성능이 같거나 더 뛰어나다는 이론적 근거를 실험을 통하여 확인한다.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.429-438
• /
• 2004

This Paper Presents the control structure for incoming traffic from arbitrary node to Provide admission control in policy-based W network management structure using fuzzy logic control approach. The proposed control structure uses scheme for deciding network resource allocation depending on requirements predefined-policies and network states. The proposed scheme enhances policy adapting methods of existing binary methods, and can use resource of network more effectively to provide adaptive admission control, according to the unpredictable network states for predefined QoS policies. Simulation results show that the proposed controller improves the ratio of packet rejection up to 26%, because it Performs the soft adaption based on the network states instead of accept/reject action in conventional CAC(Connection Admission Controller).

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.783-788
• /
• 2002

Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) are applying stricter drop precedence than that of RIO algorithm. Especially, the ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. And we executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying strict drop precedence policy, we get better performance on priority levels. The results show that the proposed algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than RIO and the NCPD algorithm.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.401-406
• /
• 2013

In this paper, the optimum transmission method is proposed to save the energy and to increase the throughput of the adaptive modulation mobile radio system with frame length control. Traditionally, adaptive modulation has been used to improve the throughput using the power margin of the system design. Considering the frame length vs energy saving and adaptive modulation, the optimum transmission method is proposed for hub and mobile station each.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.5
• /
• pp.205-216
• /
• 2020

This study seeks to empirically analyze the effects of core self-evaluation and adaptive selling behavior on sales performance for female salespersons engaged in door-to-door sales through the face-to-face channel in the wellness industry. This study seeks to examine the importance of adaptive selling, through, salespeople derive appropriate strategies in response to market changes. For female salespeople who use face-to-face channels, this study empirically investigated the relationship between core self-evaluation and adaptive selling, and effects on sales performance. A 31-item survey was constructed, based on prior research. We selected six door-to-door sales companies in South Korea and conducted one-to-one interviews with female salespeople in the Seoul metropolitan area and analyzed 208 pieces of significant data. Results demonstrated that among the core self-evaluation factors for female salespeople, self-esteem, self-efficacy, and neuroticism had an effect on adaptive selling factors, while locus of control did not. These factors were found to affect sales performance through the mediating role of adaptive selling. Improvements in the adaptive selling capabilities of female salespeople in charge of face-to-face channels positively affected sales performance. Management efforts are required to enhance self-esteem, self-efficacy, or neuroticism. These results suggest that companies should support enhancing individual adaptive selling capabilities of their salespeople.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1073-1082
• /
• 1999

본 논문에서는 시스템 내의 프로세서들을 효과적으로 사용하기 위한 적응적 프로세서 할당 정책을 제안한다. 프로그램의 병렬성을 향상시키기 위하여 일반적으로 병렬 처리에 사용될 프로세서 개수를 증가시킨다. 그러나 증가된 프로세서들은 그레인 크기에 변화를 일으키며 이는 캐쉬 성능에 영향을 미친다. 특히 대역이 제한된 공유 버스를 사용하는 시스템에서는 프로세서 개수의 증가는 공유 버스에 대한 접근 경쟁을 크게 증가하므로 버스에서 대기하는 시간이 프로세서 증가에 의한 계산 능력 이득을 상쇄시키는 주요한 원인이 되고 있다. 본 논문에서 제안한 적응적 프로세서 할당 정책은 프로그램이 수행되는 도중에 임의의 기간동안 공유버스에 대기중인 프로세서 분포에 관한 정보를 얻는다. 그리고 이 정보를 바탕으로 프로세서 개수를 변경하는 방법이다. 모의 시험에서 적응적 프로세서 할당 정책은 프로그램들의 버스 트래픽 특성에 따른 최적의 적합한 프로세서 개수를 발견함을 보인다. 그리고 적응적 프로세서 할당 정책은 고정된 프로세서 개수를 사용한 가장 좋은 성능보다는 다소 떨어진 성능을 나타내었으나 시스템의 프로세서 활용성을 높여 효과적 시스템 사용에 기여함을 보인다. Abstract In this paper, the adaptive processor allocation policy is suggested to make effective use of processors in system. To enhance the parallelism, the number of processors used in the parallel computing may be increased. However, increasing the number of processors affects the grain size of the parallel program. Therefore, it affects the cache performance. In particular, when the shared bus is employed, since increasing the number of processors can result in a significant amount of contention to achieve the shared-bus, the increased computing power is offset by the bus waiting time due to these contentions. The adaptive processor allocation policy acquires the information about the distribution of waiting processors on shared bus for any execution period of programs. And it changes the number of processors working in parallel processing during the program's run. Our simulation results show that the adaptive processor allocation policy finds the optimum feasible number of processors based on the bus traffic characteristic of programs. Thus, it contributes to effective system utilization, even though it performs slightly less efficiently than using a fixed number of processors with the best performance.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.4
• /
• pp.514-523
• /
• 2017

In this paper, we propose Adaptive Writeback-aware Cache management (AWC) to prolong the lifetime of non-volatile main memory systems by reducing the number of writebacks. The last-level cache in AWC is partitioned into Least Recently Used (LRU) segment and LRU using Dirty block Precedence (DP-LRU) segment. The DP-LRU segment evicts clean blocks first for giving reuse opportunity to dirty blocks. AWC can also determine the efficient size of DP-LRU segment for reducing the number of writebacks according to memory access patterns of programs. In the performance evaluation, we showed that AWC reduced the number of writebacks up to 29% and 46%, and saved the energy of a main memory system up to 23% and 49% in a single-core and multi-core, respectively. AWC also reduced the runtime by 1.5% and 3.2% on average compared to previous cache managements for non-volatile main memory systems, in a single-core and a multi-core, respectively.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.369-374
• /
• 2012

In this paper, the effective transmission method is proposed to save the energy and to increase the throughput of the communication system using adaptive modulation. Traditionally, adaptive modulation has been used to improve the throughput using the power margin of the system design. Considering the instantaneous energy during the modulation method changing duration, the effective transmission method is proposed. By the simulation, the performance and effectiveness is validated.

• Advances in Computational Design
• /
• v.5 no.3
• /
• pp.233-260
• /
• 2020

The main purpose to introduce model based controller in proposed control technique is to provide better and fast learning of the floating dynamics by means of fuzzy logic controller and also cancelling effect of nonlinear terms of the system. An iterative adaptive dynamic programming algorithm is proposed to deal with the optimal trajectory-tracking control problems for autonomous underwater vehicle (AUV). The optimal tracking control problem is converted into an optimal regulation problem by system transformation. Then the optimal regulation problem is solved by the policy iteration adaptive dynamic programming algorithm. Finally, simulation example is given to show the performance of the iterative adaptive dynamic programming algorithm.