• Title/Summary/Keyword: Priority Mechanism

Search Result 235, Processing Time 0.051 seconds

A Study on the Counterplan for the Reinforcement of Port State Control - Primarily on the Korean Shipping Companies - (항만국통제 강화에 따른 우리나라 해운기업의 대응방안에 관한 연구)

  • Choi. U.;Shin, H.W.;Pyo, H.Y.;Choi, Y.R.
    • Proceedings of KOSOMES biannual meeting
    • /
    • 2003.05a
    • /
    • pp.41-58
    • /
    • 2003
  • A recent trend of global shipping industry adopting Port State Control (PSC) system is recognized as a proficient mechanism in preventing costal traffic accident and protecting marine environment. Disadvantages of Korean shipping companies in PSC inspection are unavoidable as Tokyo MOU imposed priority listed flag to Korea. Having stated above, appropriate research and prompt preparation in compliance with current PSC requirements for the Korean shipping companies have become an immediate need. The objectives of this study are : First, to review in understanding of PSC in overall and foundation of enforcement. Second. to study interaction of international treaties regarding PSC. Third, to compare practical compliance among the countries and to open up a case study on Korean shipping companies in adopting PSC. Last, to suggest direction to the Korean shipping companies the most proficient way in compliance with the current Tokyo MOU requirement. Korean flagged vessels have become prioritized target in PSC inspection as Tokyo MOU imposed priority listed flag to Korea due to high detention rate of its fleet. Disadvantage of a priority listed flag is a burden in its proficient fleet operation. This study suggests solutions to the disadvantages as below. : 1) Change shore management system, and provide continuous & quality education to crew members 2) Form a network in sharing PSC information among the Korean shipping companies 3) Form a centralized function in which government, Korean Shipping register and shipowners can treat problems in a prompt manner.

  • PDF

Priority Polling and Dual Token Bucket based HCCA Algorithm for IEEE 802.11e WLAN (IEEE 802.11e WLAN을 위한 우선순위 폴링 및 이중 토큰 버킷 기반의 HCCA 알고리즘)

  • Lee, Dong-Yul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.31-41
    • /
    • 2009
  • IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

Analysis of the Price-Selection Problem in Priority-based Scheduling (우선순위 방식 스케쥴링에서의 가격선택 문제의 분석)

  • Park, Sun-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.183-192
    • /
    • 2006
  • This paper analyzes the price-selection problem under priority-based scheduling for QoS (Quality of Service) network services, i.e., how to determine the price associated with each service level. In particular, we focus on the problems with the pricing mechanism based on equilibrium analysis. We claim that the assumptions needed to produce equilibrium nay not hold in some important environments. Specifically, (a) the individual user's impact on the system is not infinitesimal and (b) users do not always have up-to-date global system-status knowledge crucial for optimal user decisions required for equilibrium. These may make the equilibrium models inaccurate in realistic environments. We examine the accuracy of some existing equilibrium methods by using a dynamic model that we have developed for system behavior analysis. The analysis indicates that equilibrium methods fail to model accurately the system behavior in some realistic environments.

A Design and Implementation of Device Driver Architecture of IEEE 1394 Network Adaptor for Guaranteeing Real-Time Characteristics (IEEE 1394 네트웍에서 실시간성 보장을 위한 디바이스 드라이버 소프트웨어 구조 설계 및 구현)

  • 박동환;임효상;강순주
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.295-307
    • /
    • 2002
  • The IEEE 1394 protocol is a de facto standard in multimedia digital home network. It supports several advanced features such as hot plugging, dynamic network reconfiguration, isochronous transmission and so on. Since the IEEE 1394 was adapted in the field of multimedia service with QoS guarantee, back bone network protocol with reel-time digital instrumentation and control sub networks, and physical layer protocol for real-time middleware such as real-time CORBA, the additional real-time features has been required in device driver implementation because of the necessity of the predictability enhancement. To guarantee the real-time features, the device driver of the IEEE 1394 should support the priority based packet processing and also need a isochronous buffer management mechanism to deal with the periodic isochronous communication. In this paper, we proposed a new software architecture of the IEEE 1394 device driver for supporting the real-time characteristics such as priority based packet processing, priority based scheduling and so on.

Priority-based Hint Management Scheme for Improving Page Sharing Opportunity of Virtual Machines (가상머신의 페이지 공유 기회를 향상시키기 위한 우선순위 큐 기반 힌트 관리 기법)

  • Nam, Yeji;Lee, Minho;Lee, Dongwoo;Eom, Young Ik
    • Journal of KIISE
    • /
    • v.43 no.9
    • /
    • pp.947-952
    • /
    • 2016
  • Most data centers attempt to consolidate servers using virtualization technology to efficiently utilize limited physical resources. Moreover, virtualized systems have commonly adopted contents-based page sharing mechanism for page deduplication among virtual machines (VMs). However, previous page sharing schemes are limited by the inability to effectively manage accumulated hints which mean sharable pages in stack. In this paper, we propose a priority-based hint management scheme to efficiently manage accumulated hints, which are sent from guest to host for improving page sharing opportunity in virtualized systems. Experimental results show that our scheme removes pages with low sharing potential, as compared with the previous schemes, by efficiently managing the accumulated pages.

Transaction Scheduling Technique Using Doible Locking in a Soft Real-Time Databaes System (소프트 실시간 데이타베이스 시스템에서 이중 록킹을 이용한 트랜잭션 스케쥴링 기법)

  • Choi, Eui-In;Go, Byeong-O
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.639-648
    • /
    • 1997
  • As the areas of computer application are expanded, the real-time applicition enviroments that must process as many transactions as possible within their deadlines have been increased recently. Conventional disk based databaes system is not appropriate in real-time transaction processing due to delying time for disk I/O processing. When the system is overloaede, the performance of transaction scheduling technique using earliest deadline first deteriorates rapidly because it can assign the highest priority ot a transaction that has already missed or is about to miss tis deadline. Therfore, the performance of suggested transaction secheduling technique is made to improved by propos-ing the doule locking mechanism based on priority. Finally, in order to evaluate the performance of the proposed priority-based double locking techniques under single proessor and main memory database system environments, the simulation model was developed using the SLAM II language.

  • PDF

A Flow Control Scheme based on Queue Priority (큐의 우선순위에 근거한 흐름제어방식)

  • Lee, Gwang-Jun;Son, Ji-Yeon;Son, Chang-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.237-245
    • /
    • 1997
  • In this paper, a flow control mechanism is proposed which is based on the priority control between communication path of a node. In this scheme, demanding length of a data queue for any pre-defined, then each node in that path is forced to maintains buffer size under the limit by controlling priority level of the path. The communication path which requires higher bandwidth sets its demanding queue length smaller. By providing relationship between the priority of a path and length of its queue, the high bandwidth requesting path has a better chance to get high bandwidth by defining the smaller demanding queue size. And also, by forcing a path which has high flow rate to maintain small queue size in the path of the communication, the scheme keep the transmission delay of the path small. The size of the demanding queue of a path is regularly adjusted to meet the applications requirement, and the load status of the network during the life time of the communication. The priority control based on the demanding queue size is also provided in the intermediate nodes as well as the end nodes. By that the flow control can provide a quicker result than end to-end flow control, it provides better performance advantage especially for the high speed network.

  • PDF

A Medium Access Mechanism to Support Urgent Message Transmission (긴급 메시지 전송을 지원하기 위한 매체 접근 기법)

  • Han, Se-Won;Oh, Young-Bin;Sim, Jae-Ki;An, Beoung-Ku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.97-105
    • /
    • 2010
  • This paper proposes an effective medium access mechanism which is based on IEEE 802.11 to transmit an urgent message, The main features of the proposed mechanism are as follows. First, when it comes to channel access to have high priority, it has a shorter interval between frames than that specified in standard document. Second, we use fixed window size instead of back-off window with an exponential increase. Performance evaluation of proposed mechanism is executed by simulation and compare with the node using the specified mechanism in standard document. Performance evaluation results show that according to increasing competition the nodes using proposed method have less accessing time than the conventional methods. Also, the proposed method can improve processing time because of the decreasing transmission delay.

Immunologic Aspects at the Feto-Maternal Interface (태아모체간 계면에서의 면역학적 측면)

  • 정인배
    • Development and Reproduction
    • /
    • v.5 no.2
    • /
    • pp.93-100
    • /
    • 2001
  • Precise mechanism by which the fetus can escape from mother's immune rejection is not well understood yet over the last 50 years. The clarification of immune mechanism at the feto-maternal interface is very important, because this can be a common pathogenesis of various pathologic conditions including spontaneous abortion, habitual abortion fetal growth restriction preeclampsia, implantation failure after assisted reproductive techniques, and fetal death. In this review, current hypothetical contents were described with the priority of importance: 1) The center of this mechanism is cross-talk between the expression of HLA-C, E, G on the extravillous cytotrophoblasts and their receptors on decidual NK cell, 2) immunomodulation, 3) innate immunity is the main immunologic mechanism, 4) various mechanisms besides HLA system(eq. complement) may be associated. The overall balance of immunomodulation among these mechanisms should result in the outcome of each pregnancy. Further researches regarding the regulation of HLA system, roles of cytokines, complements should be followed in the future.

  • PDF

Instructions and Data Prefetch Mechanism using Displacement History Buffer (변위 히스토리 버퍼를 이용한 명령어 및 데이터 프리페치 기법)

  • Jeong, Yong Su;Kim, JinHyuk;Cho, Tae Hwan;Choi, SangBang
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.10
    • /
    • pp.82-94
    • /
    • 2015
  • In this paper, we propose hardware prefetch mechanism with an efficient cache replacement policy by giving priority to the trigger block in which a spatial region and producing a spatial region by using the displacement field. It could be taken into account the sequence of the program since a history is based on the trigger block of history record, and it could be quickly prefetching the instructions or data address by adding a stored value to the trigger address and displacement field since a history is stored as a displacement value. Also, we proposed a method of replacing at random by the cache replacement policy from the low priority block when the cache area is full after giving priority to the trigger block. We analyzed using the memory simulator program gem5 and PARSEC benchmark to assess the performance of the hardware prefetcher. As a result, compared to the existing hardware prefecture to generate the spatial region using a bit vector, L1 data cache miss rate was reduced about 44.5% on average and an average of 26.1% of L1 instruction misses occur. In addition, IPC (Instruction Per Cycle) showed an improvement of about 23.7% on average.