• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.463-472
• /
• 2009

Real-time operating systems must have satisfying various conditions such as effective scheduling policies, minimized interrupt delay, resolved priority inversion problems, and its applications to be completed within desired deadline. The real-time operating systems, therefore, should be designed and developed to be optimal for these requirements. MicroC/OS-II, a kind of Real-time operating systems, uses the basic priority inheritance with a mutex to solve priority inversion problems. For the implementation of mutex, the kernel in an operating system should provide supports for numerous tasks with same priority. However, MicroC/OS-II does not provide this support for the numerous tasks of same priority. To solve this problem, MicroC/OS-II cannot but using priority reservation, which leads to the waste of unnecessary resources. In this study, we have dealt with new design a protocol, so called TPSP(Temporary Priority Swap Protocol), by an effective solution for above-mentioned problem, eventually enabling embedded systems with constrained resources environments to run applications.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• Journal of Korean Society for Quality Management
• /
• v.15 no.2
• /
• pp.74-81
• /
• 1987

The purpose of this paper is to find out the relative priority among the queueing products for next operation. Critical ratio scheduling is a technique for use in production scheduling to establish and maintain relative priority among the jobs. The relative priority is based on a ratio of when the completed job is required and how much time is required to complete it. A numerical example of "D" company is solved. Jobs are classified into 3 categories; the behind scheduling jobs, the on time jobs and the ahead scheduling jobs.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.15-16
• /
• 2007

In order to provide value-added services, next generation routers should perform packet classification for each incoming packet at wire-speed. In this paper, we proposed hierarchical priority trio (Hptrie) for packet classification. The proposed scheme improves the search performance and the memory requirement by replacing empty internal nodes in ordinary hierarchical trio with priority nodes which are the nodes including the highest priority rule among sub-trie nodes.

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

본 논문에서는 경성 실기간 시스템에서 발생하는 이벤트들을 효과적으로나타낼 수 있는 개선된 Statecharts 모델링 기법과 Statecharts에 Priority를 나타내는 방법을 제안한다. 일반적인 모델링 기법들은 데이터의 흐름이나 시스템의 분석에는 적합하게 사용된다. 그러나 임의적을 발생하는 이벤트에 대한 즉각적인 반응을 표현하기 어려운 단점이 있다. 본 논문에서는 기존의 모델링 기법들의 단점을 보완하고 Statecharts라는 모델링 기법의 장점들을 혼합하여 경성 실시간 시스템에 가장 적합한 개선된 Statecharts를 제안한다. 그리고 Statecharts 모델링 기법의 구조적인 특성에 맞는 새로운 방법의 Priority표현법을 제안한다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3251-3259
• /
• 1999

In this paper, we present a new mechanism applying more strict priority than RIO mechanism proposed as a drop precedence policy of AF classes in differentiated services. In this mechanism, applying strict priority to drop precedence policy, we get better performance on priority level. Simulation results indicate that the proposed mechanism may provide more efficient and more strict priority transmissions as compared to RIO regardless of traffic load.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.6
• /
• pp.584-590
• /
• 2016

This paper proposed "Priority Scheduling and MultiPath Routing Protocol (RRPS) for preventing communication disruption in the urban environment" to minimize the disconnection or disruption of V2I and V2V communication in the urban environment where communication is frequently disconnected according to density. The flow of the RRPS is explained as follows. RSU Request Priority Scheduling (RRPS) is used to apply the priority of the request message prior to reaching the end line by using the Start Line and End Line, which are the management areas of the RSU). This paper also proposed MPRP (Multi Path Routing Protocol) design to set up the multipath to the destination. As a result, the proposed RRPS improves the processing efficiency of V2I by applying priority scheduling to the message of the vehicle requesting the information in the RSU, and can prevent the communication disconnection. Thereby, it is improved the transmission success probability.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.841-856
• /
• 2008

The priority of requirement is important because the priority is a critical activity of release plan especially in software development which has an open market customer. Also, it is important for stakeholders to select a method and aspects to prioritize requirements. The selection is based on the organizational experience of a priority process, the process model of the product, goals and a type of products, and dependencies between requirements. But, the current researches considered only static dependency between requirements and did not suggest a systematic priority process. In addition, the current researches only suggest limited aspects to prioritize requirements, such as cost and value. Therefore, this paper proposes an adjustable priority process based on a priority model to select a method and aspects for the suitable priority for product and organization. Especially, this paper enhances the completeness of a release plan by a definition of static and dynamic dependency types between requirements. This paper suggests a priority model, which considers the dependencies between requirement and various viewpoint of software development. Based on the priority model, the paper suggests a systematic priority process to promote reasonable decisions to the priority and release plan of requirement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.779-792
• /
• 1993

In a switching node or an ATM multiplexer of the ATM network, a good bandwidth utilization can be achieved by the priority control using the 1-bit(Cell Loss priority) in ATM cell header. In this paper, the mixed mechanism is proposed to make up for shortcomings of existing space priority control mechanisms and to decrease the loss probability of high priority cell and its performance is analyzed about the cell loss probability. To estimate the performance of proposed mixed mechanism, its cell loss probability is compared with those of non-priority mechanism, push-out mechanism and partial buffer sharing mechanism. The cell loss probability is analyzed using a M/D/1/N modeling and a 2-state MMPP/D/1/N modeling and also comparison between two modelings is made. To verify this result of numerical analysis, the computer simulation is performed for each mechanism using the simulation language, SIMSRIPT II.5.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.611-616
• /
• 2003

Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.