• 정보처리학회논문지A
• /
• 제16A권3호
• /
• pp.217-222
• /
• 2009

우선순위 큐는 스케줄링, 정렬, 유전자 검색과 같은 우선순위에 따른 검색, 최단거리 계산과 같은 응용에 사용될 수 있다. 본 논문에서 제안하는 배열을 이용한 양단 우선순위 큐 자료구조는 삽입과 삭제 연산에 각각 O(1) 전이시간과 O(logn) 시간이 걸린다. 본 저자가 알고 있는 한, 지금까지의 배열을 이용한 양단우선순위 큐 알고리즘은 삽입과 삭제에 모두 O(logn) 시간이 걸린다.

• 산업공학
• /
• 제15권4호
• /
• pp.460-473
• /
• 2002

The objective of this paper is to design a Goal Alternatives Disposition System having three main subsystems for setting, evaluating and selecting goal alternatives. For setting of goal alternatives, System Alternatives Tree(SAT) structure will be developed, which has a computation algorithm for setting decision alternatives by the concept of System Priority Number(SPN). For evaluating and selecting of goal alternatives; First, Normative and Exploratory Priority Indices which consider technical performance to the goal, cost and feasibility are developed respectively. Second, Integrated Priority Index is built up to determine the total priority of the Goal Alternatives Disposition(GAD) system. For the design and verification of the GAD system, technological forecasting structure theory, systems engineering methodology will be used.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.29-46
• /
• 2007

This paper makes an attempt to compare the two important methods for finding solutions of multi-item inventory problem with more than one conflicting objectives. Panda et al.[9] discusses a distance-based method to find the best possible compromise solution with variation of priority under the given weight structure. In this paper, the problem in [9] is revisited through the Pareto-optimal front of genetic algorithm with the help of a situation of retail stocking of FMCG business. The advantages of using the solutions from the perspective of the decision maker obtained through multi-objective optimization are highlighted in terms of population search, weighted goals and priority structure, cost, set of compromise solutions along with prevention of stock-out situation.

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

• 한국정보처리학회논문지
• /
• 제6권11호
• /
• pp.3131-3139
• /
• 1999

Satisfying the rigid timing requirements of various real-time activities in real-time systems often requires some special methods to tune the systems run-time behaviors. Unbounded blocking can be caused when a high priority activity cannot preempt a low priority activity. In such situation, it is said that a priority inversion has occurred. The priority inversion is one of the problems which may prevent threads from meeting the deadlines in the real-time systems. It is difficult to remove such priority inversion problems in the kernel at the same time to bound the worst case blocking time for the threads. A thread is a piece of executable code which has access to data and stack. In this paper, a new real-time systems. It is difficult to remove such priority inversion problems in the kernel at the same time to bound the worst case blocking time for the threads. A threads is a piece of executable code which has access to data and stack. In this paper, a new real-time server model, which minimizes the duration of priority inversion, is proposed to reduce the priority inversion problem. The proposed server model provides a framework for building a better server structure, which can not only minimize the duration of the priority inversion, but also reduce the deadline miss ratio of higher priority threads.

• 정보처리학회논문지C
• /
• 제10C권5호
• /
• pp.611-616
• /
• 2003

최근 HFC(Hybrid Fiber Coax) CATV 망이 초고속망의 하부구조로 자리를 잡아가고 있다. HFC-CATV 망의 상향채널은 가입자에서 헤드엔드로 데이터 전송시 500가입자 이상이 공유하기 때문에 충돌이 발생하게 된다. 특히, 음성, 비디오 그리고 데이터와 같은 다양한 종류의 트래픽 QoS(Qualify of Service)를 만족시키기 위해서 서비스별로 우선순위를 고려한 알고리즘이 요구되어진다. IEEE 802.14에서 제안된 우선순위 기반 3진 트리(Ternary tree)알고리즘은 정적 PNA(Priority New Access) 슬롯 구조를 가진다. 이 방법은 실시간으로 변화하는 트래픽의 요구 지연(request delay)이 높게 유지되며 서로 다른 우선순위 트래픽의 요구 경쟁 확률이 동일하다는 문제점을 가지고 있다. 따라서, 본 논문에서는 동적 PNA(Priority New Access) 슬롯 구조를 제안하여 높은 우선순위 트래픽의 요구지연을 낮게 하고 새로운 스테이션에 대해 우선순위 별로 경쟁 확률을 다르게 하는 알고리즘을 제안한다. 동일한 조건하에 두 알고리즘에 대해 요구지연 값을 비교 분석하였다. 성능 분석 결과 동적 PNA 우선순위 충돌해결알고리즘이 정적 PNA 우선순위 충돌해결알고리즘보다 낮은 요구지연을 가진다는 것을 확인할 수 있었다.

• 한국도로학회논문집
• /
• 제17권6호
• /
• pp.117-126
• /
• 2015

PURPOSES : This study prioritizes potential technology for establishing a safe work zone environment on roadways. We consider almost all conceivable technologies that enable mitigation of unexpected accidents for both road workers and drivers. METHODS : This study suggests a methodology to set the priority of potential technology for establishing a safe work zone environment by using the analytical hierarchy process (AHP). For this purpose, the AHP structure was first developed. Thereafter, a web-based survey was conducted to collect experts' opinions. Based on the survey results, weights associated with the relevant criteria of the developed structure were estimated. With the consistency index (CI) and consistency ratio (CR), we verified the estimated weights. In addition, a sensitivity analysis was performed to confirm whether the estimated weights were reliable. We finally proposed the priority for potential technology for establishing a safe work zone environment on roadways. RESULTS : In the first level, safety technology has the highest priority, and real-time information delivery for work zone, hazard warning for drivers, and temporal automated operation for traffic facilities were selected in the second level of hierarchy. CONCLUSIONS : The results imply that establishing the priority will be useful to establish a future road map for improving the work environment for road workers and drivers by employing appropriate protection facilities and developing safety systems.

• 산업경영시스템학회지
• /
• 제43권4호
• /
• pp.1-14
• /
• 2020

Recently, M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers have applied to the analysis of communication systems with two heterogeneous traffics : delay-sensitive traffic and loss-sensitive traffic. However, these studies are limited to M/G/1 priority queues with finite and infinite buffers under a work-conserving priority discipline such as the nonpreemptive or preemptive resume priority discipline. In many situations, if a service is preempted, then the preempted service should be completely repeated when the server is available for it. This study extends the previous studies to M/G/1 priority queues with finite and infinite buffers under the preemptive repeat-different and preemptive repeat-identical priority disciplines. We derive the loss probability of high-priority customers and the waiting time distributions of high- and low-priority customers. In order to do this, we utilize the delay cycle analysis of finite-buffer M/G/1/K queues, which has been recently developed for the analysis of M/G/1 priority queues with finite and infinite buffers, and combine it with the analysis of the service time structure of a low-priority customer for the preemptive-repeat and preemptive-identical priority disciplines. We also present numerical examples to explore the impact of the size of the finite buffer and the arrival rates and service distributions of both classes on the system performance for various preemptive priority disciplines.

• International Journal of Advanced Culture Technology
• /
• 제9권4호
• /
• pp.363-375
• /
• 2021

The purpose of this study is to analyze the safety of evacuation using the Pathfinder program for the alert at once, the priority alarm method, the priority alarm method for the four floors above, and the sequential priority alarm method, which is a modification of the priority alarm method specified in the tourist hotel building. Currently, in Korea's National Fire Safety Codes (NFSC), fire alarm methods are compulsorily applied differently depending on the number of floors and total floor area of a building. Although the growth rate is getting faster due to the diversification of building structures, it is still an obstacle to improving evacuation safety to comply with the standardized fire alarm method in NFSC. As a result of the experiment, the evacuation time was found to be faster with the priority alarm method for the four floors above than the priority alarm method applied to the specific firefighting object. Compared to the priority alarm method applied to the tourist hotel, which is a specific firefighting target with 5 or more floors and a total floor area of more than 3,000m2, the time was shortened by 3.7 seconds when measured by applying the priority alarm method for the four floors directly above. This indicates that it is necessary to take measures to select a fire alarm method suitable for the structure and environmental conditions of the building rather than applying the uniform NFSC regulations.

• 한국통신학회논문지
• /
• 제21권1호
• /
• pp.119-130
• /
• 1996

This paper is the part I of the full study about improved structure of fully interconnected ATM switch to develop the small sized switch element and practical implemention of switch network. This part I paper describes about proposed switch structure, performance evaluations and some of considerations to practical implementation. The proposed structure is constructed of two step buffering scheme in a filtered multiplexer. First step buffering is carried out by small sized dedicated buffers located at each input port. And second step buffering is provided by a large sized common buffer at the output port. To control bursty traffic, we use speed up factor in multiplexing and priority polling according to the levels of buffer occupancy. Proposed structure was evaluated by computer simulation with two evaluation points. One is comparision of multiplexing discipline between hub polling and priority polling. The ogher is overall which should be considered to improve the practical implementation.