• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Steel and Composite Structures
• /
• 제51권4호
• /
• pp.363-375
• /
• 2024

Within the optimization field, addressing the intricate posed by fluidic pressure loads on functionally graded structures with frequency-related designs is a kind of complex design challenges. This paper thus introduces an innovative density-based topology optimization strategy for frequency-constraint functionally graded structures incorporating Darcy's law and a drainage term. It ensures consistent treatment of design-dependent fluidic pressure loads to frequency-related structures that dynamically adjust their direction and location throughout the design evolution. The porosity of each finite element, coupled with its drainage term, is intricately linked to its density variable through a Heaviside function, ensuring a seamless transition between solid and void phases. A design-specific pressure field is established by employing Darcy's law, and the associated partial differential equation is solved using finite element analysis. Subsequently, this pressure field is utilized to ascertain consistent nodal loads, enabling an efficient evaluation of load sensitivities through the adjoint-variable method. Moreover, this novel approach incorporates load-dependent structures, frequency constraints, functionally graded material models, and polygonal meshes, expanding its applicability and flexibility to a broader range of engineering scenarios. The proposed methodology's effectiveness and robustness are demonstrated through numerical examples, including fluidic pressure-loaded frequency-constraint structures undergoing small deformations, where compliance is minimized for structures optimized within specified resource constraints.

• ETRI Journal
• /
• 제35권3호
• /
• pp.469-479
• /
• 2013

This paper proposes an efficient computation-aware mode decision and search point (SP) allocation algorithm for spatial and quality scalabilities in Scalable Video Coding. In our proposal, a linear model is derived to allocate the computation for macroblocks in enhancement layers by using the rate distortion costs of the base layer. In addition, an adaptive SP decision algorithm is proposed to decide the number of SPs for motion estimation under the constraint of the allocated computation. Experiment results demonstrate that the proposed algorithm allocates the computation resource efficiently and outperforms other works in rate distortion performance under the same computational availability constraint.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.1213-1216
• /
• 2005

In this paper, we suggested the integer linear programming (ILP) models that went through constraint scheduling to simple cycle operation during the delay time. The delayed scheduling can determine a schedule with a near-optimal number of control steps for given fixed hardware constraints. In this paper, the resource-constrained problem is addressed, for the DFG optimization for multiprocessor design problem, formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2003-2021
• /
• 2020

Today's computer systems are widely integrated with CPU and GPU to achieve considerable performance, but energy consumption of such system directly affects operational cost, maintainability and environmental problem, which has been aroused wide concern by researchers, computer architects, and developers. To cope with energy problem, we propose a task-scheduling framework to reduce energy under performance constraint by rationally allocating the tasks across the CPU and GPU. The framework first collects the estimated energy consumption of programs and performance information. Next, we use above information to formalize the scheduling problem as the 0-1 knapsack problem. Then, we elaborate our experiment on typical platform to verify proposed scheduling framework. The experimental results show that our proposed algorithm saves 14.97% energy compared with that of the time-oriented policy and yields 37.23% performance improvement than that of energy-oriented scheme on average.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2011년도 춘계학술대회
• /
• pp.541-552
• /
• 2011

Many of Korea major companies have appled as strategy of management innovation Six Sigma, Lean and Theory of Constraints. Six Sigma has mainly focused to reduce variation. Lean has mainly focused to reduce wastes and Theory of Constraints has mainly focused that bottleneck of constrains production and sales. This bottleneck is caused by constraint resources and it should be the main role of manager to explore constraint resource. Although their mainly focus are different, they are used to improve productivity and quality. In this paper, as strategy of management innovation, study on analysis and comparison plan of Six Sigma, Lean and Theory of Constraints. From the literature survey and application cases, it is suggested and discussed that how to plan of application as strategy of management innovation successfully. The suggested plan of application could be a good guideline that it could be a apply of companies.

• 대한안전경영과학회지
• /
• 제4권1호
• /
• pp.131-139
• /
• 2002

Since introducing the "Theory of Constraints" by Goldratt, its effect was verified by lots of scholars, men of enterprise. These days it is also introducing and studying in this country with good results. The objective of this study is to show how to determine the constraint resources on DBR scheduling. Actually, previous studies based on the line which just think a load/capacity rate on doing scheduling. This study will show a scheduling method which reflects multi-parameters. It could be a standard to reflect real manufacturing surroundings. On calculating a priority of each resources, we classified factors with subjective and objective factors. And we propose a decision model to incorporate values assigned by a group of experts on different factors to select a critical resource. On deploying this model, SN ratio of Taguchi method for each of subjective and objective factors will be used. And we propose a procedure which is organized with 7 steps. To understand the logic, a numerical manufacturing simulation will be presented. This method is a incorporating decision model on determining the constraint on multi parameters with experts.h experts.

• 한국건설관리학회논문집
• /
• 제24권2호
• /
• pp.37-49
• /
• 2023

본 연구에서는 제조업 분야에서 보편적으로 활용되어 온 제약이론을 바탕으로 강교 제작공장의 생산성을 향상시키기 위한 자원할당 방법론을 제안한다. 이를 위해 도장 공정을 병목공정으로 정의한 후, 공정 전용 자원할당(OSRA), 제품 전용 자원할당(PSRA), 범용 자원할당(GRA) 등 3가지의 자원할당 방법론을 개발하였다. 강교 공급사슬 시뮬레이션 모델을 활용한 성능평가 실험 결과, GRA 방법론이 재공재고수(NWIP)와 대기시간(WT) 측면에서 가장 우수한 성능을 보였다. 특히, 강교 제작공장의 부하와 부하 변동성이 증가할수록 다른 두 전용 자원할당 방식과의 성능 격차는 더욱 커졌다. 평균적으로 GRA는 NWIP과 WT를 OSRA 대비 36.2%, 34.6%, PSRA 대비 71.0%, 70.4% 감소시켰다. 재공재고수와 대기시간의 감소는 병목현상의 완화를 의미하며, 이는 결국 강교 제작공장의 생산성이 향상되었음을 의미한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• 한국정보통신학회논문지
• /
• 제16권3호
• /
• pp.571-578
• /
• 2012

본 논문에서는 크게 두 가지 사항에 대해서 제안하고자 한다. 첫 번째는 논리합성을 위한 제약조건 방법에 대한 것이고, 두 번째는 효율적인 논리합성방법에 대한 것이다. 논리 합성은 주어진 제약조건(constraint)을 최대한 만족 시키면서 논리 사상과 최적화 등을 통하여 RTL(register transfer level) 코드로부터 게이트-수준의 네트리스트를 얻는 과정이다. 논리합성의 결과는 주어진 제약조건과 합성 방법에 매우 종속적이다. 이들에 의해서 설계의 면적 및 타이밍이 크게 변화하므로 우리는 제약조건과 합성방법을 철저하게 고려하여야 한다. 본 논문에서는 논리합성을 하는 과정에서 실제로 고려해야하는 사항들에 대해서 경험적이고 실험적인 결과를 바탕으로 혼합방식의 논리합성 기법을 제안한다. 제안된 기법을 이용하여 약 65만 게이트의 하드웨어 자원량을 사용하는 회로에 적용시켜본 결과로 상향식 방법에 비해서 합성 시간이 약 47% 감소하였고, 하향식 방법에 비해서 타이밍 특성이 우수하였다.