PARLGRAN: parallelism granularity selection for scheduling task chains on dynamically reconfigurable architectures

Authors:
Sudarshan Banerjee;Elaheh Bozorgzadeh;Nikil Dutt
Affiliations:
University of California, Irvine, CA;University of California, Irvine, CA;University of California, Irvine, CA
Venue:
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Year:
2006

Citing 14
Cited 10

Rectangle-packing-based module placement

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Configuration prefetch for single context reconfigurable coprocessors

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Advanced compiler design and implementation

Advanced compiler design and implementation
MorphoSys: case study of a reconfigurable computing system targeting multimedia applications

Proceedings of the 37th Annual Design Automation Conference
Optimal FPGA module placement with temporal precedence constraints

Proceedings of the conference on Design, automation and test in Europe
A Virtual Hardware Operating System for the Xilinx XC6200

FPL '96 Proceedings of the 6th International Workshop on Field-Programmable Logic, Smart Applications, New Paradigms and Compilers
Improving functional density through run-time circuit reconfiguration

Improving functional density through run-time circuit reconfiguration
Runtime Assignment of Reconfigurable Hardware Components for Image Processing Pipelines

FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
An efficient algorithm for finding empty space for online FPGA placement

Proceedings of the 41st annual Design Automation Conference
Power-performance trade-offs for reconfigurable computing

Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks

IEEE Transactions on Computers
Modeling and optimizing run-time reconfiguration using evolutionary computation

ACM Transactions on Embedded Computing Systems (TECS)
Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration

Proceedings of the 42nd annual Design Automation Conference
Temporal floorplanning using the T-tree formulation

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design

Mapping data-parallel tasks onto partially reconfigurable hybrid processor architectures

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Selective bandwidth and resource management in scheduling for dynamically reconfigurable architectures

Proceedings of the 44th annual Design Automation Conference
Run-time spatial mapping of streaming applications to a heterogeneous multi-processor system-on-chip (MPSoC)

Proceedings of the conference on Design, automation and test in Europe
Task scheduling with configuration prefetching and anti-fragmentation techniques on dynamically reconfigurable systems

Proceedings of the conference on Design, automation and test in Europe
Optimal Unroll Factor for Reconfigurable Architectures

ARC '08 Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications
Task graph scheduling for reconfigurable architectures driven by reconfigurations hiding and resources reuse

Proceedings of the 19th ACM Great Lakes symposium on VLSI
Optimal Loop Unrolling and Shifting for Reconfigurable Architectures

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Partitioning and scheduling of task graphs on partially dynamically reconfigurable FPGAs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Modern development methods and tools for embedded reconfigurable systems: A survey

Integration, the VLSI Journal
Bandwidth Management in Application Mapping for Dynamically Reconfigurable Architectures

ACM Transactions on Reconfigurable Technology and Systems (TRETS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partial dynamic reconfiguration, often called RTR (run-time reconfiguration) is a key feature in modern reconfigurable platforms. While partial RTR enables additional application performance, it imposes physical constraints necessitating simultaneous scheduling and placement while mapping application task graphs onto such architectures. In this paper we present PARLGRAN, an approach that maximizes performance of application task chains by selecting a suitable granularity of data-parallelism for individual data parallel tasks. Our approach focusses on reconfiguration delay overhead and placement-related issues (such as fragmentation) while selecting individual data-parallelism granularity as an integral part of simultaneous scheduling and placement. We demonstrate that our heuristic generates high-quality schedules on an extensive set of over a 1000 synthetic experiments by comparing the results with an approach that tries to statically maximize data-parallelism, i.e., does not consider the overheads and constraints associated with partial RTR. A detailed case-study on JPEG encoding additionally confirms that blindly maximizing data-parallelism can result in schedules even worse than that generated by a simple (but RTR-aware) approach oblivious to data-parallelism.