A unified approach for scheduling and allocation
From MaRDI portal
Publication:3840893
DOI10.1016/S0167-9260(97)00012-6zbMATH Open0905.68009OpenAlexW2092312451MaRDI QIDQ3840893FDOQ3840893
Authors:
Publication date: 13 August 1998
Published in: Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-9260(97)00012-6
Recommendations
- Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques
- Data path synthesis
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- On the complexity of allocation problems in high-level synthesis
- High level synthesis of integrated heterogeneous pipelined processing elements for DSP applications
Cited In (9)
- Title not available (Why is that?)
- Lower bound estimation of hardware resources for scheduling in high-level synthesis
- Scheduling policies using marked/phantom slot algorithms
- A new approach to the multiport memory allocation problem in data path synthesis
- A unified approach to approximating resource allocation and scheduling
- High level synthesis of integrated heterogeneous pipelined processing elements for DSP applications
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- Reallocation problems in scheduling
- A systematic approach to classify design-time global scheduling techniques
This page was built for publication: A unified approach for scheduling and allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840893)