• Title/Summary/Keyword: real-time scheduling algorithm

Search Result 362, Processing Time 0.025 seconds

A Study on Adaptive Queue Management Algorithm Considering Characteristics of Multimedia Data (멀티미디어 데이터 특성을 고려한 동적 큐 관리 알고리즘 연구)

  • Kim, Ji-Won;Yun, Jeong-Hee;Jang, Eun-Mee;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.6
    • /
    • pp.140-148
    • /
    • 2011
  • Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic. To deal with these problems, a study on algorithm that can provide high quality multimedia service by considering both network congestion and characteristics of multimedia data is required. In this paper, we propose APQM algorithm which probabilistically removes packet by the congestion level of the queue in wireless station. The comparison with other existing scheduling algorithms shows tht congestion in the network is reduced and multimedia service quality of the proposed algorithm is improved.

Power Conscious Disk Scheduling for Multimedia Data Retrieval (저전력 환경에서 멀티미디어 자료 재생을 위한 디스크 스케줄링 기법)

  • Choi, Jung-Wan;Won, Yoo-Jip;Jung, Won-Min
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.4
    • /
    • pp.242-255
    • /
    • 2006
  • In the recent years, Popularization of mobile devices such as Smart Phones, PDAs and MP3 Players causes rapid increasing necessity of Power management technology because it is most essential factor of mobile devices. On the other hand, despite low price, hard disk has large capacity and high speed. Even it can be made small enough today, too. So it appropriates mobile devices. but it consumes too much power to embed In mobile devices. Due to these motivations, in this paper we had suggested methods of minimizing Power consumption while playing multimedia data in the disk media for real-time and we evaluated what we had suggested. Strict limitation of power consumption of mobile devices has a big impact on designing both hardware and software. One difference between real-time multimedia streaming data and legacy text based data is requirement about continuity of data supply. This fact is why disk drive must persist in active state for the entire playback duration, from power management point of view; it nay be a great burden. A legacy power management function of mobile disk drive affects quality of multimedia playback negatively because of excessive I/O requests when the disk is in standby state. Therefore, in this paper, we analyze power consumption profile of disk drive in detail, and we develop the algorithm which can play multimedia data effectively using less power. This algorithm calculates number of data block to be read and time duration of active/standby state. From this, the algorithm suggested in this paper does optimal scheduling that is ensuring continual playback of data blocks stored in mobile disk drive. And we implement our algorithms in publicly available MPEG player software. This MPEG player software saves up to 60% of power consumption as compared with full-time active stated disk drive, and 38% of power consumption by comparison with disk drive controlled by native power management method.

Study on a Dynamic master system for Controller Area Network

  • Won, Ji-Woon;Hong, Won-Kee;Lee, Yong-Doo
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.147-151
    • /
    • 2005
  • CAN(Controller Area Network) is a simple and efficient network system for real time control and measurement. As it is not only good at error detection but also strong in electromagnetic interference, CAN has been widely used all over the industries. Basically, CAN needs a master node in charge of sensor data collection, node scheduling for data transmission to a monitoring system and error detection. According to the number of mater nodes, the CAN system is classified into two type of master system. One is a single master system that has only one master node and the other is a multi-master system where any sensor node can become a master node depending on the system's conditions. While it has the advantage of its fault tolerance, the multi-master system will suffer form the overall performance degradation when a defect is found in the master node. It is because all sensor nodes pertaining to a defective master node lose their position. Moreover, it is difficult and expensive to implement. For a single master system, the whole system will be broken down when a problem happens to a single master. In this paper, a dynamic master system is presented that there are several sub-master nodes of which basic functions are those of other sensor nodes at ordinary times but dynamically changed to replace the failing master node. An effective scheduling algorithm is also proposed to choose an appropriate node among sub-master nodes, where each sub-master node has its precedence value. The performance of the dynamic master system is experimented and analyzed.

  • PDF

Implementation and Performance Evaluation of Reporting Interval-adaptive Sensor Control Scheme for Energy Efficient Data Gathering (에너지 효율적 센서 데이터 수집을 위한 리포팅 허용 지연시간 적응형 센서 제어 기법 구현 및 성능평가)

  • Shon, Tae-Shik;Choi, Hyo-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.17C no.6
    • /
    • pp.459-464
    • /
    • 2010
  • Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we implement and evaluate a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC), in wireless sensor networks. The TPC is implemented on sensor Mote hardwares. With the help of TPC implemented, sensors selectively use direct links for control and forwarding time critical sensed data and relay links for data forwarding based on the user delay constraints given. Implementation study shows that TPC helps the sensors to increase a significant amount of energy while collecting sensed data from sensors in a real environment.

A Laxity Based On-line Real-Time Scheduling Algorithm for Multiprocessor Systems (다중프로세서 시스템을 위한 여유시간 기반의 온라인 실시간 스케줄링 알고리즘)

  • Cho, Kyu-Eok;Kim, Yong-Seok
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.437-442
    • /
    • 2009
  • For multiprocessor systems, Earliest Deadline First (EDF) based on deadline and Least Laxity First (LLF) based on laxity are not suitable for practical environment since EDF has low schedulability and LLF has high context switching overhead. As a combining of EDF and LLF to improve the performance, Earliest Deadline Zero Laxity (EDZL) was proposed. EDZL is basically the same as EDF. But if the laxity of a task becomes zero, its priority is promoted to the highest level. In this paper, we propose Least Laxity Zero Laxity (LLZL) which is based on LLF. But context switching is allowed only if the laxity of a task on rady queue becomes zero. Simulation results show that LLZL has high schedulability approaching to LLF and low context switching overhead similar to EDF. In comparison with EDZL, LLZL has better performance in both of schedulability and context switching overhead.

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.

Research for establishing a model of optimizing civilian withdrawal plan for the border area (접경지역 최적 주민철수 계획수립을 위한 모형 연구)

  • Jung, Jae Hwan;Yun, Ho Yeong;Jeong, Chang Soon;Kim, Kyung Sup
    • Journal of the Society of Disaster Information
    • /
    • v.14 no.2
    • /
    • pp.219-229
    • /
    • 2018
  • Purpose: This research proposes an optimization model for effective evacuation routing and scheduling of civilians near the border area when full-scale war threats heighten. Method: To reflect the reality, administrative unit network is created using Kruscal's Algorithm, Harmony Search, CCRP based on the geographical features, population, and traffic data of real cities, and then, optimal civilian evacuation routes are found. Results: Optimal evacuation routes and schedules are computed by repetitive experiments, and it is found that the scenario that minimizes the average civilian evacuation time is effective for the civilian evacuation plan. Conclusion: By using the civilian evacuation plan this research proposes, at the time of establishing the actual civilian evacuation plan, quantitative analysis is used for the effective plan making rather than only depending.

Control of pH Neutralization Process using Simulation Based Dynamic Programming in Simulation and Experiment (ICCAS 2004)

  • Kim, Dong-Kyu;Lee, Kwang-Soon;Yang, Dae-Ryook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.620-626
    • /
    • 2004
  • For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

  • PDF

Dual Token Bucket based HCCA Scheduler for IEEE 802.11e (IEEE 802.11e WLAN 위한 이중 리키 버킷 기반 HCCA 스케줄러)

  • Lee, Dong-Yul;Lee, Chae-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1178-1190
    • /
    • 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 efficiently assign resource for VBR traffic, in this paper, we propose TXOP algorithm based on dual leaky bucket using average resource allocation and peak resource allocation. The minimum TXOP of each station is obtained by using statistical approach to maximize number of stations of which performance satisfy QoS target. Simulation results show that the proposed algorithm has much higher performance compared with reference scheduler in terms of throughput and delay.

Automated Stacking Crane Dispatching Strategy in a Container Terminal using Genetic Algorithm (유전 알고리즘을 이용한 자동화 컨테이너 터미널에서의 장치장 크레인의 작업 할당 전략)

  • Wu, Jiemin;Yang, Young-Jee;Choe, Ri;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.36 no.5
    • /
    • pp.387-394
    • /
    • 2012
  • In an automated container terminal, automated stacking cranes(ASCs) take charge of handling of containers in a block of the stacking yard. This paper proposes a multi-criteria strategy to solve the problem of job dispatching of twin ASCs which are identical to each another in size and specification. To consider terminal situation from different angles, the proposed method evaluates candidate jobs through various factors and it dispatches the best score job to a crane by doing a weighted sum of the evaluated values. In this paper, we derive the criteria for job dispatching strategy, and we propose a genetic algorithm to optimize weights for aggregating evaluated results. Experimental results are shown that it is suitable for real time terminal with lower computational cost and the strategy using various criteria improves the efficiency of the container terminal.