• Title/Summary/Keyword: The Priority

Search Result 6,495, Processing Time 0.036 seconds

Variable Priority Number Control of SPMS for Leisure Ship

  • Oh, Jin-Seok;Park, Do-Young
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.1
    • /
    • pp.141-148
    • /
    • 2012
  • The power system of leisure ship has a character of stand-alone type, so it continuously checks the usable power. Especially, the leisure ship using renewable energy needs to adjust the power consumption of loads according to the usable power. Also, the important loads of leisure ship are different by operation mode. However, current power management system doesnot consider such character. This paper studied load management system of the SPMS(Smart Power Management System) and composed using the smart plug. The SPMS controls the loads depending on a user's pattern and character through variable priority number control. This control algorithm was verified through simulation of assumed user and situation using LabVIEW.

A Study on the Enhancement of Priority control Algorithm for ATM Network (ATM 망용 우선순위제어 알고리즘의 개선에 관한 연구)

  • 정상국;진용옥
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.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.

  • PDF

A Study on integrated dynamic priority methods based on ATM traffic characteristics (ATM 트래픽 특성에 따른 통합 동적 우선 순위 기법에 관한 연구)

  • 최석규;이동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.6
    • /
    • pp.1470-1479
    • /
    • 1996
  • It was already proved that ATM has stability and flexibility of service applications, but because of the various characteristics of traffic and the QoS on user demandcaused by them, there are so many researches for traffic control method. In this paper, in order to give the more similar properties of the real traffic to the existing input traffic source, dividing them into four classes with different characteristics, and We proposed the integrated dynamic priority method, IDP which has advantages of the DMLT and the DQLT for time dynamic priority. Thus, it makes input queues about each of traffic classes and thresholds, and then use modified DMLT and DQLT methods. It has goal that proposed method to get more reliability and stability with advantage low loss of the DMLT, low delay of DQLT.

  • PDF

A Congestion Control Method for Real-Time Communication Based on ATM Networks

  • Zhang, Lichen
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • 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

  • PDF

An Efficient Semaphore Implementation Scheme with Event (이벤트를 고려한 효과적인 세마포어 구현 알고리듬)

  • Han, Ki-Hee;Sihn, Bong-Sik;Pi, Chan-Ho;Chong, Jong-Wha
    • Annual Conference of KIPS
    • /
    • 2002.04a
    • /
    • pp.687-690
    • /
    • 2002
  • In this paper, we present a novel semaphore implementation scheme which shortens finish time of high priority tasks and improves reliability of a system. The real-time systems have time constraints. Especially, the task with hard real-time constraints must meet its deadline. Consequently, managing shared resources is considered guaranteeing mutual exclusion as well as meeting task's deadline under unfavorable condition. According to the number and sort of the locked semaphores under the event occurred, this paper presents the reduction of the finish time of high priority task by decision whether the context switched or not. The experimental results show that the proposed method gives performance improvements in finish time of high priority tasks of about 11% over zuberi[4] method.

  • PDF

Design and Implementation of a QoS-Based Scheduling Algorithm Based on the LTE QCI Specifications

  • Ramneek, Ramneek;Choi, Wonjun;Seok, Woojin
    • Annual Conference of KIPS
    • /
    • 2014.11a
    • /
    • pp.227-230
    • /
    • 2014
  • LTE 3GPP standard defines several QCI (QoS Class Identifier) classes to provide differential QoS, depending on the requirements of different user applications.These QCI values have been characterized in terms of priority, packet loss and delay budget. In spite of the availability of this robust QoS framework in LTE, there is no such scheduling algorithm that has its working principle based on this framework. The responsibility of fulfilling the user requirements, while satisfying the service class requirements is left upon the cellular service provider and it is an open issue at present. To solve this problem, we have proposed a MAC scheduler, which defines the priority of different users based on their bearer specification and provides desired QoS in terms of the achieved throughput through the resource block allocation based on calculated user priority.

An Efficient Semaphore Implementation Scheme for an Event

  • Sihn, Bong-sik;Han, Ki-Hee;Chong, Jong-Wha
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.443-445
    • /
    • 2002
  • In this paper, we present a novel efficient semaphore implementation scheme which diminishes completion time of high priority tasks and improves reliability of a system. The real-time system is constrained to complete their tasks in time. Especially, the task of a hard real-time system must meet its deadline under unfavorable conditions. In this paper, the number and sort of the locked semaphores, when an event occurred, decide whether the context switch should occur or not, so higher priority tasks diminish in their completion time. The experimental results show that the proposed method gives performance improvements in finish time of high priority tasks of about 11% over the Zuberi.

  • PDF

The VLSI Implementation of A Usage Parameter Control based on Cell Loss Priority (셀손실 우선순위 기반의 사용 변수제어의 VLSI 구현)

  • 권재우;조태경;최명렬
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.210-212
    • /
    • 2000
  • In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks and implemented it with VLSI Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can solve the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP=0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. The result of performance evaluation shows that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.

  • PDF

A Rural Amenity Priority Assessment Model Using Information Measure Technique (정보계측기법을 이용한 농촌 어메니티 중요도 평가 모델)

  • Lee, Je-Myung;Jung, Nam-Su;Lee, Jeong-Jae
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.49 no.4
    • /
    • pp.73-79
    • /
    • 2007
  • In the evaluation of rural amenity, it is hard to estimate the worth of rural amenity as numerical values. To evaluate the worth of an abstract idea, information measure technique(IMT) can be used. In this research, rural amenity priority assessment model(RAPAM) was developed adapting IMT. To apply the developed model for assessment of rural amenity, an encyclopedia was used as information gathering and utilizing system(IGUS). The application result of the developed model which was compared with the result of survey have similar trend. $R^{2}$ is 0.8539, RMSE is 0.382 and the applicability of RAPAM was proved.

Analysis of Priority Systems with a Mixed Service Discipline

  • Hong, Sung-Jo;Hirayama, Tetsuji
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.2
    • /
    • pp.267-288
    • /
    • 1995
  • We investigate a multiclass priority system with a mixed service discipline, and propose a new approach to the analysis of performance measures (mean waiting times) of the system. Customers are preferentially served in the order of priority. The service discipline at each station is either gated or exhaustive discipline. We formulate mean waiting times as functions on the state of the system. We first consider the system at an arbitrary system state to obtain explicit formulae for the mean waiting times, and then derive their steady state values by using the property of Poisson arrivals to see time averages and the generalized Little's formula.

  • PDF