• Title/Summary/Keyword: Preemptive Priority

Search Result 64, Processing Time 0.033 seconds

Dimensioning Links for NGN VoIP Networks

  • Kim, Yoon-Kee;Lee, Hoon;Lee, Kwang-Hui
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8B
    • /
    • pp.683-690
    • /
    • 2003
  • In this paper we present a theoretical framework for the network design with delay QoS guarantee to a voice at the packet level. Especially, we propose a method for estimating the bandwidth at the ingress edge routers accommodating the voice connections and data sessions in the next-generation If network. First, we describe network architecture for VoIP (Voice over IP) services in the NGN (Next Generation Network). After that, we propose a procedure for dimensioning the bandwidth at the output port of a router that accommodates voice and data traffic using the non-preemptive queuing system with strict priority service scheme. Via numerical experiments we illustrate the implication of the proposition.

A Study on Priority Determination of Seismic Reinforcement of Apartment Houses Considering Earthquake Risk Factors (지진의 위험요인을 고려한 공동주택의 내진보강 우선순위 결정에 관한 연구)

  • Han, Bum-Jin
    • Journal of the Korea Institute of Building Construction
    • /
    • v.23 no.4
    • /
    • pp.405-416
    • /
    • 2023
  • Recent seismic activities in countries like China and Turkey have underscored the widespread and severe damages that earthquakes can inflict globally. Being situated in a seismically active zone, South Korea can no longer regard itself as immune to earthquake hazards, necessitating the urgent adoption of proactive measures against such threats. The government has been proactive in evaluating, formulating processes, and methods for the seismic retrofitting of public buildings lacking in earthquake resistance. However, enforcement mechanisms for privately-owned apartment complexes are absent, and in the face of insufficient previous research and guidelines, preemptive measures for public safety remain alarmingly inadequate. With over 48% of residential structures in Korea aged over 30 years, and apartment complexes constituting more than 80% of these, the gravity of the situation is undeniable. This study deduces key factors for seismic retrofitting of apartment buildings like earthquake zones, soil type, building significance, aging degree, vulnerability, etc., based on building seismic design codes. It further proposes an algorithm for a more succinct and efficient determination of the priority of seismic reinforcements for apartment buildings.

Design and Implementation of Real-Time Operating System for a GPS Navigation Computer (GPS 항법 컴퓨터를 위한 실시간 운영체제의 설계 및 구현)

  • Bae, Jang-Sik;Song, Dae-Gi;Lee, Cheol-Hun;Song, Ho-Jun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.429-438
    • /
    • 2001
  • GPS (Global Positioning System) is the most ideal navigation system which can be used on the earth irrespective of time and weather conditions. GPS has been used for various applications such as construction, survey, environment, communication, intelligent vehicles and airplanes and the needs of GPS are increasing in these days. This paper deals with the design and implementation of the RTOS (Real-Time Operating System) for a GPS navigation computer in the GPS/INS integrated navigation system. The RTOS provides the optimal environment for execution and the base platform to develop GPS application programs. The key facilities supplied by the RTOS developed in this paper are priority-based preemptive scheduling policy, dynamic memory management, intelligent interrupt handling, timers and IPC, etc. We also verify the correct operations of all application tasks of the GPS navigation computer on the RTOS and evaluate the performance by measuring the overhead of using the RTOS services.

  • PDF

Scheduling Algorithms and Queueing Response Time Analysis of the UNIX Operating System (UNIX 운영체제에서의 스케줄링 법칙과 큐잉응답 시간 분석)

  • Im, Jong-Seol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.3
    • /
    • pp.367-379
    • /
    • 1994
  • This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.

  • PDF

Study on Emerging Technologies in Electric Power Industry (전력산업 미래 유망기술 발굴 방법론 연구)

  • Park, Sooman
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.2 no.2
    • /
    • pp.317-325
    • /
    • 2016
  • In recent years, the U.S, Japan, Europe and other developed countries are strategically developing technologies in order to prepare for paradigm shift affecting the electric power industry in a preemptive way. In particular, a chance for new business models and innovation in the electric power industry would rapidly increase with convergence of various technologies including Information and communication technologies. This study gathered up the theories and methodologies, and sorted out emerging technologies for the electric power industry with those theories. In order to find the emerging technologies, first, we identified the possible key issues of the electric power industry in the future using four mining techniques such as STEEP. Second, we drew agenda related with each key issue. Third, we organized candidates of the emerging technologies for solving the agenda and set the priority after evaluating the possibility of technical innovation and business. Finally, we selected the top fourteen of emerging technologies and assessed their feasibility. This study has a methodological significance because the emerging technologies were developed with a market-oriented approach rather than technical-push one that has been primarily used in another studies. The results of this study are able to be used in establishment of technology policy and R&D planning in the electric power industry.

Implementation of Operating Software for Small Multi-Jointed Robots (소형 다관절로봇을 위한 운용 소프트웨어 구현)

  • Son, Hyun-Seung;Kim, Woo-Yeol;Kim, Young-Chul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.9
    • /
    • pp.946-951
    • /
    • 2009
  • The small multi-jointed robots for most education are developed with the way of firmware. But the firmware may be very difficult to develop as gradually increasing throughputs and control routines. Due to limit of firmware we try to use on RTOS, but hard to adapt on the small multi-jointed robots. It would be hard to install RTOS into the small multi-jointed robots because of the size capacity of RTOS, and lack of libraries for control of the particular hardware. Moreover, even its RTOS with many functions causes its to make overheads scheduling, TCB (Task Control Block), and task states. Also to keep maintenance of RTOS, it is composed of components for the whole structure of my proposed RTOS. Additionally, We provided with libraries of servo motor and sensor control and developed RMS (Rate Montonic scheduler) to handle tasks on real time and reduce overheads. Therefore, It is possible to work the fixed priority and task preemptive way. We show one example of the multi-jointed robot installed with my proposed RTOS, which shows to obstacle avoidance and climbing up the slope.

Dimensioning Next Generation Networks for QoS Guaranteed Voice Services (NGN에서의 품질보장형 음성서비스 제공을 위한 대역 설계 방법)

  • Kim, Yoon-Kee;Lee, Hoon;Lee, Kwang-Hui
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.9-17
    • /
    • 2003
  • In this paper we proposea method for estimating the bandwidth in next-generation If network. Especially, we concentrate on the edge routers accommodating the VoIP connections as well as a group of data connections. Bandwidth dimensioning is carried out at call level and packet level for voice traffic in the next-generation IP network. The model incorporates the statistical estimation approach at a call level for obtaining the number of voice connections simultaneously in the active mode. The call level model incorporates a statistical technique to compute the statistics of the number of active connections such as the mean and variance of the simultaneously connected calls in the network. The packet level model represents a load map for voice and data traffic by using non-preemptive M/G/1 queuing model with strict priority for voice over data buffer, From the proposed traffic model, we can derive a graph for upper bounds on the traffic load in terms of bandwidth for voice and data connections. Via numerical experiments we illustrate the implication of the work.

Design and Load Map of the Next Generation Convergence Security Framework for Advanced Persistent Threat Attacks

  • Lee, Moongoo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.2
    • /
    • pp.65-73
    • /
    • 2014
  • An overall responding security-centered framework is necessary required for infringement accidents, failures, and cyber threats. On the other hand, the correspondence structures of existing administrative, technical, physical security have weakness in a system responding to complex attacks because each step is performed independently. This study will recognize all internal and external users as a potentially threatening element. To perform connectivity analysis regarding an action, an intelligent convergence security framework and road map is suggested. A suggested convergence security framework was constructed to be independent of an automatic framework, such as the conventional single solution for the priority defense system of APT of the latest attack type, which makes continuous reputational attacks to achieve its goals. This study suggested the next generation convergence security framework to have preemptive responses, possibly against an APT attack, consisting of the following five hierarchical layers: domain security, domain connection, action visibility, action control, and convergence correspondence. In the domain, the connection layer suggests a security instruction and direction in the domains of administrative, physical and technical security. The domain security layer has consistency of status information among the security domain. A visibility layer of an intelligent attack action consists of data gathering, comparison and decision cycle. The action control layer is a layer that controls the visibility action. Finally, the convergence corresponding layer suggests a corresponding system of before and after an APT attack. The administrative security domain had a security design based on organization, rule, process, and paper information. The physical security domain is designed to separate into a control layer and facility according to the threats of the control impossible and control possible. Each domain action executes visible and control steps, and is designed to have flexibility regarding security environmental changes. In this study, the framework to address an APT attack and load map will be used as an infrastructure corresponding to the next generation security.

Low Power Real-Time Scheduling for Tasks with Nonpreemptive Sections (비선점 구간을 갖는 태스크들을 위한 저전력 실시간 스케줄링)

  • Kim, Nam-Jin;Kim, In-Guk
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.1
    • /
    • pp.103-113
    • /
    • 2010
  • The basic real-time scheduling algorithms based on RM or EDF approaches assume that the tasks are preemptive, but the tasks may contain nonpreemptive sections in many cases. Also the existing scheduling algorithm for reducing the power consumption of the processor is based on the task utilizations and determines the processor speed $S_H$ or $S_L$ according to the existence of the blocking intervals. In this algorithm, the $S_H$ interval that operates in high speed is the interval during which the priority inversion by blocking occurs, and the length of this interval is set to the task deadline that includes the blocking intervals. In this paper, we propose an improved algorithm that can reduce the power consumption ratio by shortening the length of the $S_H$ interval. The simulation shows that the power consumption ratio of the proposed algorithm is reduced as much as 13% compared to the existing one.

Delay Fairness of MAC Schemes for Best Effort Service in Wireless MAN (Wireless MAN에서 Best Effort 서비스를 위한 MAC 방식의 지연 공평성)

  • Park, Jin-Kyung;Shin, Woo-Cheol;Ha, Jun;Choi, Cheon-Won
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.168-171
    • /
    • 2003
  • IEEE 802.16 Wireless MAN standard specifies the air interface of fixed point-to-multipoint broadband wireless access systems providing multiple services. Among the service classes supported by the wireless MAN, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHL Such MAC scheme must include a number of components, while many of them are not specified in the standard. In this paper, we thus reveal main components of a MAC scheme supporting the best effort service and present candidate schemes implementing such components. Combining schemes for implementing components, we then construct distinctive MAC schemes supporting best effort service. In designing a MAC scheme, the delay performance induced by the scheme should be considered since scarce resource may be available for the best effort service after the preemptive resource occupation by other service classes. In this paper, we focus on the delay fairness among the subscriber stations using the best effort service. For evaluating a MAC scheme in delay fairness, we present two definitions of delay fairness and provide a criterion for optimal MAC scheme according to each definition of delay fairness. Using a simulation method we investigate the mean delay performance exhibited by each MAC scheme arid find an optimal scheme in delay fairness. From numerical examples, we observe that SR/ED/PG+P scheme has strong delay fairness compared with MR/ED/PG+P and SR/ED/PG+D schemes according to a definition of delay fairness. However, other schemes are rather shown to have better delay fairness when the other definition is adopted.

  • PDF