• 제목/요약/키워드: algorithmic

검색결과 373건 처리시간 0.027초

Earliest Virtual Deadline Zero Laxity Scheduling for Improved Responsiveness of Mobile GPUs

  • Choi, Seongrim;Cho, Suhwan;Park, Jonghyun;Nam, Byeong-Gyu
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제17권1호
    • /
    • pp.162-166
    • /
    • 2017
  • Earliest virtual deadline zero laxity (EVDZL) algorithm is proposed for mobile GPU schedulers for its improved responsiveness. Responsiveness of user interface (UI) is one of the key factors in evaluating smart devices because of its significant impacts on user experiences. However, conventional GPU schedulers based on completely fair scheduling (CFS) shows a poor responsiveness due to its algorithmic complexity. In this letter, we present the EVDZL scheduler based on the conventional earliest deadline zero laxity (EDZL) algorithm by accommodating the virtual laxity concept into the scheduling. Experimental results show that the EVDZL scheduler improves the response time of the Android UI by 9.6% compared with the traditional CFS scheduler.

건축구조설계 통합시스템의 개발에 관한 연구 (A Study on the Development of an Integrated Structural Design System for Buildings)

  • 김이두;최창근
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1992년도 봄 학술발표회 논문집
    • /
    • pp.79-84
    • /
    • 1992
  • An integrated design system has as its aim the incoporation of all the design processes, such as, planning, preliminary design, analysis, detailed design (mamber design), evaluation, and drafting into an unified software system. Successful implementation such a system could lead to major improvements in efficiency by eliminating duplication of data and efforts. reducing errors, saving design time, providing management support, and so on. This study presents a methodology for an computer-integrated design system for building structures, synthesizing algorithmic procedures and knowledge based expert systems on the network database. Network database, which was designed to store all information systematically during the design processes, provides centeral communication area between algorithms and expert systems. The conventional procedural codes automate the routine design phases such as structural analysis, whereas knowledge-based expert systems support designer's decisions at the creative design phases such as preliminary design etc. The user interface with interactive and batch modes controls the design phases and manages design information and activates the algorithms and the expert systems. The concept presented in this paper will contribute to the formulation of automated design systems for building structures.

  • PDF

General Algorithms for Construction of Broadcast and Multicast Trees with Applications to Wireless Networks

  • Nguyen Gam D.
    • Journal of Communications and Networks
    • /
    • 제7권3호
    • /
    • pp.263-277
    • /
    • 2005
  • In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We evaluate the effectiveness of the general algorithms by applying them to different cost functions that are often used to model wired and wireless net­works. Besides providing a unifying framework for dealing with many present and future tree-construction applications, these algorithms typically outperform some existing algorithms that are specifically designed for energy-aware wireless networks. These general algorithms perform well at the expense of higher computational complexity. They are centralized algorithms, requiring the full network information for tree construction. Thus, we also present variations of these general algorithms to yield other algorithms that have lower complexity and distributed implementation.

Play-Back 서보 시스템의 학습제어 방법 (An Iterative Learning Control of Play-Back Servo Systems)

  • 김광배;안현식;오상록;고명삼
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1989년도 추계학술대회 논문집 학회본부
    • /
    • pp.367-371
    • /
    • 1989
  • As a menas of designing a robust servo system for electrical motor drive system, an iterative learning control method is proposed by employing the structure of the model algorithmic control. A sufficient condition for the convergency is shown, and via simulation for permanent magnet synchronous motor drive system, it is demonstrated 1hat the method yields a 'good performance even in the presence of the external load distrurbances.

  • PDF

비선형(非線型) 유한요소방정식(有限要素方程式)의 해법(解法)을 위한 조합(組合)알고리즘 (A Combined Algorithm for the Solution of Nonlinear Finite Element Equations)

  • 류연선
    • 대한토목학회논문집
    • /
    • 제6권3호
    • /
    • pp.11-20
    • /
    • 1986
  • 본(本) 논문(論文)의 목적(目的)은 효율적(効率的)이고도 경제적(經濟的)인 비선형(非線型) 유한요소방정식(有限要素方程式)의 해법(解法)알고리즘을 고안(考案)하는데 있다. 먼저 비선형(非線型) 연립방정식(聯立方程式)의 해석과정(解析過程) 및 특성(特性)을 고찰(考察)하고, 이를 바탕으로 유망(有望)한 비선형(非線型) 유한요소방정식(有限要素方程式)의 해법(解法)들을 알고리즘화(化)한 후(後) 이들의 장점(長點)을 최대한(最大限) 활용(活用)하여 계산량(計算量)을 최소화(最小化)하고 수치해석상(數値解析上)의 난점(難點)을 극복(克服)할 수 있는 조합(組合)알고리즘을 제안(提案)하였다.

  • PDF

용접공정에서 발생하는 변태 소성 구성방정식의 수치적 구현에 관한 연구 (Numerical implementation of a constitutive equation of transformation plasticity in welding)

  • 김주완;임세영;김현규;최강혁
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2003년도 춘계학술대회
    • /
    • pp.1154-1158
    • /
    • 2003
  • Finite element analysis of welding processes, which entail phase evolution, heat transfer and deformations, is considered in this paper. Attention focuses on numerical implementation of the thermo-elastic-plastic constitutive equation proposed by Leblond in consideration of the transformation plasticity. Based upon the multiplicative decomposition of deformation gradient, hyperelastic formulation is employed for efficient numerical integration, and the algorithmic consistent moduli for elastic-plastic deformations including transformation plasticity are obtained in the closed form. The convergence behavior of the present implementation is demonstrated via a couple of numerical examples.

  • PDF

A Statistical Perspective of Neural Networks for Imbalanced Data Problems

  • Oh, Sang-Hoon
    • International Journal of Contents
    • /
    • 제7권3호
    • /
    • pp.1-5
    • /
    • 2011
  • It has been an interesting challenge to find a good classifier for imbalanced data, since it is pervasive but a difficult problem to solve. However, classifiers developed with the assumption of well-balanced class distributions show poor classification performance for the imbalanced data. Among many approaches to the imbalanced data problems, the algorithmic level approach is attractive because it can be applied to the other approaches such as data level or ensemble approaches. Especially, the error back-propagation algorithm using the target node method, which can change the amount of weight-updating with regards to the target node of each class, attains good performances in the imbalanced data problems. In this paper, we analyze the relationship between two optimal outputs of neural network classifier trained with the target node method. Also, the optimal relationship is compared with those of the other error function methods such as mean-squared error and the n-th order extension of cross-entropy error. The analyses are verified through simulations on a thyroid data set.

A new approach for resource allocation in project scheduling with variable-duration activities

  • 김수영;제진권;이상우
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • pp.410-420
    • /
    • 1994
  • In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

상용 유한요소 프로그램에 기초한 댐 구조물의 신뢰성해석 (Commercial Finite Element Program-based Reliability Analysis of Dam Structures)

  • 허정원;이정학
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2003년도 봄 학술발표회 논문집
    • /
    • pp.103-110
    • /
    • 2003
  • A hybrid structural reliability analysis method that integrates a commercial finite element program and a reliability analysis algorithm is proposed to estimate the safety of real structures in this paper. Since finite element method (FEM) is most commonly and widely used in the analysis and design practice of real structures, it appears to be necessary to use general FEM program in the structural reliability analysis. In this case, simple conventional reliability methods cannot be used because the limit state function can only be expressed in an algorithmic form. The response surface method(RSM)-based reliability algorithm with the first-order reliability method (FORM) found to be ideal in this respect and is used in this paper. The intention of use of RSM is to develop, albeit approximately, an explicit expression of the limit state function for real structures. The applicability of the proposed method to real structures is examined with help of the example in consideration of a concrete dam. Both the strength and serviceability limit states are considered in this example.

  • PDF

Classification of Diagnostic Information and Analysis Methods for Weaknesses in C/C++ Programs

  • Han, Kyungsook;Lee, Damho;Pyo, Changwoo
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권3호
    • /
    • pp.81-88
    • /
    • 2017
  • In this paper, we classified the weaknesses of C/C++ programs listed in CWE based on the diagnostic information produced at each stage of program compilation. Our classification identifies which stages should be responsible for analyzing the weaknesses. We also present algorithmic frameworks for detecting typical weaknesses belonging to the classes to demonstrate validness of our scheme. For the weaknesses that cannot be analyzed by using the diagnostic information, we separated them as a group that are often detectable by the analyses that simulate program execution, for instance, symbolic execution and abstract interpretation. We expect that classification of weaknesses, and diagnostic information accordingly, would contribute to systematic development of static analyzers that minimizes false positives and negatives.