Scribd
Upload
15 views

PD Assignment

Uploaded by

p.ganesh2030
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
15 views

PD Assignment

Uploaded by

p.ganesh2030
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

ALLOCATI ON,

ASSIGNMENT, AND
SCHEDULI NG

Presenter Name
G.Pradeep - AP23122140001
Ch.sivani - AP23122140002
P.v.n. Sai Ganesh - AP23122140003
G. Surya Teja - AP23122140004
D.Ramya - AP23122140005
B.Raja Babu - AP23122140006
2

CONTENTS
Allocation, assignment, and scheduling
Allocation types
Scheduling types
ALLOCATION, ASSIGNMENT, AND SCHEDULIN
G

HLS HDL Synthesis


Hardware-description language (HDL) synthesis
• Starts from a register-transfer level (RTL) description;
• circuit behavior in each clock cycle is fixed.
• Uses logic synthesis techniques to optimize the design.
• Generates a netlist.
High-level synthesis (also called architectural synthesis)
• Starts from an abstract behavioral description (C/Python).
• Generates an RTL description.

3
Targets Hardware
• FPGA - Field Programmable Gate Arrays
• ASIC - Application-Specific Integrated Circuit
Allocation
Assignment
Scheduling
HLS Overview
Allocation
• Allocation is the process of binding a data path or control path to
operations or components.
• The components can be, for example, microprocessors, micro-
controllers, DSP, ASIC, FPGA, memories, buses or point-to-point
links.
• It is divided into two types
• Data path allocation
• Control path allocation

7
Data Path Allocation

8
Control Path Allocation

9
Assignment
• After allocation the partitioning of system functionality to selected components
can be done.
• The partitioning defines the assignment of tasks to particular components.
• If there is number of tasks assigned to the same component, which does not
support parallel execution,
• the execution order need to be decided — task scheduling.

10
Scheduling
• Scheduling is the task of determining the instants at which the
execution of operations in the Data Flow Graph will start.
• ASAP Scheduling
• ALAP Scheduling
• List Scheduling
• Priority List Scheduling

11
As Soon As Possible Scheduling

12
As Soon As Possible Scheduling

13
As Late As Possible Scheduling

14
ASAP vs ALAP

15
List Scheduling

16
List Scheduling

17
Priority List Scheduling

18
Conclusion
Allocation, assignment, and scheduling are crucial stages in VLSI
design, determining the distribution of functional units, associating
hardware resources with logical entities, and optimizing timing for
improved performance. These processes bridge the gap between abstract
descriptions and physical implementation, influencing power
consumption and area utilization. Success in VLSI design relies on
effective decision-making in allocation and assignment, coupled with
optimized scheduling, to create efficient integrated circuits.

19
HARDWARE ACCELERATION

THANK YOU
20

You might also like