Rapid design space exploration of application specific heterogeneous pipelined multiprocessor systems

Authors:
Haris Javaid;Aleksander Ignjatovic;Sri Parameswaran
Affiliations:
School of Computer Science and Engineering, University of New South Wales, Sydney, Australia;School of Computer Science and Engineering, University of New South Wales, Sydney, Australia;School of Computer Science and Engineering, University of New South Wales, Sydney, Australia
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2010

Citing 12
Cited 3

A formal approach for the optimization of heterogeneous multiprocessors for complex image processing schemes

EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
An integer linear programming based approach for parallelizing applications in On-chip multiprocessors

Proceedings of the 39th annual Design Automation Conference
Introduction to Algorithms

Introduction to Algorithms
Multigrain Parallel Processing for JPEG Encoding on a Single Chip Multiprocessor

IWIA '02 Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02)
Synthesis of Application-Specific Heterogeneous Multiprocessor Architectures Using Extensible Processors

VLSID '05 Proceedings of the 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design
Partitioning and Pipelined Scheduling of Embedded System Using Integer Linear Programming

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Heterogeneous multiprocessor implementations for JPEG:: a case study

CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
Synthesis of an application-specific soft multiprocessor system

Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
Design methodology for pipelined heterogeneous multiprocessor system

Proceedings of the 44th annual Design Automation Conference
Synthesis of heterogeneous pipelined multiprocessor systems using ILP: jpeg case study

CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis
Rapid runtime estimation methods for pipelined MPSoCs

Proceedings of the Conference on Design, Automation and Test in Europe
Macro pipelining based scheduling on high performance heterogeneousmultiprocessor systems

IEEE Transactions on Signal Processing

System-level application-aware dynamic power management in adaptive pipelined MPSoCs for multimedia

Proceedings of the International Conference on Computer-Aided Design
Run-time adaption for highly-complex multi-core systems

Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
A two-phase design space exploration strategy for system-level real-time application mapping onto MPSoC

Microprocessors & Microsystems

Quantified Score

Hi-index	0.03

Visualization

Abstract

This paper describes a rapid design methodology to create a pipeline of processors to execute streaming applications. The methodology seeks a system with the smallest area while its runtime is within a specified runtime constraint. Initially, a heuristic is used to rapidly explore a large number of processor configurations to find the near Pareto front of the design space, and then an exact integer linear programming (ILP) formulation (EIF) is used to find an optimal solution. A reduced ILP formulation (RIF) or the heuristic is used if the EIF does not find an optimal solution in a given time window. This design methodology was integrated into a commercial design flow and was evaluated on four benchmarks with design spaces containing up to 1016 design points. For each benchmark, the near Pareto front was found in less than 3 h using the heuristic, while EIF took up to 16 h. The results show that the average area error of the heuristic and RIF was within 2.25% and 1.25% of the optimal design points for all the benchmarks, respectively. The heuristic is faster than RIF, while both the heuristic and RIF are significantly faster than EIF.