• Title/Summary/Keyword: Data hit rate

Search Result 85, Processing Time 0.023 seconds

CPC: A File I/O Cache Management Policy for Compute-Bound Workloads

  • Bahn, Hyokyung
    • International journal of advanced smart convergence
    • /
    • v.11 no.2
    • /
    • pp.1-6
    • /
    • 2022
  • With the emergence of the new era of the 4th industrial revolution, compute-bound workloads with large memory footprint like big data processing increase dramatically. Even in such compute-bound workloads, however, we observe bulky I/Os while loading big data from storage to memory. Although file I/O cache plays a role of accelerating the performance of storage I/O, we found out that the cache hit rate in such environments is not improved even though we increase the file I/O cache capacity because of some special I/O references generated by compute-bound workloads. To cope with this situation, we propose a new file I/O cache management policy that improves the cache hit rate for compute-bound workloads significantly. Trace-driven simulations by replaying file I/O reference logs of compute-bound workloads show that the proposed cache management policy improves the cache hit rate compared to the well-acknowledged CLOCK algorithm by a large margin.

A Novel Method of Improving Cache Hit-rate in Hadoop MapReduce using SSD Cache

  • Kim, Jong-Chan;An, Jae-Hoon;Kim, Young-Hwan;Jeon, Ki-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.8
    • /
    • pp.1-6
    • /
    • 2015
  • The MapReduce Program of Hadoop Distributed File System operates on any unspecified nodes due to distributed-parallel process and block replicate for data stability. Since it is difficult to guarantee the cache locality when a Solid State Drive is used as a cache in hadoop, cache hit-rate is decreased. In this paper, we suggest a method to improve cache hit rate by pre-loading the input data of the MapReduce onto the SSD cache. To perform this method, we estimated the blocks that are used on each node by using capacity scheduler and block metadata. Eventually we could increase the performance of SSD cache by loading the blocks onto SSD cache before the Map Task run.

Study for independence of hits in professional baseball games (프로야구 경기에서 안타의 독립성에 대한 연구)

  • Kim, Byungsoo;Park, Youngwook;Jang, Nayoung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.6
    • /
    • pp.1421-1428
    • /
    • 2013
  • In this paper, we would like to test whether the hit at a particular bat has a dependency with the hitting results at the previous bats in professional baseball games. For this purpose, we used the 2011 Korean Baseball League data. We find out that the hitting percentage at a particular bat has no dependency with the hit at the previous bat, after reviewing the conditional probability of hit at each bat and the lift. From the independence test of hits at consecutive bats, and hit at a particular bat with no hits at previous bats, we can conclude that hits at particular bats are not dependent on the hits at previous bats in most cases. Hence, we can safely conclude that a hit at a particular bat is statistically independent from the hits at the previous bats.

Energy-Performance Efficient 2-Level Data Cache Architecture for Embedded System (내장형 시스템을 위한 에너지-성능 측면에서 효율적인 2-레벨 데이터 캐쉬 구조의 설계)

  • Lee, Jong-Min;Kim, Soon-Tae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.5
    • /
    • pp.292-303
    • /
    • 2010
  • On-chip cache memories play an important role in both performance and energy consumption points of view in resource-constrained embedded systems by filtering many off-chip memory accesses. We propose a 2-level data cache architecture with a low energy-delay product tailored for the embedded systems. The L1 data cache is small and direct-mapped, and employs a write-through policy. In contrast, the L2 data cache is set-associative and adopts a write-back policy. Consequently, the L1 data cache is accessed in one cycle and is able to provide high cache bandwidth while the L2 data cache is effective in reducing global miss rate. To reduce the penalty of high miss rate caused by the small L1 cache and power consumption of address generation, we propose an ECP(Early Cache hit Predictor) scheme. The ECP predicts if the L1 cache has the requested data using both fast address generation and L1 cache hit prediction. To reduce high energy cost of accessing the L2 data cache due to heavy write-through traffic from the write buffer laid between the two cache levels, we propose a one-way write scheme. From our simulation-based experiments using a cycle-accurate simulator and embedded benchmarks, the proposed 2-level data cache architecture shows average 3.6% and 50% improvements in overall system performance and the data cache energy consumption.

An Empirical Study on Aircraft Repair Parts Prediction Model Using Machine Learning (머신러닝을 이용한 항공기 수리부속 예측 모델의 실증적 연구)

  • Lee, Chang-Ho;Kim, Woong-Yi;Choi, Youn-Chul
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.26 no.4
    • /
    • pp.101-109
    • /
    • 2018
  • In order to predict the future needs of the aircraft repair parts, each military group develops and applies various techniques to their characteristics. However, the aircraft and the equipped weapon systems are becoming increasingly advanced, and there is a problem in improving the hit rate by applying the existing demand prediction technique due to the change of the aircraft condition according to the long term operation of the aircraft. In this study, we propose a new prediction model based on the conventional time-series analysis technique to improve the prediction accuracy of aircraft repair parts by using machine learning model. And we show the most effective predictive method by demonstrating the change of hit rate based on actual data.

A Local Buffer Allocation Scheme for Multimedia Data on Linux (리눅스 상에서 멀티미디어 데이타를 고려한 지역 버퍼 할당 기법)

  • 신동재;박성용;양지훈
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.4
    • /
    • pp.410-419
    • /
    • 2003
  • The buffer cache of general operating systems such as Linux manages file data by using global block replacement policy and read ahead. As a result, multimedia data with a low locality of reference and various consumption rate have low cache hit ratio and consume additional buffers because of read ahead. In this paper we have designed and implemented a new buffer allocation algorithm for multimedia data on Linux. Our approach keeps one read-ahead cache per every opened multimedia file and dynamically changes the read-ahead group size based on the buffer consumption rate of the file. This distributes resources fairly and optimizes the buffer consumption. This paper compares the system performance with that of Linux 2.4.17 in terms of buffer consumption and buffer hit ratio.

Hit Rate Prediction Algorithm for Laser Guided Bombs Using Image Processing (영상처리 기술을 활용한 레이저 유도폭탄 명중률 예측 알고리즘)

  • Ahn, Younghwan;Lee, Sanghoon
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.3
    • /
    • pp.247-256
    • /
    • 2015
  • Since the Gulf War, air power has played a key role. However, the effect of high-tech weapons, such as laser-guided bombs and electronic optical equipment, drops significantly if they do not match the weather conditions. So, aircraft that are assigned to carry laser-guided bombs must replace these munitions during bad weather conditions. But, there are no objective criteria for when weapons should be replaced. Therefore, in this paper, we propose an algorithm to predict the hit rate of laser-guided bombs using cloud image processing. In order to verify the accuracy of the algorithm, we applied the weather conditions that may affect laser-guided bombs to simulated flight equipment and executed simulated weapon release, then collected and analyzed data. Cloud images appropriate to the weather conditions were developed, and applied to the algorithm. We confirmed that the algorithm can accurately predict the hit rate of laser-guided bombs in most weather conditions.

Recent Economic Crises and Foreign Trade in Major ASEAN Countries (최근 경제위기들과 ASEAN 주요국의 무역)

  • Won, Yongkul
    • The Southeast Asian review
    • /
    • v.20 no.3
    • /
    • pp.41-64
    • /
    • 2010
  • The recent global financial crisis triggered by the sub-prime mortgage debacle in the United States hit hard most ASEAN countries that have just recovered from the unprecedented economic crisis ten years ago. This paper, using individual time-series and panel data from 1990 to 2009, intends to investigate and compare the impacts of the two aforementioned economic crises on trade in the four developing ASEAN countries that encompass Indonesia, Malaysia, the Philippines and Thailand. In doing so, the paper traces the behaviors of main macroeconomic variables before and after the crises on graphs, and then estimates classical export and import demand functions that include real exchange rate, home and foreign GDPs as explanatory variables. In the estimation functions, two dummy variables are added to consider the effects of the two economic crises separately. Individual country data analyses reveal that by and large the 1997 economic crisis seems hit those ASEAN countries' exports and imports harder than the recent global financial crisis. Surprisingly the recent financial crisis turns out more or less statistically insignificant for those countries' export and import performances. The fixed effect model estimation using panel data of those four ASEAN countries also shows that the 1997 economic crisis had affected exports and imports of those countries negatively while the recent global financial crisis was not statistically significant. These results indicate that overall the effect from the 1997 crisis was more devastating than that of the recent global crisis for those ASEAN countries.

Reducing Method of Energy Consumption of Phase Change Memory using Narrow-Value Data (내로우 값을 이용한 상변화 메모리상에서의 에너지 소모 절감 기법)

  • Kim, Young-Ung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.137-143
    • /
    • 2015
  • During the past 30 years, DRAM has been used for the reasons of economic efficiency of the production. Recently, PRAM has been emerged to overcome the shortcomings of DRAM. In this paper, we propose a technique that can reduce energy consumption by use of a narrow values to the write operation of PRAM. For this purpose, we describe the data compression method using a narrow value and the architecture of PRAM, We also experiment under the Simplescalar 3.0e simulator and SPEC CPU2000 benchmark environments. According to the experiments, the data hit rate of PRAM was increased by 39.4% to 67.7% and energy consumption was reduced by 9.2%. In order to use the proposed technique, it requires 3.12% of space overhead per word, and some additional hardware modules.

Personalized Product Recommendation Method for Analyzing User Behavior Using DeepFM

  • Xu, Jianqiang;Hu, Zhujiao;Zou, Junzhong
    • Journal of Information Processing Systems
    • /
    • v.17 no.2
    • /
    • pp.369-384
    • /
    • 2021
  • In a personalized product recommendation system, when the amount of log data is large or sparse, the accuracy of model recommendation will be greatly affected. To solve this problem, a personalized product recommendation method using deep factorization machine (DeepFM) to analyze user behavior is proposed. Firstly, the K-means clustering algorithm is used to cluster the original log data from the perspective of similarity to reduce the data dimension. Then, through the DeepFM parameter sharing strategy, the relationship between low- and high-order feature combinations is learned from log data, and the click rate prediction model is constructed. Finally, based on the predicted click-through rate, products are recommended to users in sequence and fed back. The area under the curve (AUC) and Logloss of the proposed method are 0.8834 and 0.0253, respectively, on the Criteo dataset, and 0.7836 and 0.0348 on the KDD2012 Cup dataset, respectively. Compared with other newer recommendation methods, the proposed method can achieve better recommendation effect.