• Title/Summary/Keyword: Scheduling model

Search Result 1,011, Processing Time 0.025 seconds

SINR based Maximum Link Scheduling with Uniform Power in Wireless Sensor Networks

  • Huang, Baogui;Yu, Jiguo;Yu, Dongxiao;Ma, Chunmei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.4050-4067
    • /
    • 2014
  • In wireless sensor networks, link scheduling is a fundamental problem related to throughput capacity and delay. For a given set of communication requests $L=\{l_1,l_2,{\cdots},l_n\}$, the MLS (maximum link scheduling) problem aims to find the largest possible subset S of Lsuch that the links in S can be scheduled simultaneously. Most of the existing results did not consider bidirectional transmission setting, which is more realistic in wireless sensor networks. In this paper, under physical interference model SINR (signal-to-noise-plus-interference-ratio) and bidirectional transmission model, we propose a constant factor approximation algorithm MLSA (Maximum Link Scheduling Algorithm) for MLS. It is proved that in the same topology setting the capacity under unidirectional transmission model is lager than that under bidirectional transmission model. However, compared with some work under unidirectional transmission model, the capacity of MLSA is improved about 28% to 45%.

Grid Scheduling Model with Resource Performance Measurement in Computational Grid Computing (계산 그리드 컴퓨팅에서의 자원 성능 측정을 통한 그리드 스케줄링 모델)

  • Park, Da-Hye;Lee, Jong-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.87-94
    • /
    • 2006
  • Grid computing has been developed for resolving large-scaled computing problems through geographically distributed heterogeneous resources. In order to guarantee effective and reliable job processing, grid computing needs resource scheduling model. So, we propose a resource performance measurement scheduling model which allocates job to resources with resource performance measurement. We assess resources using resource performance measurement formula, and implement the resource performance measurement scheduling model in DEVS simulation modeling.

  • PDF

Model-based Gain Scheduling Strategy for Air-to-fuel Ratio Control Algorithm of Passenger Car Diesel Engines (승용디젤엔진의 공연비 제어 알고리즘을 위한 모델기반 게인 스케줄링 전략에 대한 연구)

  • Park, Inseok;Hong, Seungwoo;Sunwoo, Myoungho
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.23 no.1
    • /
    • pp.56-64
    • /
    • 2015
  • This study presents a model-based gain scheduling strategy for PI-based EGR controllers. The air-to-fuel ratio is used as an indirect measurement of the EGR rate. In order to cope with the nonlinearity and parameter varying characteristics of the EGR system, we proposed a static gain model of the EGR system using a new scheduling parameter. With the 810 steady-state measurements, the static gain model achieved 0.94 of R-squared value. Based on the static gain of the EGR system, the PI gains were robustly designed using quantitative feedback theory. Consequently, the gains of the PI controller are scheduled according to the static gain parameter of the EGR path in runtime. The proposed model-based gain scheduling strategy was validated through various operating conditions of engine experiments such as setpoint step responses and disturbance rejections.

Deep Learning Based Security Model for Cloud based Task Scheduling

  • Devi, Karuppiah;Paulraj, D.;Muthusenthil, Balasubramanian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3663-3679
    • /
    • 2020
  • Scheduling plays a dynamic role in cloud computing in generating as well as in efficient distribution of the resources of each task. The principle goal of scheduling is to limit resource starvation and to guarantee fairness among the parties using the resources. The demand for resources fluctuates dynamically hence the prearranging of resources is a challenging task. Many task-scheduling approaches have been used in the cloud-computing environment. Security in cloud computing environment is one of the core issue in distributed computing. We have designed a deep learning-based security model for scheduling tasks in cloud computing and it has been implemented using CloudSim 3.0 simulator written in Java and verification of the results from different perspectives, such as response time with and without security factors, makespan, cost, CPU utilization, I/O utilization, Memory utilization, and execution time is compared with Round Robin (RR) and Waited Round Robin (WRR) algorithms.

An Effect of Pitch Gain-Scheduling on Shaft Vibration Response of Wind Turbine (풍력터빈 축 진동 응답에 대한 피치 게인-스케쥴링의 효과)

  • Lim, Chae-Wook;Jo, Jun-Chul
    • The KSFM Journal of Fluid Machinery
    • /
    • v.15 no.2
    • /
    • pp.36-40
    • /
    • 2012
  • Pitch control of wind turbine is activated above rated wind speed for the purpose of rated power regulation. When we design pitch controller, its gain-scheduling is essential due to nonlinear characteristics of aerodynamic torque. In this study, 2-mass model including a vibration mode of drive-train for a 2 MW wind turbine is considered and pitch control with gain-scheduling using a linearization analysis of the nonlinear aerodynamic torque is applied. Some simulation results for the pitch gain-scheduling under step wind speed are presented and investigated. It is shown that gain-scheduling in pitch control is important especially in the region of high wind speeds when there exists a vibration mode of drive-train.

An Evaluation of Flowshop Scheduling Heuristics in a Dynamic Environment (동적(動的)환경에서의 flowshop 작업순서 결정(決定)을 위한 발견적(発見的) 기법(技法)들의 유효성(有效性)에 관한 연구)

  • Park, Yang-Byeong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.12 no.1
    • /
    • pp.19-30
    • /
    • 1986
  • This paper provides an evaluation of static flowshop scheduling heuristics for minimizing makespan as an objective function in the dynamic flowshop model, in which new jobs with stochastic processing times arrive at the shop randomly over time and are added into the waiting jobs for processing. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported me-sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are surmmarized. These scheduling rules are evaluated via computer using a SLAM discrete event simulation model. The results for the simulation are analyzed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical dynamic flowshop problems.

  • PDF

APPLICATION OF DISCRETE EVENT SIMULATION TO PRODUCTION SCHEDULING (이산적 시뮬레이션 모델을 이용한 생산 스케쥴)

  • 박영홍
    • Journal of the Korea Society for Simulation
    • /
    • v.10 no.1
    • /
    • pp.1-12
    • /
    • 2001
  • This article describes the application of discrete event simulation in a process industry (coffee manufacturing) as a daily production-scheduling tool. A large number of end products (around 300), sporadic demand, and limited shelf life of coffee (90 days) make it difficult to generate feasible production schedules manually. To solve this problem, an integrated system was developed incorporating discrete event simulation methodology into scheduling process. The integrated system is comprised of two components: a scheduling program and a simulation model. The scheduling program is used to generate daily schedules for roasting, grinding, and packing coffee. The simulation model uses the generated schedules to simulate the production of coffee and regenerates a modified production schedule. In this paper, each of the components will be described in detail, evaluated in terms of performance factors, and validated with a set of real production data. Although this article focuses on a specific system, we will share our experiences and Intuitions gained and encourage other process industries to develop simulation-based scheduling tools.

  • PDF

SCTTS: Scalable Cost-Time Trade-off Scheduling for Workflow Application in Grids

  • Khajehvand, Vahid;Pedram, Hossein;Zandieh, Mostafa
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3096-3117
    • /
    • 2013
  • To execute the performance driven Grid applications, an effective and scalable workflow scheduling is seen as an essential. To optimize cost & makespan, in this paper, we propose a Scalable Cost-Time Trade-off (SCTT) model for scheduling workflow tasks. We have developed a heuristic algorithm known as Scalable Cost-Time Trade-off Scheduling (SCTTS) with a lower runtime complexity based on the proposed SCTT model. We have compared the performance of our proposed approach with other heuristic and meta-heuristic based scheduling strategies using simulations. The results show that the proposed approach improves performance and scalability with different workflow sizes, task parallelism and heterogeneous resources. This method, therefore, outperforms other methods.

A Study on the Optimization Analysis of Tactical Ship Scheduling (전술적 선박 스케쥴링의 최적화 분석에 관한 연구)

  • 이경근;김시화
    • Journal of the Korean Institute of Navigation
    • /
    • v.18 no.2
    • /
    • pp.57-67
    • /
    • 1994
  • This paper treats the optimization analysis of tactical ship scheduling problems in the world seaborne bulk trade. The authors use the term 'tactial' to describe the ship scheduling problem where the owners should employ skillful tactics as an expedient toward gaining the higher profits per period in short term. Relevent research and related problems on ship scheduling problems are reviewed briefly and a model for the tactical ship scheduling problem formulated as Set Problem is introduced by modifying the previous work of Fisher(1989). The reality and practicability of the model is validated by some ship-ping statistics. Proper solution approaches are outlined in the context of computational tractability in tackling the Mixed Integer Propramming. Some underlying consideration for the computational experiment is also mentioned. The authors conclude the paper with the remarks on the need of user-friendly Decision Support System for ship scheduling under varying decision environment.

  • PDF

A Two-Step Job Scheduling Algorithm Based on Priority for Cloud Computing

  • Kim, Jeongwon
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.4
    • /
    • pp.235-240
    • /
    • 2013
  • Cloud systems are popular computing environment because they can provide easy access to computing resources for users as well as efficient use of resources for companies. The resources of cloud computing are heterogeneous and jobs have various characteristics. One such issue is effective job scheduling. Scheduling in the cloud system may be defined as a multiple criteria decision model. To address this issue, this paper proposes a priority-based two-step job scheduling algorithm. On the first level, jobs are classified based on preference. Resources are dedicated to a job if a deadline failure would cause severe results or critical business losses. In case of only minor discomfort or slight functional impairment, the job is scheduled using a best effort approach. On the second level, jobs are allocated to adequate resources through their priorities that are calculated by the analytic hierarchic process model. We then analyze the proposed algorithm and make a scheduling example to confirm its efficiency.