• Title/Summary/Keyword: Processing Efficiency

Search Result 3,499, Processing Time 0.034 seconds

Dynamic Available-Resource Reallocation based Job Scheduling Model in Grid Computing (그리드 컴퓨팅에서 유효자원 동적 재배치 기반 작업 스케줄링 모델)

  • Kim, Jae-Kwon;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.2
    • /
    • pp.59-67
    • /
    • 2012
  • A grid computing consists of the physical resources for processing one of the large-scale jobs. However, due to the recent trends of rapid growing data, the grid computing needs a parallel processing method to process the job. In general, each physical resource divides a requested large-scale task. And a processing time of the task varies with an efficiency and a distance of each resource. Even if some resource completes a job, the resource is standing by until every divided job is finished. When every resource finishes a processing, each resource starts a next job. Therefore, this paper proposes a dynamic resource reallocation scheduling model (DDRSM). DDRSM finds a waiting resource and reallocates an unfinished job with an efficiency and a distance of the resource. DDRSM is an efficient method for processing multiple large-scale jobs.

Rebar Fabrication Process in Both Field Processing and Factory Processing for Adopting Lean Construction

  • Yun, Seok-Heon;Kim, Sang-Chul
    • Architectural research
    • /
    • v.15 no.3
    • /
    • pp.167-174
    • /
    • 2013
  • Due to increasing competition of construction companies, it is required to optimize the management of construction projects and "lean" concepts are rapidly spreaded in construction industry. Steel work accounts for a large proportion in construction work, and a variety of attempts to efficiently perform steel work has currently made. And since rebar (Engineer-to-Order) can be engineered through design once order is placed, it gives the great impact on construction, thus, entire management is required. The purpose of this study is to present the method to increase the efficiency of field processing method of steel work in terms of lean construction. Once we examine process of steel work and identify the flow, we would like to analyze which processes should be improved through value analysis approach and present the improvement plans. Also, this study examines cases of field processing and factory processing, and it identifies the waste factors in the procurement process. Finally, this study would like to present the result of analysis from the perspectives of value. The rebar delivery process is divided into several steps and the duration of every step is surveyed. Using duration data, VAT (Value added time) can be calculated for analyzing the efficiency of the process.

Messaging System Analysis for Effective Embedded Tester Log Processing (효과적인 Embedded Tester Log 처리를 위한 Messaging System 분석)

  • Nam, Ki-ahn;Kwon, Oh-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.645-648
    • /
    • 2017
  • The existing embedded tester used TCP and shared file system for log processing. In addition, the existing processing method was treated as 1-N structure. This method wastes resources of the tester for exception handling. We implemented a log processing message layer that can be distributed by messaging system. And we compare the transmission method using the message layer and the transmission method using TCP and the shared file system. As a result of comparison, transmission using the message layer showed higher transmission bandwidth than TCP. In the CPU usage, the message layer showed lower efficiency than TCP, but showed no significant difference. It can be seen that the log processing using the message layer shows higher efficiency.

  • PDF

An Technique for the Active Rule Condition (능동규칙의 조건부 처리 기법)

  • 이기욱
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.49-54
    • /
    • 1998
  • AS it takes a considerable time for database operations for processing the condition part of active rule, the operations have an important effect on the efficiency of active database system. The processing time of operations should be minimized in order to improve the efficiency of system. The previous works are limited to basic database operations and the partial aggregate functions. In this paper, the processing technique using the structuralization and the state table of relations is suggested. The processing time for basic database operations can be reduced with the structuralization of relations to classification tree and the introduction of deletion information table. With the introduction of binary search tree and relation state table, the aggregate function which has a big of processing cost can be processed effectively and the function of the active database system can be maximized.

  • PDF

Design of Distributed Processing Framework Based on H-RTGL One-class Classifier for Big Data (빅데이터를 위한 H-RTGL 기반 단일 분류기 분산 처리 프레임워크 설계)

  • Kim, Do Gyun;Choi, Jin Young
    • Journal of Korean Society for Quality Management
    • /
    • v.48 no.4
    • /
    • pp.553-566
    • /
    • 2020
  • Purpose: The purpose of this study was to design a framework for generating one-class classification algorithm based on Hyper-Rectangle(H-RTGL) in a distributed environment connected by network. Methods: At first, we devised one-class classifier based on H-RTGL which can be performed by distributed computing nodes considering model and data parallelism. Then, we also designed facilitating components for execution of distributed processing. In the end, we validate both effectiveness and efficiency of the classifier obtained from the proposed framework by a numerical experiment using data set obtained from UCI machine learning repository. Results: We designed distributed processing framework capable of one-class classification based on H-RTGL in distributed environment consisting of physically separated computing nodes. It includes components for implementation of model and data parallelism, which enables distributed generation of classifier. From a numerical experiment, we could observe that there was no significant change of classification performance assessed by statistical test and elapsed time was reduced due to application of distributed processing in dataset with considerable size. Conclusion: Based on such result, we can conclude that application of distributed processing for generating classifier can preserve classification performance and it can improve the efficiency of classification algorithms. In addition, we suggested an idea for future research directions of this paper as well as limitation of our work.

A Performance Comparison of Parallel Programming Models on Edge Devices (엣지 디바이스에서의 병렬 프로그래밍 모델 성능 비교 연구)

  • Dukyun Nam
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.4
    • /
    • pp.165-172
    • /
    • 2023
  • Heterogeneous computing is a technology that utilizes different types of processors to perform parallel processing. It maximizes task processing and energy efficiency by leveraging various computing resources such as CPUs, GPUs, and FPGAs. On the other hand, edge computing has developed with IoT and 5G technologies. It is a distributed computing that utilizes computing resources close to clients, thereby offloading the central server. It has evolved to intelligent edge computing combined with artificial intelligence. Intelligent edge computing enables total data processing, such as context awareness, prediction, control, and simple processing for the data collected on the edge. If heterogeneous computing can be successfully applied in the edge, it is expected to maximize job processing efficiency while minimizing dependence on the central server. In this paper, experiments were conducted to verify the feasibility of various parallel programming models on high-end and low-end edge devices by using benchmark applications. We analyzed the performance of five parallel programming models on the Raspberry Pi 4 and Jetson Orin Nano as low-end and high-end devices, respectively. In the experiment, OpenACC showed the best performance on the low-end edge device and OpenSYCL on the high-end device due to the stability and optimization of system libraries.

Configuration and Efficiency Computation of the DPP System for Energy Harvesting of Renewable Energy (신재생에너지의 에너지 하베스팅을 위한 DPP시스템의 구성과 효율계산)

  • Park, Seung-Hwa;Lee, Hyun-Jae;Shon, Jin-Geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.67 no.3
    • /
    • pp.137-142
    • /
    • 2018
  • Energy harvesting technology is drawing attention as a means of collecting various eco-friendly energy and accumulating residual energy. Recently, differential power processing (DPP) is being developed as part of energy harvesting. This is being studied as a solution to the loss of power generation between power modules and the problems caused by module small losses depending on the size of power production. In this paper, we propose the necessity of the DPP by comparing and analyzing energy harvesting related module integration system and power supply efficiency of DPP. The power efficiency of the converter and the power difference between the wind power and the photovoltaic power supply have been changed to demonstrate the effectiveness of the proposed system.

An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule

  • Xu, Youjun
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1149-1157
    • /
    • 2017
  • The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.

A Synchronization Scheme Based on Moving Average for Robust Audio Watermarking

  • Zhang, Jinquan;Han, Bin
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.271-287
    • /
    • 2019
  • The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

Multimedia Extension Instructions and Optimal Many-core Processor Architecture Exploration for Portable Ultrasonic Image Processing (휴대용 초음파 영상처리를 위한 멀티미디어 확장 명령어 및 최적의 매니코어 프로세서 구조 탐색)

  • Kang, Sung-Mo;Kim, Jong-Myon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.8
    • /
    • pp.1-10
    • /
    • 2012
  • This paper proposes design space exploration methodology of many-core processors including multimedia specific instructions to support high-performance and low power ultrasound imaging for portable devices. To explore the impact of multimedia instructions, we compare programs using multimedia instructions and baseline programs with a same many-core processor in terms of execution time, energy efficiency, and area efficiency. Experimental results using a $256{\times}256$ ultrasound image indicate that programs using multimedia instructions achieve 3.16 times of execution time, 8.13 times of energy efficiency, and 3.16 times of area efficiency over the baseline programs, respectively. Likewise, programs using multimedia instructions outperform the baseline programs using a $240{\times}320$ image (2.16 times of execution time, 4.04 times of energy efficiency, 2.16 times of area efficiency) as well as using a $240{\times}400$ image (2.25 times of execution time, 4.34 times of energy efficiency, 2.25 times of area efficiency). In addition, we explore optimal PE architecture of many-core processors including multimedia instructions by varying the number of PEs and memory size.