Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: This work extends force-directed scheduling (FDS) to support specification constructs that express parallelism and timing behaviours.  select the FDS algorithm because it maximizes the amount of resource sharing, and it naturally supports constructs for parallelism. Hover, timed constructs are not supported. As a result,  propose timed FDS (TFDS) that optimizes over parallel, timed and untimed constructs. In doing so,  make the following four contributions: 1)  extend the definition of control data flow graphs (CDFGs) to define timed CDFGs (TCDFGs), 2)  define a scheduling algorithm for timed constructs called TIME, 3)  extend the definition of mobility used in FDS, and 4)  present optimizations for a composition of parallel, timed and untimed constructs to better aid FDS.  implement our extensions in a high-level synthesis framework based on the abstract state machine formalism, and  generate synthesizable VHDL.  experiment with several examples such as FIR, edge detector, and a differential equation solver, and target them onto an Alter a DE2 FPGA. Some of these experiments show improvements of up to 52% in circuit area when compared to their unoptimized counterparts.
['Rohit Sinha', 'Hiren D. Patel']
I am writing a research paper on a idea Extending Force-Directed Scheduling with Explicit Parallel and Timed Constructs for High-Level Synthesis
[{"from": "human", "value": "I am writing a research paper on a idea Extending Force-Directed Scheduling with Explicit Parallel and Timed Constructs for High-Level Synthesis"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: This work extends force-directed scheduling (FDS) to support specification constructs that express parallelism and timing behaviours.  select the FDS algorithm because it maximizes the amount of resource sharing, and it naturally supports constructs for parallelism. Hover, timed constructs are not supported. As a result,  propose timed FDS (TFDS) that optimizes over parallel, timed and untimed constructs. In doing so,  make the following four contributions: 1)  extend the definition of control data flow graphs (CDFGs) to define timed CDFGs (TCDFGs), 2)  define a scheduling algorithm for timed constructs called TIME, 3)  extend the definition of mobility used in FDS, and 4)  present optimizations for a composition of parallel, timed and untimed constructs to better aid FDS.  implement our extensions in a high-level synthesis framework based on the abstract state machine formalism, and  generate synthesizable VHDL.  experiment with several examples such as FIR, edge detector, and a differential equation solver, and target them onto an Alter a DE2 FPGA. Some of these experiments show improvements of up to 52% in circuit area when compared to their unoptimized counterparts."}]