• Title/Summary/Keyword: Multi-level Scheduling

Search Result 74, Processing Time 0.034 seconds

Real-time Processing Method for Windows OS Using MSR_FSB_FREQ Control (MSR_FSB_FREQ 제어를 이용한 윈도우 운영체제에 실시간 처리 방법)

  • Kim, Jong Jin;Lee, Sang Gil;Lee, Cheol Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.1
    • /
    • pp.95-105
    • /
    • 2021
  • In the case of laptops and tablet PC's that replace desktop, it uses the Windows operating system to provide various functions depending on operating system dependency, the Windows operating system does not support real-time processing because it uses multi-level feedback queue scheduling that extends round-robin scheduling. Also, since the initial value of Local APIC Counter can not be obtained from the Windows 8, the real-time processing function provided through the existing RTiK does not work. In this paper, we calculate Local APIC Counter value by using MSR_FSB_FREQ register to support real-time processing function on tablet PC's. We designed and implemented RTiK+, which provides real-time processing function to guarantee the periodicity by calculating the operation time of accurate timer. In order to verify and evaluate the performance of the implemented the RTiK+, the period was measured by using the Read Time-Stamp Counter(RDTSC) instruction and it was confirmed that it operates normally at 1ms and 0.1ms period.

Hierarchical-based Dynamic Bandwidth Allocation Algorithm for Multi-class Services in Ethernet PON (이더넷 PON에서 다중 클래스 서비스를 위한 계층적 구조 기반의 동적 대역 할당 알고리듬)

  • 한경은;안계현;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3A
    • /
    • pp.223-232
    • /
    • 2004
  • In this paper we propose the hierarchical-based dynamic bandwidth allocation algorithm for multi-class services in Ethernet-PON. The proposed algorithm consists of the high level scheduler in OLT and the low level scheduler in ONU. The hierarchical architecture is able to provide scalability and resource efficiency in Ethernet-PON which has the distributed nature of the scheduling domain, with queues and the scheduler located at a large distance from each other. We also propose three dynamic bandwidth allocation algorithms for the low level scheduler: Proportional Allocation algorithm, Maximum Request First Allocation (MRFA) algorithm and High Priority First Allocation (HPFA) algorithm. We implement the Ethernet-PON standardized in the IEEE 802,3ah using OPNET. We also evaluate and analyze the performance for the proposed algorithms in terms of channel utilization, queuing delay and the amount of remainder.

On Scheduling Real-Time Traffic under Controlled Load Service in an Integrated Services Internet

  • Shi, Hongyuan;Sethu, Harish
    • Journal of Communications and Networks
    • /
    • v.5 no.1
    • /
    • pp.73-81
    • /
    • 2003
  • The controlled load service defined within the IETF's Integrated Services architecture for quality-of-service (QoS) in the Internet requires source nodes to regulate their traffic while the network, in combination with an admission control strategy, provides a guarantee of performance equivalent to that achieved in a lightly loaded network. Packets sent in violation of the traffic contract are marked so that the network may assign them a lower priority in the use of bandwidth and buffer resources. In this paper, we define the requirements of a scheduler serving packets belonging to the controlled load service and present a novel scheduler that exactly achieves these requirements. In this set of requirements, besides efficiency and throughput, we include an additional important requirement to bound the additional delay of unmarked packets caused due to the transmission of marked packets while dropping as few marked packets as possible. Without such a bound, unmarked packets that are in compliance with the traffic contract are not likely to experience delays consistent with that in al lightly loaded network. For any given desired bound ${\alpha}$ on this additional delay, we present the CL(${\alpha}$) scheduler which achieves the bound while also achieving a per-packet work complexity of O(1) with respect to the number of flows. We provide an analytical proof of these properties of the CL(${\alpha}$) scheduler, and we also verify this with simulation using real traces of video traffic. The scheduler presented here may be readily adapted for use in scheduling flows with multi-level priorities such as in some real-time video streams, as well as in other emerging service models of the Internet that mark packets to identify drop precedences.

On Addressing Network Synchronization in Object Tracking with Multi-modal Sensors

  • Jung, Sang-Kil;Lee, Jin-Seok;Hong, Sang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.4
    • /
    • pp.344-365
    • /
    • 2009
  • The performance of a tracking system is greatly increased if multiple types of sensors are combined to achieve the objective of the tracking instead of relying on single type of sensor. To conduct the multi-modal tracking, we have previously developed a multi-modal sensor-based tracking model where acoustic sensors mainly track the objects and visual sensors compensate the tracking errors [1]. In this paper, we find a network synchronization problem appearing in the developed tracking system. The problem is caused by the different location and traffic characteristics of multi-modal sensors and non-synchronized arrival of the captured sensor data at a processing server. To effectively deliver the sensor data, we propose a time-based packet aggregation algorithm where the acoustic sensor data are aggregated based on the sampling time and sent to the server. The delivered acoustic sensor data is then compensated by visual images to correct the tracking errors and such a compensation process improves the tracking accuracy in ideal case. However, in real situations, the tracking improvement from visual compensation can be severely degraded due to the aforementioned network synchronization problem, the impact of which is analyzed by simulations in this paper. To resolve the network synchronization problem, we differentiate the service level of sensor traffic based on Weight Round Robin (WRR) scheduling at the routers. The weighting factor allocated to each queue is calculated by a proposed Delay-based Weight Allocation (DWA) algorithm. From the simulations, we show the traffic differentiation model can mitigate the non-synchronization of sensor data. Finally, we analyze expected traffic behaviors of the tracking system in terms of acoustic sampling interval and visual image size.

Performance Evaluation of Interference Alignment Technique in Wireless LAN Environment (무선랜 환경에서 간섭정렬 기술의 성능 평가)

  • Yoon, Seokhyun;Shin, Won-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1639-1644
    • /
    • 2016
  • In this paper, we consider the performance improvement that can be obtained with interference alignment (IA) technique applied to 802.11ac based multi-BSS WiFi service. To this end, we developed a system simulator consisting of a link-level PHY simulator, based on 802.11ac specification, and multi-BSS proportional-fair scheduler. Specifically, assuming perfect channel side information and synchronization of signals from multiple APs, we used a SLNR based interference alignment algorithm proposed in [13] and compared its performance with that of multiuser beamforming based time-sharing system. The performance was evaluated in terms of average throughput per BSS and 5% worst user throughput. The results show that 70 to 100% throughput gain can be obtained in this ideal scenario.

A Simple Cooperative Transmission Protocol for Energy-Efficient Broadcasting Over Multi-Hop Wireless Networks

  • Kailas, Aravind;Thanayankizil, Lakshmi;Ingram, Mary Ann
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.213-220
    • /
    • 2008
  • This paper analyzes a broadcasting technique for wireless multi-hop sensor networks that uses a form of cooperative diversity called opportunistic large arrays (OLAs). We propose a method for autonomous scheduling of the nodes, which limits the nodes that relay and saves as much as 32% of the transmit energy compared to other broadcast approaches, without requiring global positioning system (GPS), individual node addressing, or inter-node interaction. This energy-saving is a result of cross-layer interaction, in the sense that the medium access control (MAC) and routing functions are partially executed in the physical (PHY) layer. Our proposed method is called OLA with a transmission threshold (OLA-T), where a node compares its received power to a threshold to decide if it should forward. We also investigate OLA with variable threshold (OLA-VT), which optimizes the thresholds as a function of level. OLA-T and OLA-VT are compared with OLA broadcasting without a transmission threshold, each in their minimum energy configuration, using an analytical method under the orthogonal and continuum assumptions. The trade-off between the number of OLA levels (or hops) required to achieve successful network broadcast and transmission energy saved is investigated. The results based on the analytical assumptions are confirmed with Monte Carlo simulations.

Mathematical Modeling of Energy Management and Packet Scheduling to Guarantee QoS of Multi-level Priority Packets in Energy Harversting Sensors Networks (에너지 수급 센서망에서 다중 우선순위 패킷의 QoS를 보장하는 에너지 관리 및 패킷 스케쥴링 기법의 수학적 모델링)

  • Kim, Sung-Ryul;Yoo, Young-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.216-218
    • /
    • 2012
  • 최근 센서 네트워크의 제약적 전력 공급 문제를 해결하기 위한 하나의 방법으로 에너지 수급 센서 기술이 연구되고 있다. 에너지 수급 센서의 수급 효율은 가변적인 환경에 의존하기 때문에 수급률을 고려한 저전력 통신 기법이 요구된다. 또한 다중 우선순위 데이터가 존재하는 네트워크에선 에너지 수급률과 배터리 잔량을 고려한 차별적인 데이터 처리가 필요하다. 이에 본 논문에서는 각 계층들이 에너지 소모에 미치는 영향을 고려하며 동시에 높은 우선순위 데이터의 빠른 처리를 가능하게 하는 패킷 스케쥴링 기법 및 에너지 관리 방법을 제안하고 이를 수학적 모델링을 통해 분석할 것이다.

A Study on Loading in Flexible Manufacturing System (유연생산시스템에서 작업할당에 관한 연구)

  • 임재우;노인규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.50
    • /
    • pp.127-137
    • /
    • 1999
  • This study is concerned with the loading problems in flexible manufacturing system(FMS). The loading problem in FMS is a complex one, when the number of machine and job is increased. It may be time-consuming and even impossible to achieve an optimal solution about this problem mathematically. Thus, a heuristic method is recommended in order to gain near-optimal solutions in a practically acceptable time. A new loading algorithm is developed with a multi-criterion objective of considering the workload unbalance, and maximizing the machine utilization, throughput for critical resources such as the number of tool slots and the number of working hours in a scheduling period and so on. The results of SAS analysis indicated that true average throughput of proposed heuristic loading statistically exceeds that of Shanker and Srinivasulus loading algorithm at the significance level of 0.1.

  • PDF

Prioritizing Technology Elements in New Product Development Using QFD and Taguchi Method (신제품 개발 프로젝트에서의 요소기술 중요도 결정 방안 : QFD와 다구치 방법의 적용)

  • Yang, Jong-Seo;Yun, Myung-Hwan;Yoon, Il-Bae;Park, Yong-Tae
    • Journal of Technology Innovation
    • /
    • v.12 no.3
    • /
    • pp.111-134
    • /
    • 2004
  • Current technology innovation or new product development project is composed of various process elements that conduct researches on fundamental technologies. However, with the effects of PERT and CPM, the greater part of the existing project management researches have only focused on the resource allocation and scheduling. But in the multi-project environment, priorities between technology elements need to be considered. Furthermore, a disagreement of opinion between project managers and researchers should be considered. In this study, technology element priority was determined using modified QFD and Taguchi method. Outcome of each method was compared to analyze the difference between project managers and researchers. As a result, QFD method showed relatively high level of consistency between project managers and researchers.

  • PDF

Parallel LDPC Decoder for CMMB on CPU and GPU Using OpenCL (OpenCL을 활용한 CPU와 GPU 에서의 CMMB LDPC 복호기 병렬화)

  • Park, Joo-Yul;Hong, Jung-Hyun;Chung, Ki-Seok
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.6
    • /
    • pp.325-334
    • /
    • 2016
  • Recently, Open Computing Language (OpenCL) has been proposed to provide a framework that supports heterogeneous computing platforms. By using an OpenCL framework, digital communication systems can support various protocols in a unified computing environment to achieve both high portability and high performance. This article introduces a parallel software decoder of Low Density Parity Check (LDPC) codes for China Multimedia Mobile Broadcasting (CMMB) on a heterogeneous platform. Each step of LDPC decoding has different parallelization characteristics. In this paper, steps suitable for task-level parallelization are executed on the CPU, and steps suitable for data-level parallelization are processed by the GPU. To improve the performance of the proposed OpenCL kernels for LDPC decoding operations, explicit thread scheduling, loop-unrolling, and effective data transfer techniques are applied. The proposed LDPC decoder achieves high performance by using heterogeneous multi-core processors on a unified computing framework.