Improving the performance of periodic real-time processes: a graph theoretical approach

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

20 Downloads (Pure)

Abstract

In this paper the performance gain obtained by combining parallel periodic real-time processes is elaborated. In certain single-core mono-processor configurations, for example embedded control systems in robotics comprising many short processes, process context switches may consume a considerable amount of the available processing power. For this reason it can be advantageous to combine processes, to reduce the number of context switches and thereby increase the performance of the application. As we consider robotic applications only, often consisting of processes with identical periods, release times and deadlines, we restrict these configurations to periodic real-time processes executing on a single-core mono-processor. By graph theoretical concepts and means, we provide necessary and sufficient conditions so that the number of context switches can be reduced by combining synchronising processes.
Original languageUndefined
Title of host publicationCommunicating Process Architectures 2013
Place of PublicationBicester
PublisherOpen Channel Publishing Ltd
Pages57-79
Number of pages23
ISBN (Print)978-0-9565409-7-3
Publication statusPublished - 25 Aug 2013
EventCommunicating Process Architectures, CPA 2013: 35th WoTUG Conference on Concurrent and Parallel Programming - Edinburgh Napier University, Edinburgh, United Kingdom
Duration: 25 Aug 201328 Aug 2013
Conference number: 35

Publication series

Name35th WoTUG conference on concurrent and parallel programming
PublisherOpen Channel Publishing Ltd

Conference

ConferenceCommunicating Process Architectures, CPA 2013
CountryUnited Kingdom
CityEdinburgh
Period25/08/1328/08/13

Keywords

  • METIS-300172
  • IR-87925
  • CSP
  • Graph Transformations
  • acyclic multi-graphs
  • synchronised products
  • real-time periodic processes
  • EWI-24004
  • CR-G.2.2

Cite this

Boode, A. H., Broersma, H. J., & Broenink, J. F. (2013). Improving the performance of periodic real-time processes: a graph theoretical approach. In Communicating Process Architectures 2013 (pp. 57-79). (35th WoTUG conference on concurrent and parallel programming). Bicester: Open Channel Publishing Ltd.
Boode, Antoon Hendrik ; Broersma, Haitze J. ; Broenink, Johannes F. / Improving the performance of periodic real-time processes: a graph theoretical approach. Communicating Process Architectures 2013. Bicester : Open Channel Publishing Ltd, 2013. pp. 57-79 (35th WoTUG conference on concurrent and parallel programming).
@inproceedings{beb4ea2cf593450b9e7debe113070a8f,
title = "Improving the performance of periodic real-time processes: a graph theoretical approach",
abstract = "In this paper the performance gain obtained by combining parallel periodic real-time processes is elaborated. In certain single-core mono-processor configurations, for example embedded control systems in robotics comprising many short processes, process context switches may consume a considerable amount of the available processing power. For this reason it can be advantageous to combine processes, to reduce the number of context switches and thereby increase the performance of the application. As we consider robotic applications only, often consisting of processes with identical periods, release times and deadlines, we restrict these configurations to periodic real-time processes executing on a single-core mono-processor. By graph theoretical concepts and means, we provide necessary and sufficient conditions so that the number of context switches can be reduced by combining synchronising processes.",
keywords = "METIS-300172, IR-87925, CSP, Graph Transformations, acyclic multi-graphs, synchronised products, real-time periodic processes, EWI-24004, CR-G.2.2",
author = "Boode, {Antoon Hendrik} and Broersma, {Haitze J.} and Broenink, {Johannes F.}",
year = "2013",
month = "8",
day = "25",
language = "Undefined",
isbn = "978-0-9565409-7-3",
series = "35th WoTUG conference on concurrent and parallel programming",
publisher = "Open Channel Publishing Ltd",
pages = "57--79",
booktitle = "Communicating Process Architectures 2013",

}

Boode, AH, Broersma, HJ & Broenink, JF 2013, Improving the performance of periodic real-time processes: a graph theoretical approach. in Communicating Process Architectures 2013. 35th WoTUG conference on concurrent and parallel programming, Open Channel Publishing Ltd, Bicester, pp. 57-79, Communicating Process Architectures, CPA 2013, Edinburgh, United Kingdom, 25/08/13.

Improving the performance of periodic real-time processes: a graph theoretical approach. / Boode, Antoon Hendrik; Broersma, Haitze J.; Broenink, Johannes F.

Communicating Process Architectures 2013. Bicester : Open Channel Publishing Ltd, 2013. p. 57-79 (35th WoTUG conference on concurrent and parallel programming).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Improving the performance of periodic real-time processes: a graph theoretical approach

AU - Boode, Antoon Hendrik

AU - Broersma, Haitze J.

AU - Broenink, Johannes F.

PY - 2013/8/25

Y1 - 2013/8/25

N2 - In this paper the performance gain obtained by combining parallel periodic real-time processes is elaborated. In certain single-core mono-processor configurations, for example embedded control systems in robotics comprising many short processes, process context switches may consume a considerable amount of the available processing power. For this reason it can be advantageous to combine processes, to reduce the number of context switches and thereby increase the performance of the application. As we consider robotic applications only, often consisting of processes with identical periods, release times and deadlines, we restrict these configurations to periodic real-time processes executing on a single-core mono-processor. By graph theoretical concepts and means, we provide necessary and sufficient conditions so that the number of context switches can be reduced by combining synchronising processes.

AB - In this paper the performance gain obtained by combining parallel periodic real-time processes is elaborated. In certain single-core mono-processor configurations, for example embedded control systems in robotics comprising many short processes, process context switches may consume a considerable amount of the available processing power. For this reason it can be advantageous to combine processes, to reduce the number of context switches and thereby increase the performance of the application. As we consider robotic applications only, often consisting of processes with identical periods, release times and deadlines, we restrict these configurations to periodic real-time processes executing on a single-core mono-processor. By graph theoretical concepts and means, we provide necessary and sufficient conditions so that the number of context switches can be reduced by combining synchronising processes.

KW - METIS-300172

KW - IR-87925

KW - CSP

KW - Graph Transformations

KW - acyclic multi-graphs

KW - synchronised products

KW - real-time periodic processes

KW - EWI-24004

KW - CR-G.2.2

M3 - Conference contribution

SN - 978-0-9565409-7-3

T3 - 35th WoTUG conference on concurrent and parallel programming

SP - 57

EP - 79

BT - Communicating Process Architectures 2013

PB - Open Channel Publishing Ltd

CY - Bicester

ER -

Boode AH, Broersma HJ, Broenink JF. Improving the performance of periodic real-time processes: a graph theoretical approach. In Communicating Process Architectures 2013. Bicester: Open Channel Publishing Ltd. 2013. p. 57-79. (35th WoTUG conference on concurrent and parallel programming).