A preemption algorithm for a multitasking environment on dynamically reconfigurable processor

Vu Manh Tuan, Hideharu Amano

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Task preemption is a critical mechanism for building an effective multitasking environment on dynamically reconfigurable processors. When being preempted, necessary state information of the interrupted task in registers and distributed internal memories must be correctly preserved. This paper aims at studying a method for saving and restoring the state data of a hardware task, executing on a dynamically reconfigurable processing array, taking into account the great amount and the distribution on different storage elements of data. Performance degradation caused by task preemption is minimized by allowing preemption only at predefined points where demanded resources are small. Specifically, we propose: 1) algorithms to insert preemption points subject to user-specified preemption latency and resource overhead constraints; 2) modification steps to incorporate the offered algorithms on the system design flow. Evaluation results on the NEC DRP architecture show that the proposed method achieves a reasonable hardware overhead (from 6% to 14%) while satisfying a given preemption latency.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages172-184
Number of pages13
Volume4943 LNCS
DOIs
Publication statusPublished - 2008
Event4th International Workshop on Applied Reconfigurable Computing, ARC 2008 - London, United Kingdom
Duration: 2008 Mar 262008 Mar 28

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4943 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Workshop on Applied Reconfigurable Computing, ARC 2008
CountryUnited Kingdom
CityLondon
Period08/3/2608/3/28

Fingerprint

Multitasking
Preemption
Hardware
Array processing
Information Storage and Retrieval
Systems analysis
Data storage equipment
Degradation
Latency
Resource Constraints
System Design
Internal
Resources
Necessary
Evaluation
preempt

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Tuan, V. M., & Amano, H. (2008). A preemption algorithm for a multitasking environment on dynamically reconfigurable processor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4943 LNCS, pp. 172-184). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4943 LNCS). https://doi.org/10.1007/978-3-540-78610-8_18

A preemption algorithm for a multitasking environment on dynamically reconfigurable processor. / Tuan, Vu Manh; Amano, Hideharu.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4943 LNCS 2008. p. 172-184 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4943 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tuan, VM & Amano, H 2008, A preemption algorithm for a multitasking environment on dynamically reconfigurable processor. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4943 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4943 LNCS, pp. 172-184, 4th International Workshop on Applied Reconfigurable Computing, ARC 2008, London, United Kingdom, 08/3/26. https://doi.org/10.1007/978-3-540-78610-8_18
Tuan VM, Amano H. A preemption algorithm for a multitasking environment on dynamically reconfigurable processor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4943 LNCS. 2008. p. 172-184. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-78610-8_18
Tuan, Vu Manh ; Amano, Hideharu. / A preemption algorithm for a multitasking environment on dynamically reconfigurable processor. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4943 LNCS 2008. pp. 172-184 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{dbc5b713ebca44d9a1bbc81e6c6fbe1e,
title = "A preemption algorithm for a multitasking environment on dynamically reconfigurable processor",
abstract = "Task preemption is a critical mechanism for building an effective multitasking environment on dynamically reconfigurable processors. When being preempted, necessary state information of the interrupted task in registers and distributed internal memories must be correctly preserved. This paper aims at studying a method for saving and restoring the state data of a hardware task, executing on a dynamically reconfigurable processing array, taking into account the great amount and the distribution on different storage elements of data. Performance degradation caused by task preemption is minimized by allowing preemption only at predefined points where demanded resources are small. Specifically, we propose: 1) algorithms to insert preemption points subject to user-specified preemption latency and resource overhead constraints; 2) modification steps to incorporate the offered algorithms on the system design flow. Evaluation results on the NEC DRP architecture show that the proposed method achieves a reasonable hardware overhead (from 6{\%} to 14{\%}) while satisfying a given preemption latency.",
author = "Tuan, {Vu Manh} and Hideharu Amano",
year = "2008",
doi = "10.1007/978-3-540-78610-8_18",
language = "English",
isbn = "3540786090",
volume = "4943 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "172--184",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A preemption algorithm for a multitasking environment on dynamically reconfigurable processor

AU - Tuan, Vu Manh

AU - Amano, Hideharu

PY - 2008

Y1 - 2008

N2 - Task preemption is a critical mechanism for building an effective multitasking environment on dynamically reconfigurable processors. When being preempted, necessary state information of the interrupted task in registers and distributed internal memories must be correctly preserved. This paper aims at studying a method for saving and restoring the state data of a hardware task, executing on a dynamically reconfigurable processing array, taking into account the great amount and the distribution on different storage elements of data. Performance degradation caused by task preemption is minimized by allowing preemption only at predefined points where demanded resources are small. Specifically, we propose: 1) algorithms to insert preemption points subject to user-specified preemption latency and resource overhead constraints; 2) modification steps to incorporate the offered algorithms on the system design flow. Evaluation results on the NEC DRP architecture show that the proposed method achieves a reasonable hardware overhead (from 6% to 14%) while satisfying a given preemption latency.

AB - Task preemption is a critical mechanism for building an effective multitasking environment on dynamically reconfigurable processors. When being preempted, necessary state information of the interrupted task in registers and distributed internal memories must be correctly preserved. This paper aims at studying a method for saving and restoring the state data of a hardware task, executing on a dynamically reconfigurable processing array, taking into account the great amount and the distribution on different storage elements of data. Performance degradation caused by task preemption is minimized by allowing preemption only at predefined points where demanded resources are small. Specifically, we propose: 1) algorithms to insert preemption points subject to user-specified preemption latency and resource overhead constraints; 2) modification steps to incorporate the offered algorithms on the system design flow. Evaluation results on the NEC DRP architecture show that the proposed method achieves a reasonable hardware overhead (from 6% to 14%) while satisfying a given preemption latency.

UR - http://www.scopus.com/inward/record.url?scp=51849085212&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51849085212&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-78610-8_18

DO - 10.1007/978-3-540-78610-8_18

M3 - Conference contribution

AN - SCOPUS:51849085212

SN - 3540786090

SN - 9783540786092

VL - 4943 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 172

EP - 184

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -