• 제목/요약/키워드: Efficient Execution System

검색결과 301건 처리시간 0.032초

지역 산업구조를 고려한 기업평가지표 모형 (A Model of Business Evaluation Index for a Regional Industry)

  • 정해석;김병극;유우식
    • 산업경영시스템학회지
    • /
    • 제33권3호
    • /
    • pp.79-86
    • /
    • 2010
  • Causing by economic stagnation and financial management difficulty of the domestic small and medium business company, the actual condition which enlarges the plan of politic funds increased from the government. The government authority as the SBC (small and medium business promotion corporation) evaluates the domestic small and medium business company, and directly executes a governmental politic funds. Financial analysis is a important factor of enterprise evaluation among various valuation bases. However because of applying to the whole domestic manufacturing industry on financial evaluation, Current financial evaluation index effectively cannot reflect the feature of a regional industry. A whole manufacturing industry index considers a standard for the comparison evaluation of domestic manufacturing industry and compares with the other industries and the world-wide nation industry change, But, there is a difference from indexes of corresponding industry in specific regions. This paper proposes a model of evaluation index for the efficient execution of politic funds. We considers three manufacturing industries for proposed model which are shipbuilding, machine tool and airline industries in Gyeongsangnam-do region.

그리드 시스템을 위한 웹 기반 스케줄링 툴킷의 구현 (Implementation of a Web-based Scheduling Toolkit for Grid Systems)

  • 강오한;강상성;송희헌
    • 컴퓨터교육학회논문지
    • /
    • 제10권3호
    • /
    • pp.49-56
    • /
    • 2007
  • 그리드는 과학이나 공학 분야에서 대규모 연산을 효율적으로 수행하기 위한 플랫폼으로 제공된다. 이러한 환경에서 자원관리나 태스크 스케줄링은 다루기가 매우 복잡하다. 본 논문에서는 웹 기반의 그리드 컴퓨팅 환경에서 시스템을 모델링하고 스케줄링 기법을 시뮬레이션 할 수 있는 스케줄링 툴킷(GridTool)을 설계하고 구현하였다. 구현한 웹 기반 그리드 스케줄링 툴킷은 자바 환경의 툴킷인 GridSim을 시뮬레이션 도구로 활용하였으며, 자원 모델링, 작업 모델링, 알고리즘 컴파일, 시뮬레이션, 성능분석을 웹 환경에서 효율적으로 수행할 수 있다. 본 논문에서 구현한 스케줄링 툴킷은 향후 그리드 연구에 기반구조로 활용될 수 있으며, 스케줄링 알고리즘의 성능 분석을 위한 도구로 사용될 수 있다.

  • PDF

IEEE 802.22 WRAN 기반 스펙트럼 센싱 모듈 구현 (Implementation of Spectrum Sensing Module based on IEEE 802.22 WRAN)

  • 이현소;김경석
    • 한국콘텐츠학회논문지
    • /
    • 제9권3호
    • /
    • pp.39-48
    • /
    • 2009
  • 스펙트럼 센싱 기술은 차세대 무선통신 기술들 중 하나인 Cognitive Radio (CR) 시스템에서의 핵심 기술이다. CR 시스템은주변의 허가된 무선국을 보호하기 위해 주변 무선 환경을 탐색하여 빈 주파수 대역을 찾아 임시적으로 주파수 대역을 사용할 수 있도록 하는 기술이다. 본 논문은 임베디드 보드에서 CR 기술 기반의 효율적인 스펙트럼 센싱 기법들을 구현하였다. 6MHz 대역폭을 가진 DVB-H 신호를 입력 신호로 실험하였으며, Modified Periodogram Method, Welch's Method, SCF Method을 통하여 스펙트럼 센싱 결과를 확인하였다. 또한, 각각의 스펙트럼 센싱 모듈의 성능과 세부 기능들의 실행 속도를 TI320C6416 DSP 보드를 통하여 비교하였다.

멀티 프로세서 임베디드 시스템에서 여유시간 예측에 의한 저전력 태스크 스케줄링 (An Energy-Efficient Task Scheduling Algorithm for Multi Processor Embedded System by Laxity Estimation)

  • 서범식;황선영
    • 한국통신학회논문지
    • /
    • 제35권11B호
    • /
    • pp.1631-1639
    • /
    • 2010
  • 본 논문은 멀티프로세서 임베디드 시스템에서 사용하는 어플리케이션을 구성하는 태스크를 수행하는데 필요한 전력과 태스크간의 의존성에 의해서 발생하는 통신 비용을 감소시킬 수 있는 스케줄링 알고리듬을 제안한다. 제안된 알고리듬은 기존 알고리듬에서는 통신비용은 고려하였으나 스케줄링 단계에서는 동적 전력 관리 결과를 고려하지 않는 점을 보완하여 스케줄링 단계에서 여유시간(Laxity) 사용을 예측하여 동적 전압 관리의 효율을 높이는 방법을 사용한다. 이를 통해 복잡한 멀티미디어 어플리케이션에 동적 전력 관리를 적용하여 수행 시 에너지 효율을 높였다. 실험 결과 멀티미디어 어플리케이션인 HD MPEG4, MotionJPEG codec, MP3, Wavelet 프로그램을 멀티프로세서 환경에서 제안된 알고리듬을 이용하여 저전력 스케줄링 결과 기존 방식에 비해 평균 11.2%의 에너지 감소를 얻었다.

Easily Adaptable On-Chip Debug Architecture for Multicore Processors

  • Xu, Jing-Zhe;Park, Hyeongbae;Jung, Seungpyo;Park, Ju Sung
    • ETRI Journal
    • /
    • 제35권2호
    • /
    • pp.301-310
    • /
    • 2013
  • Nowadays, the multicore processor is watched with interest by people all over the world. As the design technology of system on chip has developed, observing and controlling the processor core's internal state has not been easy. Therefore, multicore processor debugging is very difficult and time-consuming. Thus, we need a reliable and efficient debugger to find the bugs. In this paper, we propose an on-chip debug architecture for multicore processors that is easily adaptable and flexible. It is based on the JTAG standard and supports monitoring mode debugging, which is different from run-stop mode debugging. Compared with the debug architecture that supports the run-stop mode debugging, the proposed architecture is easily applied to a debugger and has the advantage of having a desirable gate count and execution cycle. To verify the on-chip debug architecture, it is applied to the debugger of the prototype multicore processor and is tested by interconnecting it with a software debugger based on GDB and configured for the target processor.

ARM 클러스터에서 에너지 효율 향상을 위한 MPI와 MapReduce 모델 비교 (Comparing Energy Efficiency of MPI and MapReduce on ARM based Cluster)

  • 자한제프 마크불;페르마타 눌 리즈키;오상윤
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2014년도 제49차 동계학술대회논문집 22권1호
    • /
    • pp.9-13
    • /
    • 2014
  • The performance of large scale software applications has been automatically increasing for last few decades under the influence of Moore's law - the number of transistors on a microprocessor roughly doubled every eighteen months. However, on-chip transistors limitations and heating issues led to the emergence of multicore processors. The energy efficient ARM based System-on-Chip (SoC) processors are being considered for future high performance computing systems. In this paper, we present a case study of two widely used parallel programming models i.e. MPI and MapReduce on distributed memory cluster of ARM SoC development boards. The case study application, Black-Scholes option pricing equation, was parallelized and evaluated in terms of power consumption and throughput. The results show that the Hadoop implementation has low instantaneous power consumption that of MPI, but MPI outperforms Hadoop implementation by a factor of 1.46 in terms of total power consumption to execution time ratio.

  • PDF

Adaptive Partial Shading Determinant Algorithm for Solar Array Systems

  • Wellawatta, Thusitha Randima;Choi, Sung-Jin
    • Journal of Power Electronics
    • /
    • 제19권6호
    • /
    • pp.1566-1574
    • /
    • 2019
  • Maximum power point tracking (MPPT) under the partial shading condition is a challenging research topic for photovoltaic systems. Shaded photo-voltaic module result in complex peak patterns on the power versus voltage curve which can misguide classical MPPT algorithms. Thus, various kinds of global MPPT algorithms have been studied. These have typically consisted of partial shading detection, global peak search and MPPT. The conventional partial shading detection algorithm aims to detect all of the occurrences of partial shading. This results in excessive execution of global peak searches and discontinuous operation of the MPPT. This in turn, reduces the achievable power for the PV module. Based on a theoretical investigation of power verse voltage curve patterns under various partial shading conditions, it is realized that not all the occurrences of partial shadings require a global peak search. Thus, an intelligent partial shading detection algorithm that provides exact identification of global peak search necessity is essential for the efficient utilization of solar energy resources. This paper presents a new partial shading determinant algorithm utilizing adaptive threshold levels. Conventional methods tend to be too sensitive to sharp shading patterns but insensitive to smooth patterns. However, the proposed algorithm always shows superb performance, regardless of the partial shading patterns.

Analysis of Weights and Feature Patterns in Popular 2D Deep Neural Networks Models for MRI Image Classification

  • Khagi, Bijen;Kwon, Goo-Rak
    • Journal of Multimedia Information System
    • /
    • 제9권3호
    • /
    • pp.177-182
    • /
    • 2022
  • A deep neural network (DNN) includes variables whose values keep on changing with the training process until it reaches the final point of convergence. These variables are the co-efficient of a polynomial expression to relate to the feature extraction process. In general, DNNs work in multiple 'dimensions' depending upon the number of channels and batches accounted for training. However, after the execution of feature extraction and before entering the SoftMax or other classifier, there is a conversion of features from multiple N-dimensions to a single vector form, where 'N' represents the number of activation channels. This usually happens in a Fully connected layer (FCL) or a dense layer. This reduced 2D feature is the subject of study for our analysis. For this, we have used the FCL, so the trained weights of this FCL will be used for the weight-class correlation analysis. The popular DNN models selected for our study are ResNet-101, VGG-19, and GoogleNet. These models' weights are directly used for fine-tuning (with all trained weights initially transferred) and scratch trained (with no weights transferred). Then the comparison is done by plotting the graph of feature distribution and the final FCL weights.

An Efficient Service Function Chains Orchestration Algorithm for Mobile Edge Computing

  • Wang, Xiulei;Xu, Bo;Jin, Fenglin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권12호
    • /
    • pp.4364-4384
    • /
    • 2021
  • The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

마켓 기반 계산 그리드를 위한 SLA 인지형 스케줄링 기법 (SLA-Aware Scheduling Scheme for Market-based Computational Grid)

  • 한영주;;윤찬현
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2011년도 춘계학술발표대회
    • /
    • pp.220-223
    • /
    • 2011
  • For successfully commercialized grid systems, it is required to provide an efficient scheduling scheme which is able to optimize benefits for three participants such as consumers, brokers, and providers so that every participant has sufficient benefit to maintain a sustainable market. In this paper, we define this job scheduling problem as an objective optimization problem for three participants. The three objectives are to maximize the success rate of job execution, total achieved profit, and the system utilization. To address the scheduling problem, we propose heuristics referred to as SLA-aware scheduling scheme (SA) for optimal resource allocation. The simulation results show that the improvement and the effectiveness of the proposed scheme and the proposed scheme can outperform well-known scheduling schemes such as first come first serve (FCFS), shortest job first (SJF), and earliest deadline first (EDF).