Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
A method for partitioning UNITY language in hardware and software
EURO-DAC '94 Proceedings of the conference on European design automation
Synthesis of application-specific multiprocessor systems including memory components
Journal of VLSI Signal Processing Systems - Special issue on application specific array processors (ASAP-92)
Communication synthesis for distributed embedded systems
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
System design methodologies: aiming at the 100 h design cycle
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Hardware-Software Cosynthesis for Digital Systems
IEEE Design & Test
A codesign experiment in acoustic echo cancellation: GMDFα
ACM Transactions on Design Automation of Electronic Systems (TODAES)
CODES '97 Proceedings of the 5th International Workshop on Hardware/Software Co-Design
Enforcing Schedulability of Multi-Task Systems by Hardware-Software Codesign
CODES '97 Proceedings of the 5th International Workshop on Hardware/Software Co-Design
Proceedings of the conference on Design, automation and test in Europe: Proceedings
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
Hi-index | 0.00 |
This paper presents a system-level approach to the synthesis of multi-task, hard real-time applications. The goal is to select a set of off-the-shelf processors with minimal cost while satisfying timing constraints. Our approach has three design phases: resource allocation, assignment, and scheduling. With the observation that the resource allocation is a search for a set of processors which requires the minimum cost, we adopted A* search based technique. For assignment we use a variation of the force-directed technique. Final task scheduling is based on the Earliest Deadline First (EDF) algorithm. Experimental results show that this approach is highly effective on a variety of examples.