• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.323-334
• /
• 2003

This paper presents a goal-programming (GP) model for management decision-making for sugarcane fertilizer mix problems. Sensitivity analysis on the priority structure of the goals has been performed to obtain all possible solutions. The study uses Euclidean distance function to measure distances of all possible solutions from the ideal solution. The optimum solution is determined from the minimum distance between the ideal solution and other possible solutions of the problem. The optimum solution corresponds to the appropriate priority structure of the problem in the decision-making context. furthermore, the results obtained from sensitivity analysis on the cost of combination of fertilizers confirm the priority structure.

• 전자공학회논문지A
• /
• 제33A권6호
• /
• pp.23-32
• /
• 1996

This paper proposes a new buffer management scheme to service delay-sensitive traffic and loss-sensitive traffic fairly in ATM networks. The proposed scheme uses tow buffers for delay-sensitive traffic and loss-sensitive traffic. To satisfy the average delay time of delay-sensitive traffic, cells in real-time buffer are served first. When congestion occurs in nonreal-time buffer, low loss priority cell in real-time buffer can be pushed out by high loss priority cell in nonreal-time buffer can be transferred to real-time buffer considering threshold value in real-time buffer. Using computer simulation, the existing methods and proposed scheme are compared and analyzed with respect to cell loss rate and average delay time. Simulation results show that the proposed scheme have superior performance to conventional schemes.

• 전자공학회논문지A
• /
• 제31A권2호
• /
• pp.9-17
• /
• 1994

This paper proposes Double queue threshold QLT(Queue Length Threshold) algorithm and Hysteresis effect QLT algorithm. as being DPS(Dynamic Priority Scheduling) techniques. in order to advance the processing of multiple class traffics. Also, the performance of the proposed algorithms is analyzed through computer simulations,and the priority scheduling is analyzed using a retrial queue with two types of calls. Our simulation results show that the performance of the proposed Double queue length threshold QLT algorithm is superior to that of the conventinal QLT algorithm for 2 or more classes delay sensitive traffics. Also we find that Hysteresis effecT QLT algorithm is better mechanism than that of the existing QLT for real time and non-real time traffics.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.523-533
• /
• 2006

We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

• 정보기술과데이타베이스저널
• /
• 제4권2호
• /
• pp.21-32
• /
• 1998

A primary concern of physical database design has been efficient retrieval and update of a record because predictable performance of a DBMS is indispensable to time-critical missions. To maintain such phenomenal performance, database manages often spends more than or as much as the goal of an organization can warrant. The motivation of this research stems from the fact that even predictable performance of a physical database can be hampered by stochastic query processing time, physical configurations of a database, and random arrival processes of queries. They all together affect the overall performance of a DBMS. In particular, if there are queuing delays due to limited capacity or during on-peak congestion, this paper suggest to prioritize database services. A surprising finding of this paper is that such a transition from a non-priority system to a corresponding priority-based system can be Pareto-improving in the sense that no users in the system will be worse off after the transition. Thus prioritizing database services can be a viable option for efficient database management.

• 스마트미디어저널
• /
• 제3권2호
• /
• pp.37-42
• /
• 2014

본 논문에서는 갑작스런 전력난이나 피크 전력시간 등의 비상 전력상황에서 필수적으로 동작해야 할 정보기기기가 전력을 공급받기 위해 우선순위(Priority) 제어기능을 부여한 스마트 플러그 기반의 스마트 콘센트에 의한 스마트 모니터링 및 표시장치를 갖는 스마트 미디어 플랫폼의 제어기능 설계를 제안한다. 이러한 스마트 게이트웨이는 에너지 저장장치(ESS, Energy Storage System)와 연동함으로서 스마트 플러그가 양방향 송배전과 우선순위 제어형 스마트 제어모듈에 의한 전력관리 효율을 극대화할 수 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1831-1834
• /
• 2002

In this paper, we present results of a study of congestion control for real-time communication based on ATM networks. In ATM networks, congestion usually results in cell loss. Based on the time limit and priority, the cells that compete for the same output line could be lined according to the character of real-time service. We adopt priority control algorithm for providing different QoS bearer services that can be implemented by using threshold methods at the ATM switching nodes, the cells of different deadline and priority could be deal with according to the necessity. Experiments show the proposed algorithm is effective in the congestion control of ATM real-time networks

• 기술경영경제학회:학술대회논문집
• /
• 기술경영경제학회 2002년도 제20회 동계학술발표회 논문집
• /
• pp.183-203
• /
• 2002

The governments investment in R&D has rapidly increased so that a comprehensive and coherent approach to resource allocation has necessitated. Therefore the need for priorities in science and technology has been increased according to growing resources to science and technology. This study presents the methodology, process and results of priority-setting of national strategic technologies(IT, BT, NT, ST, ET, CT) through which 77 national key technologies are selected based on the criteria. Specifically it is intended to identify strategically necessary areas of focus for R&D, help leverage limited resources most effectively, and help coordinate government R&D activities by supplying ministries with a common set of priorities.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권1호
• /
• pp.64-71
• /
• 1999

본 논문에서는 공중 광역 ATM망 환경에서 비연결형 서비스 제공에 사용되는 CLS에 적용될 수 있는 홉 카운터를 이용한 우선 순위 제어 알고리즘(Priority Control Algorithm using Hop-Count : HC-PC)의 망 자원 손실 비용을 분석하였다. 분석을 통해 우선 순위가 없을 경우 (No Priority Controls Algorithm: NO-Pc) 의 평균 셀 손실률이 HC-PC 의 평균 셀 손실률의 가중 평균보다 크거나 같은 경우 항상 NO-PC 이 평균 망 자원 손실 비용이 HC-PC 의 평균 망 자원 손실 비용에 비해 크다는 사실을 보였다. 시뮬레이션 결과는 분석에 의해 찾아진 조건이 만족됨을 보여주며 HC-PC가 NO-PC에 비해 어떠한 환경에서든지 항상 낮은 평균 망 자원 손실 비용을 가짐을 보여 준다.