Optimal Algorithm for Task Scheduling of Distributed Test & Control System

2008 ◽  
Author(s):  
Meng Fang ◽  
Yu Zhenxia ◽  
Shang Mingsheng
Keyword(s):  
Control System ◽  
Task Scheduling ◽  
Optimal Algorithm ◽  
Distributed Test

Research on Cost-Optimal Algorithm of Multi-QoS Constraints for Task Scheduling in Hybrid-Cloud

2014 ◽  
Vol 9 (1) ◽  
pp. 33-49 ◽  
Author(s):  
Liu Yanpei ◽  
Li Chunlin ◽  
Yang Zhiyong ◽  
Chen Yuxuan ◽  
Xu Lijun
Keyword(s):  
Task Scheduling ◽  
Optimal Algorithm ◽  
Hybrid Cloud

A throughput optimal algorithm for map task scheduling in mapreduce with data locality

2013 ◽  
Vol 40 (4) ◽  
pp. 33-42 ◽  
Author(s):  
Weina Wang ◽  
Kai Zhu ◽  
Lei Ying ◽  
Jian Tan ◽  
Li Zhang
Keyword(s):  
Task Scheduling ◽  
Optimal Algorithm ◽  
Data Locality

BIN-PACKING ALGORITHMS FOR PERIODIC TASK SCHEDULING

2011 ◽  
Vol 25 (07) ◽  
pp. 1147-1160 ◽  
Author(s):  
ZHILIN ZHU ◽  
JINXUE SUI ◽  
LI YANG
Keyword(s):  
Control System ◽  
Real Time ◽  
Task Scheduling ◽  
Bin Packing ◽  
Performance Ratio ◽  
Electronic Control ◽  
Worst Case ◽  
Periodic Task ◽  
Electronic Control System ◽  
Best Fit

CAN (Controller Area Network) operation observes event triggering standards, it is widely applied in real-time distributional control system of the automobile electronic control system, satellite control system, medical equipment's electronic control system as well as the textile equipment and so on. As the extension of offline bin-packing problem, periodic task scheduling has many important applications in real-time distributed systems. For time triggered CAN control systems, two strategies to determine the basic cycle (BC) of TTCAN are presented. Next-fit algorithm, next-fit descending algorithm, best-fit algorithm and best-fit descending algorithm are proposed to construct periodic task scheduling tables. Time complexity and worst-case asymptotic performance ratio of these algorithms are analyzed, and the experimental results indicate that NFA algorithm is not worse than NFDA algorithm, BFA is also not worse than BFDA algorithm, four algorithms have the advantage over the typical one-dimensional bin-packing algorithm.

The Scheduling of the Elevator Group Control System Modeling and Simulation Based on PSO

2012 ◽  
Vol 229-231 ◽  
pp. 2306-2310
Author(s):  
Qi Han ◽  
Li Zhang
Keyword(s):  
Control System ◽  
Optimal Algorithm ◽  
System Modeling ◽  
Operation Time ◽  
Objective Evaluation ◽  
Multi Objective ◽  
Model And Simulation ◽  
Group Control ◽  
Elevator Group Control ◽  
Time And Energy

Focusing on scheduling of multi-objective optimization in the elevator group control system(EGCS), this article gives a different strategy for dispatching elevator based on improvement of service quality and low energy consumption. Multi-objective evaluation function is modeled base on three factors for average waiting time, average operation time and energy consumption.By making use of particle swarm optimization algorithm to finish the model and simulation of EGCS. Virtual simulation platform should be built by using C++builder6.0.Simulation result indicates the superiority of optimal algorithm

Sign in / Sign up

Export Citation Format

Share Document