Problem Oriented Approach to Hardware-Assisted Algorithm Design in C: A Case Study for Scheduling, Placement and Routing

Author

Mucida, Lucas ; Lopes, Vincius ; Meireles, Waldir ; Ferreira, Ricardo

Author_Institution

Dept. de Inf., Univ. Fed. de Vicosa, Vicosa, Brazil

fYear

2012

fDate

17-19 Oct. 2012

Firstpage

1

Lastpage

8

Abstract

This work presents a problem oriented approach to introduce the design of hardware assisted algorithms. A scheduling, placement and routing problem for coarse-grained reconfigurable architecture (CGRA) has been chosen to ilustrate our approach. The algorithm is implemented in C language by using simple rules and a finite state machine model. The algorithm´s execution time is estimated by the number of clock cycles. For the proposed problem, the results have shown that the algorithm could be efficiently implemented in a FPGA to be used in runtime systems.

Keywords

C language; field programmable gate arrays; finite state machines; reconfigurable architectures; scheduling; C language; CGRA; FPGA; coarse-grained reconfigurable architecture; execution time; field programmable gate array; finite state machine model; hardware-assisted algorithm; placement problem; problem oriented approach; routing problem; runtime system; scheduling problem; Algorithm design and analysis; Field programmable gate arrays; Hardware; Pipeline processing; Pipelines; Routing; Software; CRGA; FPGA; Placement; Reconfigurable; Routing; Run Time; Scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Systems (WSCAD-SSC), 2012 13th Symposium on

Conference_Location

Petropolis

Print_ISBN

978-1-4673-4468-5

Type

conf

DOI

10.1109/WSCAD-SSC.2012.35

Filename

6391757