A preemption algorithm for a multitasking environment on dynamically reconfigurable processors

Vu Manh Tuan, Hideharu Amano

Research output: Contribution to journalArticle

Abstract

Task preemption is a critical mechanism for building an effective multi-tasking environment on dynamically reconfigurable processors. When a task is preempted, its necessary state information must be correctly preserved in order for the task to be resumed later. Not only do coarse-grained Dynamically Reconfigurable Processing Array (DRPAs) devices have different architectures using a variety of development tools, but the great amount of state data of hardware tasks executing on such devices are usually distributed on many different storage elements. To address these difficulties, this paper aims at studying a general method for capturing the state data of hardware tasks targeting coarse-grained DRPAs. Based on resource usage, algorithms for identifying preemption points and inserting preemption states subject to user-specified preemption latency are proposed. Moreover, a modification to automatically incorporate proposed steps into the system design flow is also discussed. The performance degradation caused by additional preemption states is minimized by allowing preemption only at predefined points where demanded resources are small. The evaluation result using a model based on NEC Electronics' DRP-1 shows that the proposed method can produce preemption points satisfying a given preemption latency with reasonable hardware overhead (from 6% to 15%).

Original languageEnglish
Pages (from-to)2793-2803
Number of pages11
JournalIEICE Transactions on Information and Systems
VolumeE91-D
Issue number12
DOIs
Publication statusPublished - 2008

Fingerprint

Multitasking
Array processing
Hardware
Electronic equipment
Systems analysis
Degradation

Keywords

  • Dynamically reconfigurable processor
  • Hardware overhead
  • Preemption algorithm
  • Preemption latency

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

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

In: IEICE Transactions on Information and Systems, Vol. E91-D, No. 12, 2008, p. 2793-2803.

Research output: Contribution to journalArticle

@article{85d6ff15667e44c69c62b00a8d30fad5,
title = "A preemption algorithm for a multitasking environment on dynamically reconfigurable processors",
abstract = "Task preemption is a critical mechanism for building an effective multi-tasking environment on dynamically reconfigurable processors. When a task is preempted, its necessary state information must be correctly preserved in order for the task to be resumed later. Not only do coarse-grained Dynamically Reconfigurable Processing Array (DRPAs) devices have different architectures using a variety of development tools, but the great amount of state data of hardware tasks executing on such devices are usually distributed on many different storage elements. To address these difficulties, this paper aims at studying a general method for capturing the state data of hardware tasks targeting coarse-grained DRPAs. Based on resource usage, algorithms for identifying preemption points and inserting preemption states subject to user-specified preemption latency are proposed. Moreover, a modification to automatically incorporate proposed steps into the system design flow is also discussed. The performance degradation caused by additional preemption states is minimized by allowing preemption only at predefined points where demanded resources are small. The evaluation result using a model based on NEC Electronics' DRP-1 shows that the proposed method can produce preemption points satisfying a given preemption latency with reasonable hardware overhead (from 6{\%} to 15{\%}).",
keywords = "Dynamically reconfigurable processor, Hardware overhead, Preemption algorithm, Preemption latency",
author = "Tuan, {Vu Manh} and Hideharu Amano",
year = "2008",
doi = "10.1093/ietisy/e91-d.12.2793",
language = "English",
volume = "E91-D",
pages = "2793--2803",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

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

AU - Tuan, Vu Manh

AU - Amano, Hideharu

PY - 2008

Y1 - 2008

N2 - Task preemption is a critical mechanism for building an effective multi-tasking environment on dynamically reconfigurable processors. When a task is preempted, its necessary state information must be correctly preserved in order for the task to be resumed later. Not only do coarse-grained Dynamically Reconfigurable Processing Array (DRPAs) devices have different architectures using a variety of development tools, but the great amount of state data of hardware tasks executing on such devices are usually distributed on many different storage elements. To address these difficulties, this paper aims at studying a general method for capturing the state data of hardware tasks targeting coarse-grained DRPAs. Based on resource usage, algorithms for identifying preemption points and inserting preemption states subject to user-specified preemption latency are proposed. Moreover, a modification to automatically incorporate proposed steps into the system design flow is also discussed. The performance degradation caused by additional preemption states is minimized by allowing preemption only at predefined points where demanded resources are small. The evaluation result using a model based on NEC Electronics' DRP-1 shows that the proposed method can produce preemption points satisfying a given preemption latency with reasonable hardware overhead (from 6% to 15%).

AB - Task preemption is a critical mechanism for building an effective multi-tasking environment on dynamically reconfigurable processors. When a task is preempted, its necessary state information must be correctly preserved in order for the task to be resumed later. Not only do coarse-grained Dynamically Reconfigurable Processing Array (DRPAs) devices have different architectures using a variety of development tools, but the great amount of state data of hardware tasks executing on such devices are usually distributed on many different storage elements. To address these difficulties, this paper aims at studying a general method for capturing the state data of hardware tasks targeting coarse-grained DRPAs. Based on resource usage, algorithms for identifying preemption points and inserting preemption states subject to user-specified preemption latency are proposed. Moreover, a modification to automatically incorporate proposed steps into the system design flow is also discussed. The performance degradation caused by additional preemption states is minimized by allowing preemption only at predefined points where demanded resources are small. The evaluation result using a model based on NEC Electronics' DRP-1 shows that the proposed method can produce preemption points satisfying a given preemption latency with reasonable hardware overhead (from 6% to 15%).

KW - Dynamically reconfigurable processor

KW - Hardware overhead

KW - Preemption algorithm

KW - Preemption latency

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

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

U2 - 10.1093/ietisy/e91-d.12.2793

DO - 10.1093/ietisy/e91-d.12.2793

M3 - Article

AN - SCOPUS:67650093715

VL - E91-D

SP - 2793

EP - 2803

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 12

ER -