• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.694-696
• /
• 1998

ILP마이크로세서를 위한 스테쥴링 과정에서 메모리 명령어가 프로그램의 임계 경로로에 존재할 경우에 이의 스케쥴링은 성능 향상에 중요한 문제 중에 하나이다. 메모리 명령어의 원활한 코드 이동을 위해서는 장애가 되는 명령어들의 메모리 주소간의 의존성의 분석을 필요로 한다. 본 논문에서는 컴파일 시간에 메모리 주소간의 의존성 분석을 통한 성능 향상도를 VLIW환경 하에서 비교한다. 실험결과. 컴파일 시간에 메모리 주소 모호성 제거기를 사용한 경우 16ALU프로세서에서 정수 벤치마크 프로그램에 대해서 기하 평균으로 약 3.6%의 성능 향상이 가능하다.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1355-1358
• /
• 2003

This paper presents performance analysis of the embedded application, called EEMBC consisting of 5 categories and total 34 applications. We measured various performance metrics, such as code sizes, TLP(Thread Level Parallelism) using OpenMP API and ILP(Instruction Level Parallelism) on ARM-modeled SimpleScalar in detail. We show that the embedded applications have the similar characteristics as integer applications to deliver low ILP and TLP in our environment. They have many small loops, which result in large instruction overhead in TLP and loop control overhead in ILP.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.1
• /
• pp.7-14
• /
• 1999

In this paper, we deals with operator allocation and binding in high-level synthesis. We proposed a new methode to allocation and bind for scheduled operations on each control step after scheduling. Especially, we take account ILP formulation in order to get optimal allocation and binding result. Experiment was done on the HAL DFG model of Differential Equation, to show it's effectiveness.

• 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.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.310-313
• /
• 2000

This paper presents a new scheduling method for ILP processing called NHS(Novel Hybrid Scheduling). It concerns not only exploiting as much ILP as possible like other state-of-the-art scheduling scheme, but also choosing the most important instructions among many ready-to-execute instructions to processors in order to reduce the execution time under limited hardware resource. At the heart of NHS is a conception called CCP(Complex Critical Path), an extension of CP(Critical Path). By using CCP, compiler not only can get a global information of the whole program to extract ILP, but also can collecting data dependence information and control flow information. The paper also presents the simulation results, to date, of our attempts to study the NHS scheduling method. The results indicate good potential for this scheduling method.

• Korean Security Journal
• /
• no.36
• /
• pp.227-253
• /
• 2013

The threat of crime became a global issue nowadays. Terrorism, organized crime, crime by nation can be mentioned as typical examples. The crimes in modern society can't be identified to happen when, where and how being different from those traditional crimes(murder, robbery, sexual abuse, arson). This was the result of changed security environment that needs to address wide range of crimes as being indicated sporadic characteristics of modern threat of crime such as terrorism threat targeting unidentified masses as well as the emergence of systemic phenomenon of organized crimes and crime committed by nation. In this regard, the case of 9.11 occurred in 2001 can be deemed as an example that made a dramatic turn around to the security environment. After the terrorism, it provided an opportunity to rethink not only USA but also to the institutions all over the world that deals with crime about gathering, management, utilization of crime intelligence. As a result of which there appeared a change in police activities more effectively in gathering & managing crime information and ILP is the very activity that emerged from the USA/UK countries. This aims police activities to minimize the threat of crime being the system reflecting a framework to manage more directly to control crime by gathering and processing information. In view of the global change of security environment as a common phenomenon, the need to direct to ILP has increased in Korea in line with such security environmental change. Accordingly, this study focused on the method of introduction of ILP and presentation of matters for discussion by reviewing ILP activities of the USA/UK countries.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.87-95
• /
• 2005

value prediction in high performance micro processors is a technique that exploits Instruction Level Parallelism(ILP) by predicting the outcome of an instruction and by breaking and executing true data dependences. In this paper, the mean Performance improvements by predictor according to a point of time for update of each table as well as prediction accuracy and Prediction rate are measured and assessed by comparison and analysis of value predictor that issues in parallel and run by predicting value, which is for Performance improvements of ILP in micro Processor. For the verification of its validity the SPECint95 benchmark through the simulation is compared by making use of execution driven system.

• 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.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.