• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.189-198
• /
• 2009

The traditional interrupt-based protocol processing at end hosts has two priority-inversion problems. First, low-priority packets may interrupt and delay high-priority process executionssince interrupts have the highest priority in most operating systems. Second, low-priority packet may delay high priority packets when they arrive almost simultaneously since interrupt processing is performed in a FCFS (first come, first served) order. These problems can be solved by a priority-based protocol processing policy and implementation. However, general priority-based schemes commonly have the problem of starvation and cannot support the each network flow requiring the mutually exclusive QoS since the packets are processed in the FCFS order. Therefore, the priority-based schemes are not appropriate for different QoS-demanding applications. In this paper, we present a bottom-half-based approach that relies on priority- and budget-based processing. The proposed approach allows us to solve both the starvation and priority-inversion problems, and further enables effective QoS isolation between different network connections. This feature also enables bounding the protocol processing time at an end host. We finally show through experiments that the proposed approach achieves QoS isolation and control.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.405-412
• /
• 2006

Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.

• The Journal of Information Systems
• /
• v.16 no.3
• /
• pp.91-108
• /
• 2007

To decide a reasonable investment priority of public enterprises, it is required to have an efficient evaluation standard. However, without having a standard, a budget for those enterprises has been allocated. In this research, for the efficient and reasonable budget allocation, it is discussed how to decide investment priority of information and communication enterprises of the government. In order to examine possible alternatives of the investment priority of information and communication enterprises of the government, seventeen enterprises were chosen from the enterprises of Ministry of Information and Communication. Public benefit, economic benefit, technology, politics, and step-up increase of budget were set up as evaluation standards and 16 specific standards were set up as subordinates. A hierarchical decision model was designed and analyzed by using AHP.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.147-154
• /
• 2013

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.

• Journal of the military operations research society of Korea
• /
• v.30 no.2
• /
• pp.122-132
• /
• 2004

The aim of this paper is to show the process of R&D Project-Priority Ordering in the Defense Technology field. We propose specific methods (Delphi, Analytic Hierarchy Process (AHP), Scoring) to order the R&D Project-Priority. In general, to decide the priority of R&D projects most of researches depend on questionnaires which are surveyed by experts. However, it is criticized that this process cannot reflect the limitation of experience and knowledge of experts. In this process, we separate evaluators in two parts: the first is strategic experts, the second is technical experts. Evaluators can choose and evaluate the alternatives which they are familiar with, so we can obtain reliable results. Finally, based on our process of the R&D Project-Priority Ordering we formulate policy implications for managing the defense technology.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.31 no.3
• /
• pp.58-73
• /
• 2003

It is well known that urban environment affects climate, as we can see in the quality of bio-climate. However, climate has not been recognised properly in the urban planning process. The role it flays needs to be examined for better urban environment. The main objective of this study is to investigate the climate-ecological priority area which produces cold fresh air and thermal induced wind circulation between rural and urban areas. The objective is also to improve the quality of bio-climate and wind circulation at blocked urban areas. This paper uses the measurement and analysis method of wind direction and wind speed in order to investigate the climate-ecological priority area and cold fresh air corridor. In this study, local climate conditions i.e. wind speed, wind direction, temperature, humidity etc., were measured at nine fields and analyzed. On the basis of the climate measurement, the climate ecological priority areas were delineated; These will be assigned as climate-ecological conservation areas.

• Korean Management Science Review
• /
• v.19 no.2
• /
• pp.139-153
• /
• 2002

The Analytic Hierarchy Process (AHP) is known as a very useful decision-making model developed for obtaining the relative weights of alternatives through pairwise comparison in the context of hierarchical structure. In this paper, we propose a method to reflect the reliability of evaluators in the process of pairwise comparison. This method is applied to the evaluation of aerospace technology alternatives. We have conducted a questionnaire survey for S company that is one of the representative aerospace companies in Korea. A questionnaire was designed for obtaining both the priority with considering the reliability of evaluators' importance weights (the modified AHP priority) and the priority with assuming equally reliable evaluators' importance weights (the AHP priority) in order to compare the priority derived by each of two methods. The result shows that there exists the difference hard to neglect between the final priorities gained by two methods.

• Journal of Information Technology Services
• /
• v.13 no.3
• /
• pp.201-219
• /
• 2014

This paper considers service deployment and priority optimization for multiple service-oriented applications sharing reusable services, which are deployed as multiple instances in the cloud. In order to handle variations in the workloads of the multiple applications, service instances of the individual reusable services are dynamically provisioned in the cloud. Also service priorities for each application in a particular reusable service are dynamically adjusted. In this paper, we propose an analytic performance model, based on a queueing network model, to predict the expected sojourn times of multiple service-oriented applications, given the number of service instances and priority disciplines in individual reusable services. We also propose a simple heuristic algorithm to search an optimal number of service instances in the cloud and service priority disciplines for each application in individual reusable services. A numerical example is also presented to demonstrate the applicability of the proposed performance model and algorithm to the proposed optimal decision problem.

• Journal of information and communication convergence engineering
• /
• v.15 no.4
• /
• pp.227-231
• /
• 2017

Recently, as the number of safety accidents caused by reagents increases, researches on a system that can reduce safety accidents are underway. Existing systems managed reagent cabinet through various sensors. On the other hand, there are disadvantages in that countermeasures against simultaneous danger situations are insufficient at multi-reagents cabinet. In order to solve this problem, this paper proposes a system to manage the reagents cabinet through danger priority. Danger priorities are selected through domestic chemical accident cases and the Chemical Safety Management Act. If a danger situation occurs in the reagent cabinet, make sure it is from a single or multiple reagent cabinets. For multiple reagent cabinets, compare the reagent cabinet priorities and run the device sequentially from the reagent cabinet with the highest priority. Thus, by operating the device according to the danger priority, the chain reaction can be prevented in advance and the reagent cabinet can be safely managed.

• Proceedings of the KSR Conference
• /
• 1998.05a
• /
• pp.137-159
• /
• 1998

For the construction of railroads in Metropolytan area based upon the outcome of the future demand forecast, a total of 21 lines including electrified double track segment of Ui-Jung-Bu↔Dong-Du-Chun(18.9km) in Kyung-Won Line is expected. Considering the financial difficulties and investment effect of the lines, this in the sequel brings about an important matter of deforming priority Investment plan to build electrified lines among the candidates. In the case of Japan, Tokyo metropolytan area covered In total by 2,070.1km of various lines, i.e., subway lines(241km), private lines(952.7km), JR lines(876.4km), provides convenient means of transportation for the coummuters and makes a contribution to the development of its neighboring areas and to the expansion of settlement areas. Comparing the total length per 1,000$\textrm{km}^2$, Tokyo(105), Paris(117), and London(115) are at least 6 times as large as ours(15). The purpose of this study is two fold provide a basic scheme for building railroads in metropolytan area and determine priority order in accordance with some evaluation criteria.