Name
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. |
Year | Venue | Keywords |
|---|---|---|
2013 | PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY (FPT) | data adaptability, model-based design, hardware/software codesign, runtime transition scheduling |
Field | DocType | Citations |
Computer science,Scheduling (computing),Real-time computing,Two-level scheduling,Throughput,Control reconfiguration,Fixed-priority pre-emptive scheduling,Computer architecture,Fair-share scheduling,Parallel computing,Dynamic priority scheduling,Round-robin scheduling,Embedded system | Conference | 3 |
PageRank | References | Authors |
0.38 | 6 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathan Sandoval | 1 | 6 | 1.50 |
| Casey Mackin | 2 | 6 | 1.50 |
| Sean Whitsitt | 3 | 21 | 4.70 |
| Roman Lysecky | 4 | 605 | 60.43 |
| J. Sprinkle | 5 | 655 | 80.12 |