• Title/Summary/Keyword: QUEUE

Search Result 1,262, Processing Time 0.026 seconds

A Task Group-based Real-Time Scheduling Technique m the Non-Preemptive TinyOS (비선점 환경의 TinyOS에서 실시간성을 고려한 태스크 그룹 기반의 스케줄링 기법)

  • Son, Chi-Won;Tak, Sung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.9
    • /
    • pp.1285-1298
    • /
    • 2010
  • Since the TinyOS incorporating a non-preemptive task scheduling policy uses a FIFO (First-In First-Out) queue, a task with the highest priority cannot preempt a task with lower priority before the task with lower priority must run to completion. Therefore, the non-preemptive TinyOS cannot guarantee the completion of real-time user tasks within their deadlines. Additionally, the non-preemptive TinyOS needs to meet the deadlines of user tasks as well as those of TinyOS platform tasks called by user tasks in order to guarantee the deadlines of the real-time services requested by user tasks. In this paper, we present a group-based real-time scheduling technique that makes it possible to guarantee the deadlines of real-time user tasks in the TinyOS incorporating a non-preemptive task scheduling policy. The proposed technique groups together a given user task and TinyOS platform tasks called and activated by the user task, and then schedule them as a virtual big task. A case study shows that the proposed technique yields efficient performance in terms of guaranteeing the completion of user tasks within their deadlines and aiming to provide them with good average response time, while maintaining the compatibility of the existing non-preemptive TinyOS platform.

An ABR Rate-based Control Scheme Avoiding Access Point Buffer Overflow and Underflow during Handoffs in Wireless ATM Networks (무선 ATM망에서 핸드오프시 접속점 버퍼 오버플로우와 언더플로우를 방지하는 ABR 전송률 기반 제어 방안)

  • Ha, In-Dae;Oh, Jung-Ki;Park, Sang-Joon;Choi, Myung-Whan
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.527-539
    • /
    • 2001
  • The wireless asynchronous transfer mode (ATM) system has the advantage of providing the broadband services with various quality-of-service requirements to the mobile terminal efficiently by utilizing the ATM technology developed for the wired ATM system. The available bit rate (ABR) service among various ATM services utilizes the available bandwidth remaining in the ATM link, which allows the efficient bandwidth usage. During the handoff of the mobile terminal, however, the queue length in the access point (AP) which resides in the boundary of the wired ATM network and the wireless ATM network may increase abruptly. In this paper, we propose a scheme which prevents the buffer-overflow and buffer-underflow in the AP during the handoff of the wireless ABR connection in the wireless ATM system using binary feedback rate-based ABR traffic control. This scheme controls the source's cell generation rate during both handoff period and some time interval after the completion of the handoff procedure. The simulation results show that the proposed scheme prevents the buffer-overflow and buffer-underflow. The proposed scheme can contribute to increasing the throughput of the wireless ABR service during handoff by preventing the buffer overflow and underflow during handoff period.

  • PDF

A Study on the estimation of traffic congestion for Pyeongtaek·Dangjin port development (평택·당진항의 내항개발에 따른 교통혼잡도 평가에 관한 연구)

  • Gug Seung-Gi;Kim Se-Won;Kim Jung-Hoon
    • Journal of Navigation and Port Research
    • /
    • v.29 no.6 s.102
    • /
    • pp.481-485
    • /
    • 2005
  • The port entry system of the inner harbor in Pyeongtaek${\cdot}$Dangjin was planned as lock-gate in 'Master plan project on port planning in Asan industry base(1990)‘, but was changed to tidal harbor in 'Project maintaining Master plan for comprehensive development of Pyeongtaek${\cdot}$Dangjin port(2001)'. Accordingly, southern sea bank constructed under the lower part of Seohae-bridge will be removed so that inbound/outbound vessels for the inner harbor can navigate at all times. However, in the view of the safety on passing through the lower of Seohae-bridge, navigating conditions for the inner harbor will be restricted in the single-way of 50,000 DWT vessel and the two-way of vessel less than 30,000 DWT Therefore, this study carried out the estimation of traffic congestion arising from these vessels with above restrictions q[ter supposing annual inbound/outbound vessel's numbers for loading and unloading cargo surveyed on the inner harbor.

Operation and Analysis of Network for Multivendor PLC Group Management in the Wall Paper Process (발포 벽지 공정에서 이기종 PLC 그룹 관리를 위한 네트워크 운영과 해석)

  • Gang, Seong-Deok;Lee, Dong-Chun;Kim, Jeong-Ho;Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.2
    • /
    • pp.283-294
    • /
    • 1996
  • To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the unit control devices located in common manufacturing zone and operated by connecting them. This paper introduces deign and test operation of cell system for the management of multivendor PLC by applying to wall paper process based on the manufacturing standardization of CIM. The analysis of designed multivendor PLC group is performed by selecting the parameters such as variation of data packet size and node number of PLC ladder logic program and variation by analyzing the corresponding variation values of token rotation time and waiting time for the system operation. For the method of the analysis,the equation is considering the overhead such as indicated packet service time and transmission safety margin for PLC network connection in M/G/1 queue model,and it is applied to the cell system and PLC group manage-ment for operation .Through the experiment,it is found that the realtime processing is possible with expanded and better result than the resuit obtained by Jayasumana.Browaka with PLC scan time considered,response lower limit of 10-20 msec. data packet size not more than 50 bytes.and the number of nodes less than 40.

  • PDF

A Study on Improvement of Run-Time in KS-SIGNAL, Traffic Signal Optimization Model for Coordinated Arterials (간선도로 연동화 신호최적화 모형 KS-SIGNAL의 수행속도 향상을 위한 연구)

  • 박찬호;김영찬
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.4
    • /
    • pp.7-18
    • /
    • 2000
  • KS-SIGNAL, a traffic signal optimization model for coordinated arterials, is an optimization model using the mixed integer linear Programming that minimizes total delay on arterials by optimizing left-turn Phase sequences. However, the Previous version of KS-SIGNAL had a difficulty in reducing computation speed because the related variables and constraints multiply rapidly in accordance with the increase of intersections. This study is designed to propose a new model, improving optimizing computation speed in KS-SIGMAl, and evaluate it. This Paper Puts forth three kinds of methodological approaches as to achieve the above goals. At the first step to reduce run-time in the proposed model objective function and a few constraints are Partially modified, which replaces variable in related to queue clearance time with constant, by using thru-movements at upstream intersection and the length of red time at downstream intersection. The result shows that the run-time can be reduced up to 70% at this step. The second step to load the library in LINDO for Windows, in order to solve mixed integer linear programming. The result suggests that run-time can be reduced obviously up to 99% of the first step result. The third step is to add constraints in related to left-turn Phase sequences. The proposed methodological approach, not optimizing all kinds of left-turn sequences, is more reasonable than that of previous model , only in the view of reducing run-tim. In conclusion, run-time could be reduced up to 30% compared with the second results. This Proposed model was tested by several optimization scenarios. The results in this study reveals that signal timing plan in KS-SIGNAL is closer to PASSER-II (bandwidth maximizing model) rather than to TRANSYT-7F(delay minimizing model).

  • PDF

A Study on Providing Real-Time Route Guidance Information by Variable Massage Signs with Driver Behavior (운전자 행태를 고려한 VMS의 실시간 경로안내 정보제공에 관한 연구)

  • Lee, Chang-U;Jeong, Jin-Hyeok
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.7 s.93
    • /
    • pp.65-79
    • /
    • 2006
  • The ATIS(Advance Traveler Information System), as one part of ITS, is a system aiming to disperse traffic volume on transportation networks by providing traffic information to transportation users on pre-trip and en-route trips. One of tools in ATIS is usage of VMS(Variable Message Signs). It provides to the drivers with direct information about state of processing direction. which is considered as the most effective method in ATIS. The purposes of providing VMS information are classified two categories. One is to provide simple information to drivers for their convenience. The other is to manage traffic demand to improve transportation network performance. However, for more effective and reliable VMS information, several strategies should be taken into account. The main VMS management strategy is "Traffic Diversion Strategy for minimum delay" when traffic congestion or incident are occurred. For effective operation. firstly. reasonable diversion traffic volume is determined by network traffic condition Secondly, it is necessary to make providing information strategy which reflects driver response behavior for controling diversion traffic volume. This paper focuses on the providing real-time route guidance information by VMS when congestion is occurred by the incidents. This sturdy estimates time-dependent system optimal diversion rate that inflects travel time and queue lengths using traffic flow simulation model on base Cellular Automata. In addition, route choice behavior models are developed using binary logit model for traffic information variable by traffic system controller. Finally, this study provides time-dependent VMS massage contents and degree of providing information in order to optimize the traffic flow.

A Study on the estimation of traffic congestion for Pyeongtaek (Asan) port development (평택(아산)항 개발에 따른 교통혼잡도 평가에 관한 연구)

  • Kuk, Seung-Gi;Kim, Se-Won;Kim, Jeong-Hoon
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.29 no.1
    • /
    • pp.191-195
    • /
    • 2005
  • The port entry system of the inner harbor in Pyeongtaek (Asan) was planned as lock-gate in 'Master plan project on port planning in Asan industry base(1990)', but was changed to tidal harbor in 'Project maintaining Master Plan for comprehensive development of Pyeongtaek (Asan) port(2001)'. Accordingly, southern sea bank constructed under the lower part of Seohae-bridge will be removed so that inbound/outbound vessels for the inner harbor can navigate at all times. However, in the view of the safety on passing through the lower of Seohae-bridge, navigating conditions for the inner harbor will be restricted in the single-way of 50,000 DWT vessel and the two-day of vessel less than 30,000 DWT. Therefore, this study carried out the estimation of traffic congestion arising from these vessels with above restrictions after supposing annual inbound/outboubd vessel's numbers for loading and unloading cargo surveyed on the inner harbor.

  • PDF

A study on the productivity effects of transport vehicle by pooling system at container terminals (이송장비의 Pooling 운행방식에 따른 터미널하역생산성 효과)

  • Ha, Tae-Young;Shin, Jae-Yeong;Choi, Yong-Seok
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.29 no.1
    • /
    • pp.377-382
    • /
    • 2005
  • This paper deals with productivity improvement of stevedoring system by pooling opertaions of transport vehicle at automated container terminal. Usually, in traditional container terminals, grouping operations of transport vehicle are applied for container crane because vehicle routing path is simple and vehicle assignment is easy. But this static assignment(SA) operation that arrsign vehicles to container crane ar apron reduces flexibility of vehicles. Therefore, This paper presented 4 dynamic assignment(DA) method to improve efficiency of vehicles. These 4 dynamic assignment method consider present situations of container crane such as sequence(Se), queue time(Qt), productivity(Pr), numeric of vehicle assignment(Nv), numeric of buffer(Nb) at vehicles assignment. At the results, dynamic assignment operation to consider Qt, Nv, Nb is most efficient and by next time, dynamic assignment operation to consider Se is superior more than static assignment operation. but, dynamic assignment operation to consider Pr or Qt of container crane only is inefficient than static assignment operation.

  • PDF

A Fusion Priority Signal Control Algorithm for Emergency Vehicles (긴급차량 융합형 우선신호 제어 알고리즘 개발)

  • Lee, Soong-bong;Lee, Jin-soo;Jang, Jae-min;Lee, Young-Ihn
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.2
    • /
    • pp.113-127
    • /
    • 2018
  • This study develops a fusion priority signal control algorithm to pass without delay in emergency events. Fusion priority signal control is method combined center control with local control. The center control method applies signal times for each signalized intersection on the emergency vehicle's route when an emergency call is received. As signals are controlled before the emergency vehicle leaves for its destination, it is possible to clear the queues at each intersection more effectively. However, since the traffic information (speed, position) of the real-time emergency vehicle is not used, the intersection arrival time predicted by center control and actual arrival time of the emergency vehicle may be different from each other. In the case, it is possible to experience a delay caused by the signal. Local control method operate priority signal use the real-time information of EV, but there is a limitation that queue elimination time can not be reflected. In this study, fusion(center+local) control algorithm is proposed to compensate the disadvantages of center and local control also maximizing its advantages. Proposed algorithm is expected to decrease delay time of EV in emergency situation.

Performance Evaluation of Output Queueing ATM Switch with Finite Buffer Using Stochastic Activity Networks (SAN을 이용한 제한된 버퍼 크기를 갖는 출력큐잉 ATM 스위치 성능평가)

  • Jang, Kyung-Soo;Shin, Ho-Jin;Shin, Dong-Ryeol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2484-2496
    • /
    • 2000
  • High speed switches have been developing to interconnect a large number of nodes. It is important to analyze the switch performance under various conditions to satisfy the requirements. Queueing analysis, in general, has the intrinsic problem of large state space dimension and complex computation. In fact, The petri net is a graphical and mathematical model. It is suitable for various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a framework for modeling and analyzing ATM switch using stochastic activity networks (SANs). In this paper, we provide the ATM switch model using SANs to extend easily and an approximate analysis method to apply A TM switch models, which significantly reduce the complexity of the model solution. Cell arrival process in output-buffered Queueing A TM switch with finite buffer is modeled as Markov Modulated Poisson Process (MMPP), which is able to accurately represent real traffic and capture the characteristics of bursty traffic. We analyze the performance of the switch in terms of cell-loss ratio (CLR), mean Queue length and mean delay time. We show that the SAN model is very useful in A TM switch model in that the gates have the capability of implementing of scheduling algorithm.

  • PDF