Statistical design space exploration for application-specific unit synthesis
Proceedings of the 38th annual Design Automation Conference
Design space minimization with timing and code size optimization for embedded DSP
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Optimum and heuristic synthesis of multiple word-length architectures
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
High-Level Modeling and FPGA Prototyping of Produced Order Parallel Queue Processor Core
The Journal of Supercomputing
Design and architecture for an embedded 32-bit QueueCore
Journal of Embedded Computing - Issues in embedded single-chip multicore architectures
SystemCoDesigner: automatic design space exploration and rapid prototyping from behavioral models
Proceedings of the 45th annual Design Automation Conference
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Design exploration framework under impreciseness based on register-constrained inclusion scheduling
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Dynamic profiling and fuzzy-logic-based optimization of sensor network platforms
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.03 |
In this paper, we present a design exploration framework, called WIZARD, which aims at finding module selections that will lead to superior designs while considering scheduling and resource binding under latency and power constraints. The framework contains two phases: choosing the resource configuration, and determining a module binding for each resource. We introduce a powerful model called an acceptability function which models design objectives, based on tradeoffs among different design constraints as well as a user's willingness to accept a design. Module utility measure cooperating with inclusion scheduling is the key to the success of our method. The utility of a module reflects the usefulness of the module based on the acceptability function. Inclusion scheduling is an algorithm to provide information for determining the number of functional units as well as module usefulness. We also present a heuristic which modifies module utility values based on the given acceptability function until they lead to superior selections. Many experiments on well-known benchmarks show the effectiveness of the approach when the obtained module selections are compared with the results from enumerating all module selections, as well as other schemes such as MSSR and PSGA