Comparative analysis of multitask scheduling algorithms for reconfigurable computing regarding context switches and configuration cache usage

Christopher Spies; Leandro Soares Indrusiak; Manfred Glesner

Comparative analysis of multitask scheduling algorithms for reconfigurable computing regarding context switches and configuration cache usage

Christopher Spies, Leandro Soares Indrusiak, Manfred Glesner

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we investigate the usability of several well-known real-time scheduling algorithms for a system consisting of a single processor core and multiple dynamically reconfigurable functional units, running a number of processes in parallel. A SystemC simulation model of a wireless sensor network node serves as a case study for assessing the performance of the different algorithms. Specific emphasis is given to the analysis of the configuration cache miss ratio and the number of context switches, which are indicators of costly operations of the reconfigurable units, respectively reconfiguration and saving internal state.

Original language	English
Title of host publication	3rd Southern Conference on Programmable Logic, Proceedings
Place of Publication	NEW YORK
Publisher	IEEE
Pages	239-242
Number of pages	4
ISBN (Print)	978-1-4244-0606-7
Publication status	Published - 2007

Cite this

@inproceedings{9ba403f04f664a97864764b1affbd230,

title = "Comparative analysis of multitask scheduling algorithms for reconfigurable computing regarding context switches and configuration cache usage",

abstract = "In this paper, we investigate the usability of several well-known real-time scheduling algorithms for a system consisting of a single processor core and multiple dynamically reconfigurable functional units, running a number of processes in parallel. A SystemC simulation model of a wireless sensor network node serves as a case study for assessing the performance of the different algorithms. Specific emphasis is given to the analysis of the configuration cache miss ratio and the number of context switches, which are indicators of costly operations of the reconfigurable units, respectively reconfiguration and saving internal state.",

author = "Christopher Spies and Indrusiak, {Leandro Soares} and Manfred Glesner",

year = "2007",

language = "English",

isbn = "978-1-4244-0606-7",

pages = "239--242",

booktitle = "3rd Southern Conference on Programmable Logic, Proceedings",

publisher = "IEEE",

address = "United States",

}

Comparative analysis of multitask scheduling algorithms for reconfigurable computing regarding context switches and configuration cache usage. / Spies, Christopher; Indrusiak, Leandro Soares; Glesner, Manfred.
3rd Southern Conference on Programmable Logic, Proceedings. NEW YORK: IEEE, 2007. p. 239-242.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Comparative analysis of multitask scheduling algorithms for reconfigurable computing regarding context switches and configuration cache usage

AU - Spies, Christopher

AU - Indrusiak, Leandro Soares

AU - Glesner, Manfred

PY - 2007

Y1 - 2007

N2 - In this paper, we investigate the usability of several well-known real-time scheduling algorithms for a system consisting of a single processor core and multiple dynamically reconfigurable functional units, running a number of processes in parallel. A SystemC simulation model of a wireless sensor network node serves as a case study for assessing the performance of the different algorithms. Specific emphasis is given to the analysis of the configuration cache miss ratio and the number of context switches, which are indicators of costly operations of the reconfigurable units, respectively reconfiguration and saving internal state.

AB - In this paper, we investigate the usability of several well-known real-time scheduling algorithms for a system consisting of a single processor core and multiple dynamically reconfigurable functional units, running a number of processes in parallel. A SystemC simulation model of a wireless sensor network node serves as a case study for assessing the performance of the different algorithms. Specific emphasis is given to the analysis of the configuration cache miss ratio and the number of context switches, which are indicators of costly operations of the reconfigurable units, respectively reconfiguration and saving internal state.

M3 - Conference contribution

SN - 978-1-4244-0606-7

SP - 239

EP - 242

BT - 3rd Southern Conference on Programmable Logic, Proceedings

PB - IEEE

CY - NEW YORK

ER -