• Title, Summary, Keyword: Integer linear programming (ILP)

Search Result 19, Processing Time 0.032 seconds

Power-Delay Product Optimization of Heterogeneous Adder Using Integer Linear Programming (정수선형계획법을 이용한 이종가산기의 전력-지연시간곱 최적화)

  • Kwak, Sang-Hoon;Lee, Jeong-Gun;Lee, Jeong-A
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.10
    • /
    • pp.1-9
    • /
    • 2010
  • In this paper, we propose a methodology in which a power-delay product of a binary adder is optimized based on the heterogeneous adder architecture. We formulate the power-delay product of the heterogeneous adder by using integer linear programming(ILP). For the use of ILP optimization, we adopt a transformation technique in which the initial non-linear expression for the power-delay product is converted into linear expression. The experimental result shows the superiority of the suggested method compared to the cases in which only conventional adder is used.

Variable Aggregation in the ILP Design of WDM Networks with Dedicated Protection

  • Tornatore, Massimo;Maier, Guido;Pattavina, Achille
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.419-427
    • /
    • 2007
  • In wavelength-division-multiplexing(WDM) networks a link failure may cause the failure of several high-bit-rate optical channels, thereby leading to large data loss. Recently, various protection and restoration mechanisms have been proposed to efficiently deal with this problem in mesh networks. Among them, dedicated path protection(DPP) is a promising candidate because of its ultra-fast restoration time and robustness. In this work we investigate the issue of planning and optimization of WDM networks with DPP. Integer linear programming(ILP), in particular, is one of the most common exact method to solve the design optimization problem for protected WDM networks. Traditional ILP formalizations to solve this problem rely on the classical flow or route formulation approaches, but both these approaches suffer from a excessively high computational burden. In this paper, we present a variable-aggregation method that has the ability of significantly reducing the complexity of the traditional flow formulation. We compare also the computational burden of flow formulation with variable aggregation both with the classical flow and route formulations. The comparison is carried out by applying the three alternative methods to the optimization of two case-study networks.

Coverage Maximization in Environment Monitoring using Mobile Sensor Nodes (이동센서노드를 이용한 환경감시 시스템에서의 커버리지 최대화)

  • Van Le, Duc;Yoon, Seokhoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • /
    • pp.116-119
    • /
    • 2015
  • In this paper we propose an algorithm for environment monitoring using multiple mobile sensor (MS) nodes. Our focus is on maximizing sensing coverage of a group of MS nodes for monitoring a phenomenon in an unknown and open area over time. In the proposed algorithm, MS nodes are iteratively relocated to new positions at which a higher sensing coverage can be obtained. We formulated an integer linear programming (ILP) optimization problem to find the optimal positions for MS nodes with the objective of coverage maximization. The performance evaluation was performed to confirm that the proposed algorithm can enable MS nodes to relocate to high interest positions, and obtain a maximum sensing coverage.

  • PDF

Optimal Design for Heterogeneous Adder Organization Using Integer Linear Programming (정수 선형 프로그래밍을 이용한 혼합 가산기 구조의 최적 설계)

  • Lee, Deok-Young;Lee, Jeong-Gun;Lee, Jeong-A;Rhee, Sang-Min
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.8
    • /
    • pp.327-336
    • /
    • 2007
  • Lots of effort toward design optimizations have been paid for a cost-effective system design in various ways from a transistor level to RTL designs. In this paper, we propose a bit level optimization of an adder design for expanding its design space. For the bit-level optimization, a heterogeneous adder organization utilizing a mixture of carry propagation schemes is proposed to design a delay-area efficient adder which were not available in an ordinary design space. Then, we develop an optimization method based on Integer Linear Programming to search the expanded design space of the heterogeneous adder. The novelty of the Proposed architecture and optimization method is introducing a bit level reconstruction/recombination of IPs which have same functionality but different speed and area characteristics for producing more find-grained delay-area optimization.

A New ILP Scheduling Algorithm that Consider Delay Constraint (지연 제약 조건을 고려한 새로운 ILP 스케줄링 알고리즘)

  • Kim, Ki-Bog;Lin, Chi-Ho
    • Proceedings of the IEEK Conference
    • /
    • /
    • 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.

  • PDF

Heuristic Algorithms for Optimization of Energy Consumption in Wireless Access Networks

  • Lorincz, Josip;Capone, Antonio;Begusic, Dinko
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.626-648
    • /
    • 2011
  • Energy consumption of wireless access networks is in permanent increase, which necessitates development of more energy-efficient network management approaches. Such management schemes must result with adaptation of network energy consumption in accordance with daily variations in user activity. In this paper, we consider possible energy savings of wireless local area networks (WLANs) through development of a few integer linear programming (ILP) models. Effectiveness of ILP models providing energy-efficient management of network resources have been tested on several WLAN instances of different sizes. To cope with the problem of high computational time characteristic for some ILP models, we further develop several heuristic algorithms that are based on greedy methods and local search. Although heuristics obtains somewhat higher results of energy consumption in comparison with the ones of corresponding ILP models, heuristic algorithms ensures minimization of network energy consumption in an amount of time that is acceptable for practical implementations. This confirms that network management algorithms will play a significant role in practical realization of future energy-efficient network management systems.

Design and Implementation of a Genetic Algorithm for Optimal Placement (최적 배치를 위한 유전자 알고리즘의 설계와 구현)

  • 송호정;이범근
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.3
    • /
    • pp.42-48
    • /
    • 2002
  • Placement is an important step in the physical design of VLSI circuits. It is the problem of placing a set of circuit modules on a chip to optimize the circuit performance. The most popular algorithms for placement include the cluster growth, simulated annealing and integer linear programming. In this paper we propose a genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing by analyzing the results of each implementation.

  • PDF

Wavelength and Waveband Assignment for Ring Networks Based on Parallel Multi-granularity Hierarchical OADMs

  • Qi, Yongmin;Su, Yikai;Jin, Yaohui;Hu, Weisheng;Zhu, Yi;Zhang, Yi
    • ETRI Journal
    • /
    • v.28 no.5
    • /
    • pp.631-637
    • /
    • 2006
  • In this paper we study the optimization issues of ring networks employing novel parallel multi-granularity hierarchical optical add-drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off-line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large-scale OADM networks.

  • PDF

Design and Implementation of a Stochastic Evolution Algorithm for Placement (Placement 확률 진화 알고리즘의 설계와 구현)

  • 송호정;송기용
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.1
    • /
    • pp.87-92
    • /
    • 2002
  • Placement is an important step in the physical design of VLSI circuits. It is the problem of placing a set of circuit modules on a chip to optimize the circuit performance. The most popular algorithms for placement include the cluster growth, simulated annealing and integer linear programming. In this paper we propose a stochastic evolution algorithm searching solution space for the placement problem, and then compare it with simulated annealing by analyzing the results of each implementation.

  • PDF

A Scheduling Technique for Pipelined Datapath Synthesis (파이프라인형 데이타패스 합성을 위한 스케쥴링 기법)

  • 이근만;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.4
    • /
    • pp.74-82
    • /
    • 1992
  • This paper deals with the scheduling problems, which are the most important subtask in High-level Synthesis. ILP(integer linear programming) formulations are used as a scheduling problem approach.For practical application to digital system design, we have concentrated our attentions on pipelined datapath scheduling. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule. Finally, we can obtain better and near-optimal scheduling results.

  • PDF