Implementation of a Scheduling and Allocation Algorithm for Hardware Evaluation

In this thesis, an intuitive approach to determine scheduling and allocation of a behavioral algorithm defined by a netlist is presented. In this approach, scheduling is based on a weighted list scheduling where operations have the longest critical path are scheduled first. The component allocations are resorted to the PDCPA algorithm which focus on making efficient and correct clusters for hardware reuse problem…


1 Introduction
1.1 Motivation
1.2 Objective
1.3 Related work
1.4 Limitations
1.5 Organization of this thesis
2 Background
2.1 Behavioral synthesis
2.3 Netlist
2.4 Scheduling
2.5 Allocation
2.6 NP-Complete Problem
2.7 Partition problem
3 Theoretical study
3.1 Behavioral synthesis process
3.2 Scheduling techniques
3.2.1 ASAP (As Soon As Possible) Scheduling
3.2.2 ALAP (As Late As Possible) Scheduling
3.2.3 List Scheduling
3.2.4 Force-Directed Scheduling
3.2.5 Integer Linear Programming algorithm
3.2.6 Classification of scheduling
3.3 Allocation techniques
3.3.1 Greedy allocation
3.3.2 Left Edge (LE) Algorithm
3.3.3 Clique partitioning
3.3.4 Classification of allocation algorithm
4 Description of the program
4.1 Program specification
4.2 Basic structure of the program
4.2.1 Block diagram of the program
4.2.2 Hardware Structure in this program
4.3 DFG Analysis (sorting)
4.4 Scheduling
4.4.1 Sub Blocks of Scheduling
4.4.2 Scheduling technique selection
4.4.3 Multicycling in scheduling
4.4.4 Critical path computation
4.4.5 List scheduling
4.5 AllocationAuthor: Chen, Kangmin


Source: Linköping University

Download URL 2: Visit Now

Leave a Comment