|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
Class Summary | |
---|---|
ABMLBDPPOStrategy | ABMLB (Absolute Buffer Memory Lower Bound) DPPO scheduler for SDF graphs. |
APGANStrategy | Acyclic Pair-wise Grouping of Adjacent Nodes (APGAN) scheduler for SDF graphs. |
BDPPOStrategy | This is a DPPO for balancing capacity over a dual-memory-bank architecture. |
CDPPOStrategy | The DPPO for code size optimization. |
CDPPOTableElement | Table entry of adapted DPPO for code size optimization. |
CompactProcedureSynthesis | Compact procedure synthesis for a schedule. |
DLCLoop | A simulator of Dynamic Loop Count (DLC) loop. |
DLCStrategy | Dynamic Loop Count (DLC) SAS scheduler for SDF graphs. |
DPPOStrategy | The base class of Dynamic Programming Post Optimization (DPPO). |
DPPOTableElement | A base class for DPPO table element. |
FlatStrategy | A flat scheduler for SDF graphs. |
GDPPOStrategy | GDPPO stands for "Generalized Dynamic Programming Post Optimization". |
MBOTopSortStrategy | A topological sorting algorithm for minimum buffer overlaps. |
MCBStrategy | A base scheduler using multirate cycle breaking framework. |
MinBufferStrategy | A minimum buffer cost scheduler for SDF graphs. |
Procedure | A class modeling procedure instantiation in software synthesis. |
ProcedureStrategy | A recursive procedure implementation. |
ProcedureSynthesis | Procedure synthesis for a schedule. |
ScheduleTree | A binary tree expression of R-schedule. |
ScheduleTreeNode | The class for schedule tree node. |
SDPPOStrategy | A DPPO scheduler for buffer sharing. |
SDPPOTopSortStrategy | A topological sorting for minimum SDPPO buffer sharing cost. |
TwoNodeStrategy | A recursive scheduler for two-node graphs. |
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |