• Title/Summary/Keyword: Fixed priority

Search Result 139, Processing Time 0.019 seconds

The Analysis of Priority Output Queuing Model by Short Bus Contention Method (Short Bus contention 방식의 Priority Output Queuing Model의 분석)

  • Jeong, Yong-Ju
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.459-466
    • /
    • 1999
  • I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

  • PDF

Design on Fixed Quantity Analytical Model for Information System Audit based on Requirements (요구사항 기반 정보시스템 감리의 정량화 분석 모델 설계)

  • Kim, Hee-Wan;Kim, Hun-Kyeom;Koh, Chan;Kim, Dong-Soo
    • Journal of Digital Convergence
    • /
    • v.9 no.5
    • /
    • pp.141-156
    • /
    • 2011
  • Auditors' subjective opinions m audit activities weaken reliability in audit judgments. This paper suggests fixed quantity models through requirement priority for improving objective evaluation and priorities of requirements in information system audit. The value of requirements was evaluated based on customers' requirements with a premise that they are not in the same level. Furthermore, the audit objective judgments were enhanced to enable fixed quantity of subjective audit by subdividing detailed evaluation index of requirement priority standards into importance of service and function on orderers' perspective, and sectioning cost and schedule on contractors' perspective.

A Fixed Priority Queue Median with Jockeying on a Network

  • Jung, Kyung-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.15 no.1
    • /
    • pp.117-133
    • /
    • 1990
  • This paper is concerned with determining a minisum location with jockeying for a server on a probabilistic network in which each customer type enters the network system permitting with jockeying through a specified node and a nonpreemptive service policy is in effect. An algorithm to locate a single Fixed Priority Queue Median with Jockeying (FPQMJ) on acyclic networks is developed by using the Generalized Benders' Decomposition technique. The results are then extended to a general network.

  • PDF

Overload control of SCP in intelligne netowrk with fairness and priority (지능망 구조에서 공정성과 우선순위를 보장하는 과부하 제어 연구)

  • Lee, Yong;Song, Joo-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.12
    • /
    • pp.3098-3108
    • /
    • 1996
  • This paper proposed two mechanisms of fixed method and new arrival method. They are all interactive meachanisms in that a SCP and the SSPs exchange load information for overload control. These mechanisms using simple algorithm based on the standard ACG, apply differenct call gapping time on each SSP under the fairness scheme when they allocates SCP capacity to competing demends. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. Fairness about the probability of rejection is maintained same value on all SSPs. On Priority scheme, new arrival method has better achievement than fixed method.

  • PDF

Characteristic comparison of various arbitration policies using TLM method (TLM 방법을 이용한 다양한 중재 방식의 특성 비교)

  • Lee, Kook-Pyo;Koh, Si-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1653-1658
    • /
    • 2009
  • SoC(System on a Chip) has several masters, slaves, arbiter and decoder in bus architecture. Master initiates the data transactions like CPU, DMA and DSP and slave responses the data transactions like SRAM, SDRAM and register. Furthermore, as multiple masters can't use a bus concurrently, arbiter plays an role in bus arbitration. In compliance with the selection of arbitration method, SoC performance can be changed definitely. In this study, we compare the characteristics of various arbitration policies using TLM(Transaction Level Model) method. Fixed priority, round-robin, TDMA and Lottery bus policies are used in general arbitration method. We analyze the merit and demerit of these arbitration policies.

The Hybrid Bus arbitration policy (하이브리드 버스 중재 방식)

  • Lee, Kook-Pyo;Yoon, Yung-Sup
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.2
    • /
    • pp.50-56
    • /
    • 2009
  • SoC(System on a Chip) has several masters, slaves, arbiter and decoder in bus architecture. Master initiates the data transactions like CPU, DMA and DSP and slave responses the data transactions like SRAM SDRAM and register. Furthermore, as multiple masters can't use a bus concurrently, arbiter plays an role in bus arbitration. In compliance with the selection of arbitration method, SoC performance can be changed definitely. Fixed priority, round-robin, TDM arbitration are used in general arbitration method, In this study, we compose TLM algorithm and analyze general arbitration methods through TLM simulation. Consequently, we propose the hybrid bus arbitration policy and verify the performance, compared with the other arbitration methods.

Maximal-Flow-Problem with transit priority in a track (통과 우선순위가 있는 선로의 최대 흐름문제)

  • 이달상;김만식
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.21
    • /
    • pp.111-117
    • /
    • 1990
  • This paper treats the problem to schedule for train with low transit priority so as to maximizing the number that can be sent during given time without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time-Expanded Network without traverse time through application of Ford-Fulkerson Model, develop a TENET GENerator(TENETGEN) and obtain the data of TENET using developed TENETGEN. Finally, we seek the optimal solution to these data with Dinic's Maximal-Flow Algorithm and examine the availability of our procedures in personal computer.

  • PDF

Method for Message Processing According to Priority in MQTT Broker (MQTT Broker에서 우선순위에 따른 메시지 처리를 위한 방법에 관한 연구)

  • Kim, Sung-jin;Oh, Chang-heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1320-1326
    • /
    • 2017
  • Recently, IoT has been studying a lightweight protocol to satisfy device communication in a limited network environment. MQTT is a typical lightweight protocol. It supports small fixed headers to minimize overhead, and adopts publish/subscribe structure to guarantee real-time performance. However, MQTT does not support prioritization of important data and can not provide QoS in a specific IoT service. In this paper, we propose a message processing method to consider the priority of various IoT services in MQTT. In the proposed method, the priority flag is added to the fixed header of the MQTT in the node to transmit the message, and the broker confirms the priority of the corresponding message and processes it preferentially. Through experiment and evaluation, we confirmed the reduction of end-to-end delay between nodes according to priority.

Picture Quality Control by Priority Among Multiple Video Sources

  • KWON SOON-KAK;KWON OH-JUN
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.6
    • /
    • pp.744-752
    • /
    • 2005
  • When the multiple video sources are transmitted together through the channel of fixed bandwidth, an efficient picture quality control is necessary. This paper presents a joint picture quality control method to satisfy the user requirement by priority among the video sources. The better picture quality is assigned to the source of higher priority compared to lower priority. We obtain the bitrate for each source to have a required distortion level among the sources by using an approximate distortion-bitrate model for simple implementation. It is shown by simulation that the proposed bandwidth allocation method can keep almost the user-required picture quality among the sources in comparison to an independent bandwidth allocation method.

  • PDF

Bus Arbitration Considering Waiting cycle (대기사이클 고려 버스중재방식)

  • Lee, Kook-Pyo;Joung, Yang-Hee;Kang, Seong-Jun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2703-2708
    • /
    • 2014
  • The conventional bus system architecture consists of masters, slaves, arbiter, decoder and so on in shared bus. As several masters can't use a bus concurrently, arbiter plays an role in arbitrating the bus. The efficiency of bus usage can be determined by the selection of arbitration method. Fixed Priority, Round-Robin, TDMA and Lottery arbitration policies are studied in the conventional arbitration method where the bus transaction cycle, the wait cycle and the priority are primarily considered. In this paper, we propose the arbitration method that considers the wait cycle. Furthermore, we verify the bus transaction cycle and the wait cycle compared with the other arbitration methods through TLM(Transaction Level Model).