• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.747-748
• /
• 2008

In this paper, we propose a new algorithm for task scheduling consisting of subtask partitioning and subtask priority scheduling steps in order to keep the peak power under the system specification. The subtask partitioning stepis performed to minimize the idle operation time for processors by dividing a task into multiple subtasks using the least square method developed with power consumption pattern of tasks. In the subtask priority scheduling step, a priority is assigned to a subtask based on the power requirement and the power variation of subtask so that the peak power violation can be minimized and the task can be completed within the execution time deadline.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.242-245
• /
• 2001

This study is aimed to design a priority setting algorithm necessary for evaluating and selecting interdependent R&D planning system alternatives. In case that the relationship of technology alternatives is interdependent, a relative importance as occurrence or nonoccurrence of the technology alternatives viewed from the future time varies. So, we are subject to design the evaluation process considering a cross- impact of future technology alternatives. Thus, we apply the cross impact analysis (CIA) model to consider the cross-impact among interdependent system alternatives. Also, the analytic hierarchy process(AHP) model is applied to determine the priority of alternatives by taking the pair-wise comparison among factors.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2003.10a
• /
• pp.99-102
• /
• 2003

The purpose of this study is the making of standard which is optimal region selection for the creation of the naturally favorable waterfront area. We surveyed data of twenty two site in Korea where are managed KARICO(Korea Rural Infrastructure Corporation). Three different evaluation methods, simple score give method, subjective evaluation method, and check-list method were used. We were divided into "the highest priority area in consolidation rank", "the priority area in consolidation rank", the other area in consolidation rank". Thus, the object areas for consolidation of environment friendly canals will be chosen as in an objective manner and they will be good use of the long-term plan for consolidation of environment friendly canals.

• The Journal of Korea Robotics Society
• /
• v.1 no.1
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• The Journal of the Korea Contents Association
• /
• v.21 no.6
• /
• pp.12-18
• /
• 2021

A proportional share scheduler allocates CPU time to tasks and determines which task will be dispatched according to their priorities. In this paper, we investigate the correlation between the characteristics of applications and task priorities in the Linux Completely Fair Scheduler(CFS), which is one of the representative proportional share schedulers. We also propose a method of controlling the granularity of priority assignments according to the characteristics of applications. We implemented the proposed technique in a Linux system and confirmed the meaningful experimental results.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.175-186
• /
• 2009

A new medium access control (MAC) scheme embedding physical channels into multiband carrier sense multiple access/collision avoidance (CSMA/CA) networks is proposed to provide strict quality of service (QoS) guarantee to high priority users. In the proposed scheme, two priority classes of users, primary and secondary users, are supported. For primary users physical channels are provided to ensure strict QoS, whereas secondary users are provided with best-effort service using CSMA/CA modified for multiband operation. The performance of the proposed MAC scheme is investigated using a new multiband CSMA/CA Markov chain model capturing the primary user activity and the operation of secondary users in multiple bands. The throughput of secondary users is obtained as a function of the primary user activity and other CSMA/CA parameters. It is shown that the new MAC scheme yields larger throughput than the conventional single-band CSMA/CA when both schemes use the same bandwidth.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1949-1955
• /
• 2000

This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

• Management Science and Financial Engineering
• /
• v.13 no.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.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.70-73
• /
• 1998

This paper present a new priority control mechanism which is to balance the cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements. And, to reduce the delay rates we modified existing cell scheduling scheme. Throughout the computer simulation, the existing methods and proposed scheme is compared with respect to cell loss rate and average delay time. In the result of simulation, the proposed scheme have more improved performance than the other schemes with respect to cell loss rate and average delay time.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2000.11a
• /
• pp.44-48
• /
• 2000

In this study was modify the PRMA for supporting various types of traffic classes such as CBR, VBR, ABR and UBR. For uplink, we use reservation slots and so the performance will not degrade in case of over load conditions. For downlink broadcasting slots for informing the status of slot reservations are used so the high priority priority terminal can preempt. And we use almost same size buffer as the frame size. So we can dynamically deal with, the traffic changes of VBR terminals. It makes easy for the terminals to reserve supplementary slots. Each terminal is reallocated by the priority of traffic classes and so we can easily select the dropping packets in case of overload conditions. As a result, using our scheme, we can get high channel efficiency and get low packet dropping ratio and delay.