• 한국정보처리학회논문지
• /
• 제7권8호
• /
• pp.2543-2554
• /
• 2000

실시간 스케줄러는 대역폭, 필요 버퍼량 등과 같은 네트워크 자원을 효율적으로 이용하면서 한정된 통신 지연(bounded delay)을 제공해야 한다. 이러한 제한 조건을 만족시키기 위해서 많은 스케줄링 방법론이 제시되었다. 그중 EDF 스케줄링 방법론이 최적의 성능을 갖는 것으로 알려져 있다. 그러나 EDF 스케줄링 방법론은 “sort”나“search”와 같은 연산 작업을 수행함으로서, 과다한 오버헤드를 발생시킨다. Rotating Priority Queues(PRQ) 스케줄러는 EDF 연산 작업 없이 EDF 스케줄러에 근접한 성능을 갖는 스케줄러이다. 그러나 RPQ 스케줄러는 과다한 버퍼량을 필요로 한다. 본 논문에서는 이러한 문제점을 해결하기 위해서 Multiple Rotating Priority Queues(MRPQ) 스케줄러를 제시한다. MRPQ 스케줄러는 “block queue”라는 새로운 개념을 이용하여 회전 우선 순위 queue를 다중 계층으로 구성한다. 이렇게 구성된 MRPQ 스케줄러 RQP스케줄러에서 필요한 버퍼량의 반 정도의 버퍼량만을 사용하여, RPQ 스케줄러와 동일한 동작을 수행한다. 또한 MRPQ 스케줄러는 RPQ 스케줄러와 동일한 최대 지연시간을 제공한다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.612-614
• /
• 1998

As chip feature size decrease, interconnect delay gains more importance. A accurate timing analysis required to estimate interconnect delay as well as cell delay. In this paper, we present a timing-level delay calculation tool of which the accuracy is bounded within 10% of SPICE results. This delay calculation tool generates delay values in SDF(Standard Delay Format) for parasitic data extracted in SPEF(Standard Parasitic Exchange Format). The efficiency of the tool is easily seen because it uses AWE(Asymptotic Waveform Evaluation) algorithm for interconnect delay calculation, and precharacterized library and effective capacitance model for cell delay calculation.

• 대한수학회보
• /
• 제54권4호
• /
• pp.1457-1470
• /
• 2017

In this paper, we consider the stabilization of the viscoelastic wave equation with variable coefficients in a bounded domain with smooth boundary, subject to linear dissipative internal feedback with a delay. Our stabilization result is mainly based on the use of the Riemannian geometry methods and Lyapunov functional techniques.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1197-1200
• /
• 1996

This paper is concerned with the design of robust state feedback controller for a class of linear time-delay systems with norm-bounded nonlinear uncertainties. Under the proposed delay-independent criterion, asymptotic stability for the system is investigated using the conventional Lyapunov method. Moreover, the robust controller can be obtained by solving the linear matrix inequality which is equivalent to the suggested conditions.

• 대한임베디드공학회논문지
• /
• 제4권2호
• /
• pp.97-102
• /
• 2009

In this paper, the problem of stability analysis for networked control systems with norm-bounded parameter uncertainties is investigated. By construction Lyapunov's functional, a new delay-dependent stability criterion for uncertain networked control system is established in terms of LMIs (linear matrix inequalities) which can be easily by various convex optimization algorithms. One numerical example is included to show the effectiveness of proposed criterion.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.246-248
• /
• 2006

This paper is concerned with non-fragile guaranteed cost state feedback controller design algorithm for descriptor systems with time-varying delay and static state feedback controller with multiplicative uncertainty. The considered uncertainties are norm-bounded and time delay is time-varying. Under the condition of controller gain variations, conditions for the existence of controller satisfying asymptotic stability and non-fragility and controller design method are derived via LMI approach. Moreover, the measure of non-fragility and the upper bound to minimize guaranteed cost function are given.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 추계학술대회 논문집 학회본부
• /
• pp.42-45
• /
• 1996

This paper presents a solution of the $H_{\infty}$ control problem for linear systems with input time delay. $H_{\infty}$ norm bounded condition is obtained as a sufficient condition for linear systems with input time delay. Based upon this sufficient condition, an $H_{\infty}$ controller design method which involves the solutions of linear matrix inequalities via convex optimization is developed.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.383-390
• /
• 2008

Clock skew modeling is important in the performance evaluation and prediction of clock distribution network and it is one of the major constraints for high-speed operation of synchronous integrated circuits. In clock routing synthesis, it is necessary to reduce the clock skew under the specified skew bound, while minimizing the cost such as total wire length and delay. In this paper, a new efficient bounded clock skew routing method is described, which generalizes the well-known bounded skew tree method by allowing loops, i.e., link-edges can be inserted to a clock tree when they are beneficial to reduce the clock skew and/or the wire length. Furthermore, routing topology construction and wire sizing is used to reduce clock delay.

• 대한수학회지
• /
• 제38권1호
• /
• pp.177-191
• /
• 2001

We consider a linear differential game described by the delay-differential equation in a Hilbert space H; (※Equations, See Full-text) U and V are Hilbert spaces, and B(t) and C(t) are families of bounded operators on U and V to H, respectively. A(sub)0 generates an analytic semigroup T(t) = e(sup)tA(sub)0 in H. The control variables g, and u and v are supposed to be restricted in the norm bounded sets (※Equations, See Full-text). For given x(sup)0 ∈ H and a given time t > 0, we study $\xi$-approximate controllability to determine x($.$) for a given g and v($.$) such that the corresponding solution x(t) satisfies ∥x(t) - x(sup)0∥ $\leq$ $\xi$($\xi$ > 0 : a given error).

• 제어로봇시스템학회논문지
• /
• 제11권1호
• /
• pp.13-18
• /
• 2005

This paper considers a design problem of the repetitive control system for linear systems with time-varying norm bounded uncertainties. Using the Lyapunov functional for time-delay systems, a sufficient condition ensuring robust stability of the repetitive control system is derived in terms of an algebraic Riccati inequality (ARI) or a linear matrix inequality (LMI). Based on the derived condition, we show that the repetitive controller design problem can be reformulated as an optimization problem with an LMI constraint on the free parameter.