2014Unpublished venueRequires access

Task Scheduling in Cyber-Physical Systems

Chunyao Liu, Lichen Zhang, Daqiang Zhang

Open publisher page 5 citations

Abstract

Task scheduling in Cyber-Physical System (CPS) is of vital importance to increase resource utilization and enhance system performance. Conventional task scheduling schemes in embedded real-time systems are unable to satisfy performance requirements of CPS due to its task diversity and system heterogeneity. In this paper, we consider two parts of task scheduling in CPS, scheduling at node network and scheduling at computing center. First, we propose a dynamic multi-priority scheduling scheme for task transmission in node network. A mixed pre-emptive and non-pre-emptive priority scheduling method is designed to reduce the average waiting time of tasks in each queue. A waiting-time threshold mechanism is added to ensure the fairness of different priority tasks. Second, we analyze the performance indicators of tasks at the computing center which is regarded as a multi-priority multi-server queueing model. We propose a comprehensive resource scheduling strategy to balance cost and system performance. Simulation results show that our proposed scheduling scheme has a better performance than traditional scheduling methods and our scheduling at computing center is more comprehensive than other extreme strategies.

About this research paper

What this paper is about

Task scheduling in Cyber-Physical System (CPS) is of vital importance to increase resource utilization and enhance system performance. Conventional task scheduling schemes in embedded real-time systems are unable to satisfy performance requirements of CPS due to its task diversity and system heterogeneity. In this paper, we consider two parts of task scheduling in CPS, scheduling at node network and scheduling at computing center. First, we propose a dynamic multi-priority scheduling scheme for task transmission in node network. A mixed pre-emptive and non-pre-emptive priority scheduling method is designed to reduce the average waiting time of tasks in each queue. A waiting-time threshold mechanism is added to ensure the fairness of different priority tasks. Second, we analyze the performance indicators of tasks at the computing center which is regarded as a multi-priority multi-server queueing model. We propose a comprehensive resource scheduling strategy to balance cost and system performance. Simulation results show that our proposed scheduling scheme has a better performance than traditional scheduling methods and our scheduling at computing center is more comprehensive than other extreme strategies.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Task scheduling in Cyber-Physical System (CPS) is of vital importance to increase resource utilization and enhance system performance. Conventional task scheduling schemes in embedded real-time systems are unable to satisfy performance requirements of CPS due to its task diversity and system heterogeneity. In this paper, we consider two parts of task scheduling in CPS, scheduling at node network and scheduling at computing center. First, we propose a dynamic multi-priority scheduling scheme for task transmission in node network. A mixed pre-emptive and non-pre-emptive priority scheduling method is designed to reduce the average waiting time of tasks in each queue. A waiting-time threshold mechanism is added to ensure the fairness of different priority tasks. Second, we analyze the performance indicators of tasks at the computing center which is regarded as a multi-priority multi-server queueing model. We propose a comprehensive resource scheduling strategy to balance cost and system performance. Simulation results show that our proposed scheduling scheme has a better performance than traditional scheduling methods and our scheduling at computing center is more comprehensive than other extreme strategies.

Key concepts: Computer science, Dynamic priority scheduling, Fixed-priority pre-emptive scheduling, Rate-monotonic scheduling, Fair-share scheduling, Round-robin scheduling, Deadline-monotonic scheduling, Two-level scheduling

Related papers

Back to paper searchBrowse research topicsOriginal source
Task Scheduling in Cyber-Physical Systems — Research Paper | ScholarLens