Runtime hardware/software task transition scheduling for data-adaptable embedded systems

Nathan Sandoval; Casey Mackin; Sean Whitsitt; Roman Lysecky; Jonathan Sprinkle

doi:10.1109/FPT.2013.6718382

Runtime hardware/software task transition scheduling for data-adaptable embedded systems

Nathan Sandoval, Casey Mackin, Sean Whitsitt, Roman Lysecky, Jonathan Sprinkle

Electrical and Computer Engineering

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

6 Scopus citations

Abstract

Data-adaptable reconfigurable embedded systems enable a flexible runtime implementation in which a system can transition the execution of tasks between hardware and software while simultaneously continuing to process data during the transition. Efficient runtime scheduling of task transitions is needed to optimize system throughput and latency of the reconfiguration and transition periods. In this paper, we present and analyze several runtime transition scheduling algorithms and highlight the latency and throughput tradeoffs for an example system.

Original language	English (US)
Title of host publication	FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology
Pages	342-345
Number of pages	4
DOIs	https://doi.org/10.1109/FPT.2013.6718382
State	Published - 2013
Event	2013 12th International Conference on Field-Programmable Technology, FPT 2013 - Kyoto, Japan Duration: Dec 9 2013 → Dec 11 2013

Publication series

Name	FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology

Other

Other	2013 12th International Conference on Field-Programmable Technology, FPT 2013
Country/Territory	Japan
City	Kyoto
Period	12/9/13 → 12/11/13

Keywords

data adaptability
hardware/software codesign
model-based design
runtime transition scheduling

ASJC Scopus subject areas

Software

Access to Document

10.1109/FPT.2013.6718382

Cite this

Sandoval, N., Mackin, C., Whitsitt, S., Lysecky, R., & Sprinkle, J. (2013). Runtime hardware/software task transition scheduling for data-adaptable embedded systems. In FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology (pp. 342-345). Article 6718382 (FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology). https://doi.org/10.1109/FPT.2013.6718382

Runtime hardware/software task transition scheduling for data-adaptable embedded systems. / Sandoval, Nathan; Mackin, Casey; Whitsitt, Sean et al.
FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology. 2013. p. 342-345 6718382 (FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology).

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

Sandoval, N, Mackin, C, Whitsitt, S, Lysecky, R & Sprinkle, J 2013, Runtime hardware/software task transition scheduling for data-adaptable embedded systems. in FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology., 6718382, FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology, pp. 342-345, 2013 12th International Conference on Field-Programmable Technology, FPT 2013, Kyoto, Japan, 12/9/13. https://doi.org/10.1109/FPT.2013.6718382

Sandoval N, Mackin C, Whitsitt S, Lysecky R, Sprinkle J. Runtime hardware/software task transition scheduling for data-adaptable embedded systems. In FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology. 2013. p. 342-345. 6718382. (FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology). doi: 10.1109/FPT.2013.6718382

@inproceedings{b91743479e4545ae99c1322bae695f0e,

title = "Runtime hardware/software task transition scheduling for data-adaptable embedded systems",

abstract = "Data-adaptable reconfigurable embedded systems enable a flexible runtime implementation in which a system can transition the execution of tasks between hardware and software while simultaneously continuing to process data during the transition. Efficient runtime scheduling of task transitions is needed to optimize system throughput and latency of the reconfiguration and transition periods. In this paper, we present and analyze several runtime transition scheduling algorithms and highlight the latency and throughput tradeoffs for an example system.",

keywords = "data adaptability, hardware/software codesign, model-based design, runtime transition scheduling",

author = "Nathan Sandoval and Casey Mackin and Sean Whitsitt and Roman Lysecky and Jonathan Sprinkle",

year = "2013",

doi = "10.1109/FPT.2013.6718382",

language = "English (US)",

isbn = "9781479921990",

series = "FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology",

pages = "342--345",

booktitle = "FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology",

note = "2013 12th International Conference on Field-Programmable Technology, FPT 2013 ; Conference date: 09-12-2013 Through 11-12-2013",

}

TY - GEN

T1 - Runtime hardware/software task transition scheduling for data-adaptable embedded systems

AU - Sandoval, Nathan

AU - Mackin, Casey

AU - Whitsitt, Sean

AU - Lysecky, Roman

AU - Sprinkle, Jonathan

PY - 2013

Y1 - 2013

N2 - Data-adaptable reconfigurable embedded systems enable a flexible runtime implementation in which a system can transition the execution of tasks between hardware and software while simultaneously continuing to process data during the transition. Efficient runtime scheduling of task transitions is needed to optimize system throughput and latency of the reconfiguration and transition periods. In this paper, we present and analyze several runtime transition scheduling algorithms and highlight the latency and throughput tradeoffs for an example system.

AB - Data-adaptable reconfigurable embedded systems enable a flexible runtime implementation in which a system can transition the execution of tasks between hardware and software while simultaneously continuing to process data during the transition. Efficient runtime scheduling of task transitions is needed to optimize system throughput and latency of the reconfiguration and transition periods. In this paper, we present and analyze several runtime transition scheduling algorithms and highlight the latency and throughput tradeoffs for an example system.

KW - data adaptability

KW - hardware/software codesign

KW - model-based design

KW - runtime transition scheduling

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

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

U2 - 10.1109/FPT.2013.6718382

DO - 10.1109/FPT.2013.6718382

M3 - Conference contribution

AN - SCOPUS:84894216078

SN - 9781479921990

T3 - FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology

SP - 342

EP - 345

BT - FPT 2013 - Proceedings of the 2013 International Conference on Field Programmable Technology

T2 - 2013 12th International Conference on Field-Programmable Technology, FPT 2013

Y2 - 9 December 2013 through 11 December 2013

ER -

Runtime hardware/software task transition scheduling for data-adaptable embedded systems

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this