• Title/Summary/Keyword: Reduce

Search Result 47,290, Processing Time 0.066 seconds

UX Analysis for Mobile Devices Using MapReduce on Distributed Data Processing Platform (MapReduce 분산 데이터처리 플랫폼에 기반한 모바일 디바이스 UX 분석)

  • Kim, Sungsook;Kim, Seonggyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.9
    • /
    • pp.589-594
    • /
    • 2013
  • As the concept of web characteristics represented by openness and mind sharing grows more and more popular, device log data generated by both users and developers have become increasingly complicated. For such reasons, a log data processing mechanism that automatically produces meaningful data set from large amount of log records have become necessary for mobile device UX(User eXperience) analysis. In this paper, we define the attributes of to-be-analyzed log data that reflect the characteristics of a mobile device and collect real log data from mobile device users. Along with the MapReduce programming paradigm in Hadoop platform, we have performed a mobile device User eXperience analysis in a distributed processing environment using the collected real log data. We have then demonstrated the effectiveness of the proposed analysis mechanism by applying the various combinations of Map and Reduce steps to produce a simple data schema from the large amount of complex log records.

Efficient Processing of Multiple Group-by Queries in MapReduce for Big Data Analysis (맵리듀스에서 빅데이터 분석을 위한 다중 Group-by 질의의 효율적인 처리 기법)

  • Park, Eunju;Park, Sojeong;Oh, Sohyun;Choi, Hyejin;Lee, Ki Yong;Shim, Junho
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.5
    • /
    • pp.387-392
    • /
    • 2015
  • MapReduce is a framework used to process large data sets in parallel on a large cluster. A group-by query is a query that partitions the input data into groups based on the values of the specified attributes, and then evaluates the value of the specified aggregate function for each group. In this paper, we propose an efficient method for processing multiple group-by queries using MapReduce. Instead of computing each group-by query independently, the proposed method computes multiple group-by queries in stages with one or more MapReduce jobs in order to reduce the total execution cost. We compared the performance of this method with the performance of a less sophisticated method that computes each group-by query independently. This comparison showed that the proposed method offers better performance in terms of execution time.

Output filter design for conducted EMI reduction of PWM Inverter-fed Induction Motor System

  • Kim Lee-Hun;Won Chung-Yuen;Kim Young-Seok;Choi Se-Wan
    • Proceedings of the KIPE Conference
    • /
    • 2001.10a
    • /
    • pp.761-767
    • /
    • 2001
  • In this paper, filtering techniques to reduce the adverse effects of motor leads on high-frequency PWM inverter fed AC motor drives will be examined. The filter was designed to keep the motor terminal from the cable surge impedance to reduce overvoltage reflections, ringing, and the dv/dt, di/dt. Therefore, filtering techniques are investigated to reduce the motor terminal overvoltage, ringing, and EMI noise in inverter fed ac motor drive systems. The output filter is used to limit the rate of the inverter output voltage and reduce EMI(common mode noise) to the motor. The performance of the output filter is evaluated through simulations (PSIM) and experiment on PWM inverter-fed ac motor drive(3phase, 3hp(2.2kw), input voltage 220/380V, induction motor). An experimental PWM drive system reduction of conducted EMI was implemented on an available TMS320C31 microprocessor control board. Finally, experimental results showed that the inverter output filter reduces more CM noise than the LPF(low pass filter) and reduce overvoltage and ringing at the motor terminal.

  • PDF

Effect of Dietary Conjugated Linoleic Acid on Plasma Levels of Glucose and Lipids and Hepatic Lipogenic Enzyme Activity in Otsuka Long Evans Tokushima Fatty Rats (OLETF 비만쥐에서 CLA첨가 식이가 혈장의 포도당과 지질농도 및 간조직의 Lipogenic Enzyme 활성도에 미치는 영향)

  • 박현서;고은경;김영설
    • Journal of Nutrition and Health
    • /
    • v.34 no.8
    • /
    • pp.850-857
    • /
    • 2001
  • The study was designed to observe whether the conjugated linoleic acid supplemented to diet could reduce plasma levels of glucose and lipids which were increased in 27-weeks old Otsuka Long Evans Tokushima Fatty(OLETF) rats. Twenty male OLETF rats of 7 weeks old were fed an experimental diet containing 4.5%(w/w) total fat including 1% CLA and six of twenty rats were sacrified at 6 weeks feeding. The rest of OLETF rats was divided into 2 groups, one group was continuously fed for 14 weeks more the same experimental diet containing 1% CLA and the other group was fed control diet which eliminated CLA. CLA did not significantly reduce food intake and body weight gain in OLETF obese rats. Plasma triglyceride and total cholesterol level were significantly increased at older age of OLETF obese rats, but CLA could significantly reduce plasma cholesterol and triglyceride increased in obese rats. However, CLA was not strong enough to reduce the increased plasma glucose level and hepatic lipogenic enzyme acitivies. CLA was mostly deposited in epididymal fat pad and could be incorporated into hepatic microsomal membrane and did interfere the conversion of C18 : 0 into C18 : 1 in liver. In conclusion, CLA could have anti-atherogenic effect by reducing plasma cholesterol and triglyceride which was increased in genetically obese rats, but CLA(1%) was not good source of dietary fatty acid to reduce body fatness and plasma glucose which was increased by obese gene in older rats.

  • PDF

Improving Join Performance for SPARQL Query Processing in the Clouds (클라우드에서 SPARQL 질의 처리를 위한 조인 성능 향상)

  • Choi, Gyu-Jin;Son, Yun-Hee;Lee, Kyu-Chul
    • Journal of KIISE
    • /
    • v.43 no.6
    • /
    • pp.700-709
    • /
    • 2016
  • Recently, with the rapid growth of LOD (Linked Open Data) existing methods based on a single machine have limitation in performance. Existing solutions use distributed framework such as Mapreduce in order to improve the performance. However, the MapReduce framework for processing SPARQL queries involves multiple MapReduce jobs and additional costs incurred. In addition, the problem of unnecessary data processing arises. In this study, we proposed a method to reduce the number of MapReduce jobs during SPARQL query processing and join indexes based on Bitmap for minimizing the costs of processing unnecessary data.

Sequential Pattern Mining with Optimization Calling MapReduce Function on MapReduce Framework (맵리듀스 프레임웍 상에서 맵리듀스 함수 호출을 최적화하는 순차 패턴 마이닝 기법)

  • Kim, Jin-Hyun;Shim, Kyu-Seok
    • The KIPS Transactions:PartD
    • /
    • v.18D no.2
    • /
    • pp.81-88
    • /
    • 2011
  • Sequential pattern mining that determines frequent patterns appearing in a given set of sequences is an important data mining problem with broad applications. For example, sequential pattern mining can find the web access patterns, customer's purchase patterns and DNA sequences related with specific disease. In this paper, we develop the sequential pattern mining algorithms using MapReduce framework. Our algorithms distribute input data to several machines and find frequent sequential patterns in parallel. With synthetic data sets, we did a comprehensive performance study with varying various parameters. Our experimental results show that linear speed up can be achieved through our algorithms with increasing the number of used machines.

RHadoop platform for K-Means clustering of big data (빅데이터 K-평균 클러스터링을 위한 RHadoop 플랫폼)

  • Shin, Ji Eun;Oh, Yoon Sik;Lim, Dong Hoon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.3
    • /
    • pp.609-619
    • /
    • 2016
  • RHadoop is a collection of R packages that allow users to manage and analyze data with Hadoop. In this paper, we implement K-Means algorithm based on MapReduce framework with RHadoop to make the clustering method applicable to large scale data. The main idea introduces a combiner as a function of our map output to decrease the amount of data needed to be processed by reducers. We showed that our K-Means algorithm using RHadoop with combiner was faster than regular algorithm without combiner as the size of data set increases. We also implemented Elbow method with MapReduce for finding the optimum number of clusters for K-Means clustering on large dataset. Comparison with our MapReduce implementation of Elbow method and classical kmeans() in R with small data showed similar results.

Decombined Distributed Parallel VQ Codebook Generation Based on MapReduce (맵리듀스를 사용한 디컴바인드 분산 VQ 코드북 생성 방법)

  • Lee, Hyunjin
    • Journal of Digital Contents Society
    • /
    • v.15 no.3
    • /
    • pp.365-371
    • /
    • 2014
  • In the era of big data, algorithms for the existing IT environment cannot accept on a distributed architecture such as hadoop. Thus, new distributed algorithms which apply a distributed framework such as MapReduce are needed. Lloyd's algorithm commonly used for vector quantization is developed using MapReduce recently. In this paper, we proposed a decombined distributed VQ codebook generation algorithm based on a distributed VQ codebook generation algorithm using MapReduce to get a result more fast. The result of applying the proposed algorithm to big data showed higher performance than the conventional method.

Clock Mesh Network Design with Through-Silicon Vias in 3D Integrated Circuits

  • Cho, Kyungin;Jang, Cheoljon;Chong, Jong-Wha
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.931-941
    • /
    • 2014
  • Many methodologies for clock mesh networks have been introduced for two-dimensional integrated circuit clock distribution networks, such as methods to reduce the total wirelength for power consumption and to reduce the clock skew variation through consideration of buffer placement and sizing. In this paper, we present a methodology for clock mesh to reduce both the clock skew and the total wirelength in three-dimensional integrated circuits. To reduce the total wirelength, we construct a smaller mesh size on a die where the clock source is not directly connected. We also insert through-silicon vias (TSVs) to distribute the clock signal using an effective clock TSV insertion algorithm, which can reduce the total wirelength on each die. The results of our proposed methods show that the total wirelength was reduced by 12.2%, the clock skew by 16.11%, and the clock skew variation by 11.74%, on average. These advantages are possible through increasing the buffer area by 2.49% on the benchmark circuits.

Task failure resilience technique for improving the performance of MapReduce in Hadoop

  • Kavitha, C;Anita, X
    • ETRI Journal
    • /
    • v.42 no.5
    • /
    • pp.748-760
    • /
    • 2020
  • MapReduce is a framework that can process huge datasets in parallel and distributed computing environments. However, a single machine failure during the runtime of MapReduce tasks can increase completion time by 50%. MapReduce handles task failures by restarting the failed task and re-computing all input data from scratch, regardless of how much data had already been processed. To solve this issue, we need the computed key-value pairs to persist in a storage system to avoid re-computing them during the restarting process. In this paper, the task failure resilience (TFR) technique is proposed, which allows the execution of a failed task to continue from the point it was interrupted without having to redo all the work. Amazon ElastiCache for Redis is used as a non-volatile cache for the key-value pairs. We measured the performance of TFR by running different Hadoop benchmarking suites. TFR was implemented using the Hadoop software framework, and the experimental results showed significant performance improvements when compared with the performance of the default Hadoop implementation.