2005Handbook of Measuring System DesignRequires access

Scheduling Systems

E. Michta

Open publisher page 1 citations

Abstract

Abstract Application of the scheduling theory to the design of a distributed, real‐time networked measurement–control system is presented. Review of the priority‐based scheduling theory for the fixed priority assignment, system and task models, and application example are outlined. Emphasis is given to the processor and network utilization‐based test and to the task's worst‐case response time analysis. The same analysis approaches for task scheduling on single processor node and message scheduling across the network will be used. During the designing stage, scheduling of resources is decoupled and scheduling of each node and network is analyzed independently.

About this research paper

What this paper is about

Abstract Application of the scheduling theory to the design of a distributed, real‐time networked measurement–control system is presented. Review of the priority‐based scheduling theory for the fixed priority assignment, system and task models, and application example are outlined. Emphasis is given to the processor and network utilization‐based test and to the task's worst‐case response time analysis. The same analysis approaches for task scheduling on single processor node and message scheduling across the network will be used. During the designing stage, scheduling of resources is decoupled and scheduling of each node and network is analyzed independently.

Why it matters

OpenAlex reports 1 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

Abstract Application of the scheduling theory to the design of a distributed, real‐time networked measurement–control system is presented. Review of the priority‐based scheduling theory for the fixed priority assignment, system and task models, and application example are outlined. Emphasis is given to the processor and network utilization‐based test and to the task's worst‐case response time analysis. The same analysis approaches for task scheduling on single processor node and message scheduling across the network will be used. During the designing stage, scheduling of resources is decoupled and scheduling of each node and network is analyzed independently.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Scheduling Systems — Research Paper | ScholarLens