• Title/Summary/Keyword: Information Priority

Search Result 2,376, Processing Time 0.043 seconds

DISCRETE-TIME $Geo^X/G/l$ QUEUE WITH PLACE RESERVATION DISCIPLINE

  • Lee Yu-Tae
    • 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.

Hop-by-Hop Priority Increasing Scheme for Improving End-to-end Throughput in Multi-Hop OBS Networks (다중 홉 광 버스트 교환망에서 종단간 수율 향상을 위한 홉 단위 우선 순위 증가 기법)

  • 김병철;조유제
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.35-42
    • /
    • 2003
  • In this paper, we classified the wavelength reservation mechanisms of optical burst switching (OBS), and investigated the path length priority effect of the offset time/delayed reservation (OT/DR)-based scheme like the just-enough-time (JET) protocol. And, we showed that the fiber delay line (FDL)-based scheme can avoid the path length priority effect in multiple hop network environments. Also, we proposed a novel FDL/DR with hop-by-hop priority increasing (HPI) scheme which can improve the end-to-end throughput by increasing the priority of bursts hop-by-hop using the input FDLs at each node. The simulation results showed that the proposed FDL/DR with HPI scheme could avoid the path length priority effect and enhance the end-to-end throughput in multiple hop network environments.

Bus Arbitration Policy Using Random Function Manager (랜덤함수 매니저를 이용한 버스중재 방식)

  • Lee, Kook-Pyo;Yoon, Yung-Sup
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.11
    • /
    • pp.34-39
    • /
    • 2009
  • In this study, we have proposed the random function arbitration method using a random function manager in other to use the merits and overcome the demerits of fixed priority and round-robin, Starvation phenomenon can be generated from the master having low priority in fixed priority method. Also, round-robin method can't give a priority to important master, however, as the proposed random function arbitration method can be random set the rate of fixed priority and round-robin, we can solve the problems of conventional arbitration methods. From TLM simulation, we confirmed that the bus utilization of master could be controled from 32% to 16% and the starvation phenomenon of master could be prevented.

An Efficient Updating Algorithm for IPv6 Lookup based on Priority-TCAM (IPv6 Lookup을 위한 효율적인 Priority TCAM Table 운영 알고리즘)

  • Hong, Seung-Woo;Noh, Sung-Kee;Hong, Sung-Back;Kim, Sang-Ha
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.162-168
    • /
    • 2007
  • TCAM(Ternary content-addressable memory) has been widely used to perform fast routing lookup. It is able to accomplish the LPM(longest prefix matching) search in O(1) time without considering the number of prefixes and their lengths. As compared to software-based solutions, especially for IPv6, TCAM can oner sustained throughput and simple system architecture. However, There is no research for Priority-TCAM which can assign priority to each memory block. This paper addresses the difference or priority-TCAM compared to the existing TCAM and proposes CAO-PA algerian to manage the lookup table efficiently.

A Scheme for Resolving Priority Inversions in Real-time Operating Systems (실시간 운영체제의 우선순위 역전 현상에 대한 해결 기법)

  • Kim Inhyuk;Kim Jaekwang;Ko Kwangsun;Eom Young Ik
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.805-807
    • /
    • 2005
  • 실시간 운영체제는 정해진 시간 내에 작업처리를 완료해야 하는 분야에 주로 사용되고 있으며, 최적의 실시간 운영체제를 설계 및 개발하기 위해서는 반드시 필요한 몇 가지 조건들이 있다. 본 논문에서는 실시간 운명체제에 필요한 조건 중에서 우선순위 역전 현상을 해결하는 기법을 제안한다. 기존에 우선순위 역전 현상을 해결하기 위하여 Basic Priority Inheritance 프로토콜, Priority Ceilling Emulation 프로토콜 등이 제안되었다. 그러나 이러한 기법들은 복잡한 형태의 우선순위 역전 현상에 대해서는 해결이 불가능하거나, 실행 시 비효율성 등의 문제가 발생하기 때문에 실제로는 여러 가지 기법들과 혼용되어 사용되었다. 이에 본 논문에서는 재귀적인 형태의 자료구조를 사용하여 우선순위 역전 현상을 효과적으로 해결하는 기법을 보이고, 기존 기법들과 비교한다.

  • PDF

An Study of Information Security Observance Priority for Smartwork Activation using AHP(Analytic Hierarch Process) (계층적 분석기법(AHP)을 이용한 스마트워크 활성화를 위한 정보보호 준수사항 우선순위에 관한 연구)

  • Im, Jung-Kil;Kim, Sang-Chul;Lee, Hyeon-Uk
    • Journal of Information Technology Services
    • /
    • v.12 no.2
    • /
    • pp.291-300
    • /
    • 2013
  • In this study, divide by a private enterprise and army, 2 organizations about observed priority item among administrator, service provider, user viewpoint about the information security item for smartwork activation and in 3 steps hierarchic according to AHP technique analyzed and decided priority for information security observance item. As a result, importance difference could confirm identified by administrator, service provider, user viewpoint period of about information security observance item recognizing in a private enterprise and army.

A Cultural Property Priority Assessment Using Information Measure Technique (정보계측기법을 이용한 문화재 중요도 평가방안)

  • Jung, Nam-Su;Lee, Jeong-Jae
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.48 no.1
    • /
    • pp.41-48
    • /
    • 2006
  • In the evaluation of rural amenities, its properties are related with social, cultural, and environmental elements. In this study, Information Measure Model (IMM) and Cultural Property Priority Assessment Model (CPPAM) were developed adapting information measure model with text based surveying data. To apply developed model not only general properties but also specific surveyed data, Specific Information Gathering and Utilizing System (SIGUS) was constructed using the data in Dusan World encyclopedia. IMM shows priorities of cultural property by information in national-designated cultural properties. And CPPAM applied in surveying data in 2004 by Rural Resources Development Institute.

A Prioritized Transmission Scheme for Three-Dimensional Integral Imaging (3차원 집적 영상을 위한 우선순위 전송 기법)

  • Cho, Myungjin;Choi, Hyun-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.447-455
    • /
    • 2014
  • In this paper, we consider a representative integral imaging method in glasses-free 3D image processing and propose a prioritized transmission scheme for guaranteeing a received video quality in error-prone environments. According to the correlation of pixels consisting of each voxel of integral image, we set the priority differently and apply the modulation level according to this priority value. That is to say, the corresponding pixels with small variance are set to a high priority and transmitted by using a low level modulation that is robust under transmission errors, but the corresponding pixels with greater variance are set to a lower priority and transmitted by using a high level modulation that has a high bit error rate but fast transmission rate. Result shows that the proposed scheme that applies the error-robust modulation level to the important image bit stream with the high priority improves the peak to sidelobe ratio (PSR) of the received 3D image, compared with a typical method that use the same modulation level without distinction of priorities.

A Double-Ended Priority Queue with O(1) Insertion Amortized Time (상수 삽입 전이 시간을 가지는 양단 우선순위 큐)

  • Jung, Hae-Jae
    • The KIPS Transactions:PartA
    • /
    • v.16A no.3
    • /
    • pp.217-222
    • /
    • 2009
  • Priority queues can be used in applications such as scheduling, sorting, retrival based on a priority like gene searching, shortest paths computation. This paper proposes a data structure using array representation for double-ended priority queue in which insertion and deletion takes O(1) amortized time and O(logn) time, respectively. To the author's knowledge, all the published array-based data structures for double ended priority queue support O(logn) time insertion and deletion operations.

Disaster Recovery Priority Decision of Total Information System for Port Logistics : Fuzzy TOPSIS Approach (항만물류종합정보시스템의 재난복구 우선순위결정 : 퍼지 TOPSIS 접근방법)

  • Kim, Ki-Yoon;Kim, Do-Hyeong
    • Journal of Information Technology Services
    • /
    • v.11 no.3
    • /
    • pp.1-16
    • /
    • 2012
  • This paper is aimed to present a fuzzy decision-making approach to deal with disaster recovery priority decision problem in information system. We derive an evaluation approach based on TOPSIS(Technique for Order Performance by Similarity to Ideal Solution), to help disaster recovery priority decision of total information system for port logistics in a fuzzy environment where the vagueness and subjectivity are handled with linguistic terms parameterized by trapezoidal fuzzy numbers. This study applies the fuzzy multi-criteria decision-making method to determine the importance weight of evaluation criteria and to synthesize the ratings of candidate disaster recovery system. Aggregated the evaluators' attitude toward preference, then TOPSIS is employed to obtain a crisp overall performance value for each alternative to make a final decision. This approach is demonstrated with a real case study involving 4 evaluation criteria(system dependence, RTO, loss, alternative business support), 7 information systems for port logistics assessed by 5 evaluators from Maritime Affairs and Port Office.