• Title/Summary/Keyword: Preemptive

Search Result 414, Processing Time 0.03 seconds

Exploiting cognitive wireless nodes for priority-based data communication in terrestrial sensor networks

  • Bayrakdar, Muhammed Enes
    • ETRI Journal
    • /
    • v.42 no.1
    • /
    • pp.36-45
    • /
    • 2020
  • A priority-based data communication approach, developed by employing cognitive radio capacity for sensor nodes in a wireless terrestrial sensor network (TSN), has been proposed. Data sensed by a sensor node-an unlicensed user-were prioritized, taking sensed data importance into account. For data of equal priority, a first come first serve algorithm was used. Non-preemptive priority scheduling was adopted, in order not to interrupt any ongoing transmissions. Licensed users used a nonpersistent, slotted, carrier sense multiple access (CSMA) technique, while unlicensed sensor nodes used a nonpersistent CSMA technique for lossless data transmission, in an energy-restricted, TSN environment. Depending on the analytical model, the proposed wireless TSN environment was simulated using Riverbed software, and to analyze sensor network performance, delay, energy, and throughput parameters were examined. Evaluating the proposed approach showed that the average delay for sensed, high priority data was significantly reduced, indicating that maximum throughput had been achieved using wireless sensor nodes with cognitive radio capacity.

An Design Of Embedded System for Satisfying Respose Of Wireless Internet Datalink Layer (무선 인터넷 데이터링크 레이어의 응답속도를 만족하는 임베디드 시스템 설계)

  • Oh, Hyun-Seok;Sung, Kwang-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.1181-1184
    • /
    • 2005
  • In this paper, we proposed small scale real-time operating system for embedded system. Real-time system is characterized by the severe consequences that result if logical as well as timing correctness properties of system are not met. On real-time system, real-time operating system allows real-time applications to be designed and expanded easily. Functions can be added without requiring major changes to the software. We design small scale real-time operating system for preemptive kernel, and design kernel component such as multitasking, scheduler, task priority, semaphore, inter-task communication, clock tick timer, ISR(Interrupt Service Routine) mechanism has low interrupt latency.

  • PDF

An analysis of M/M/2 system with restriction to the number of servers for each customer class (각 고객 class 별 서버의 수에 제한이 있는 M/M/2 대기행렬모형 분석)

  • Jung Jae Ho;Hur Sun
    • Proceedings of the Society of Korea Industrial and System Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.133-138
    • /
    • 2002
  • In this paper, we model a two-server queueing system with priority, to which we put a restriction of the number of servers for each customer class. A group of customers is divided into two different classes. The class 1 customers has non -preemptive priority over class 2 customers. We use the method of PGF depending on the state of server We find the PGF of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.

  • PDF

M/M/2 system with two customer classes and exclusive server (전용서버가 있는 이계층고객 M/M/2 대기모형)

  • Jung, Jae-Ho;Hur, Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.25 no.5
    • /
    • pp.31-38
    • /
    • 2002
  • In this paper, we model a two-server queueing system with priority, to which we put a restriction on the number of servers for each customer class. customers are divided into two different classes. Class 1 customers have non-preemptive priority over class 2 customers. They are served by both servers when available but class 2 customers are served only by a designated server. We use a method of generating function depending on the state of servers. We find the generating function of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.

Future Plan of Environmental Policy in Korea

  • Kim, Yoon-Shin
    • Proceedings of the Korean Environmental Health Society Conference
    • /
    • 2005.12a
    • /
    • pp.45-48
    • /
    • 2005
  • In 2005, the KMOE and an advisory members for environmental health policy are exploring new environmental policy directions in the 21st century by suggesting a 10-year plan of environmental health policy with its specific goals, grounded on four basic principles: preemptive environmental control instead of post hoc facto control of environmental contaminants or discharged substances, receptor-centered approach, priority on protection of the people vulnerable and sensitive to environmental contamination, and warranty of citizens' rights to be engaged and informed. Such new policy challenges in the area of environmental health, which must be significant of important policy shift for environmental health in the 21t century, is expected to conduct to improvement of environmental health in Korea and Northeast Asian Regions as well.

  • PDF

Design and Implementation of a Bird Type Biped Robot for Entertainment (엔터테인먼트용 조류형 2족 보행 로봇의 설계 및 구현)

  • Kim Dong-Jin;Yu Seung-Hwan;Shen Yun-De;Jang Seung-Ik;Kee Chang-Doo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.22 no.3 s.168
    • /
    • pp.38-45
    • /
    • 2005
  • In this paper, a bird type biped robot for entertainment controlled by R/C servo motors, is built using the embedded RTOS (Real Time Operating System). ${\mu}C/OS-II$ V2.00 is used fur RTOS and the board 80C196KC for main CPU. A control algorithm of R/C servo motors is proposed on ${\mu}C/OS-II's$ preemptive and deterministic property without any extra PWM module. The realized biped robot has 19DOF, that is, 12DOF for both legs, 6DOF for both arms and 1DOF for neck. To verify the proper walking process, ZMP(Zero Moment Point) theory is applied and the simulation has been done by ADAMS.

The Partner Selection using Preemptive Goal Programming in the Web Services Environment (선점 목표계획법을 이용한 웹 서비스 파트너선택)

  • Jo, Dae-Rae;Ha, Byeong-Hyeon;Kim, Hun-Tae;Gang, Seok-Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.277-280
    • /
    • 2004
  • 많은 기업들은 기업 내${\cdot}$외의 기술 및 서비스의 효율적인 통합 환경을 구축하기 위해 웹 서비스를 도입하고 있다. 구조화된 웹 서비스는 고객의 입장에서 그들의 요구를 만족시킬 수 있어야 하고, 공급자 입장에서는 경제성을 가지고 실행되어야 한다. 이 연구의 목적은 고객의 입장에서 여러 서비스 기준들을 만족시킬 수 있는 적합한 웹 서비스를 구성하는 방안을 탐구하는데 있다. 본 논문에서는 고객의 서비스에 대한 선호도를 고려하기위해 선점 목표계획법을 이용하여 웹 서비스를 구성한다. 이러한 접근법은 고객이 다중 우선순위를 가지고 있는 상황의 문제 해결 방안을 제시한다.

  • PDF

A Non-preemptive Priority 2-Class MAP/G/1 Queue with Individual Thresholds (다중 임계점을 고려한 비축출형 우선순위 2-계층 MAP/G/1 대기행렬모형)

  • Seo, Won-Ju;Lee, Ho-U
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.866-872
    • /
    • 2005
  • 본 연구는 비축출형 우선순위 2-계층 대기행렬을 다룬다. 각 계층별 고객들은 마코비안 도착과정(Markovian arrival process, MAP)에 의하여 시스템에 도착하고, 각 계층마다 고유의 임계점을 갖는다. 시스템 내에 고객들이 존재하지 않으면 서어버는 유휴해지고 어느 계층이든지 상관없이 계층에 부여된 임계점에 먼저 도달하면 서어버는 서비스를 시작한다. 우선순위가 높은 고객들을 먼저 서비스하는 비축출형 우선순위 서비스규칙을 따른다. 본 연구에서는 각 계층별 고객들의 대기시간분포에 대한 라플라스(Laplace-Stieltjes) 변환과 평균 대기시간을 유도한다.

  • PDF

Agent-based Mobile Robotic Cell Using Object Oriented & Queuing Petri Net Methods in Distribution Manufacturing System

  • Yoo, Wang-Jin;Cho, Sung-Bin
    • Journal of Korean Society for Quality Management
    • /
    • v.31 no.3
    • /
    • pp.114-125
    • /
    • 2003
  • In this paper, we deal with the problem of modeling of agent-based robot manufacturing cell. Its role is becoming increasingly important in automated manufacturing systems. For Object Oriented & Queueing Petri Nets (OO&QPNs), an extended formalism for the combined quantitative and qualitative analysis of different systems is used for structure and performance analysis of mobile robotic cell. In the case study, the OO&QPN model of a mobile robotic cell is represented and analyzed, considering multi-class parts, non-preemptive priority and alternative routing. Finally, the comparison of performance values between Shortest Process Time (SPT) rule and First Come First Serve (FCFS) rule is suggested. In general, SPT rule is most suitable for parts that have shorter processing time than others.

A Genetic Algorithm for Single Machine Scheduling with Unequal Release Dates and Due Dates (상이한 납기와 도착시간을 갖는 단일기계 일정계획을 위한 유전 알고리즘 설계)

  • 이동현;이경근;김재균;박창권;장길상
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.3
    • /
    • pp.73-82
    • /
    • 1999
  • In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

  • PDF