Title
A left-edge algorithm approach for scheduling and allocation of hardware contexts in dynamically reconfigurable architectures
Abstract
This work aims to describe a methodology for scheduling and allocation of hardware contexts, in applications with high degree of parallelism, in a Run-Time-Reconfiguration (RTR) proceeding for a reconfigurable FPGA. The Scheduling approach is based on the hardware resource distribution in the FPGA architecture. The Scheduler is modeled as a Petri Net and the best performance yields the best scheduling. The hardware contexts allocation is based on a Left-Edge algorithm principle for rationalization of resources in scheduling approach. The adaptation of the algorithm considers that pre-located areas for loading of the contexts in the architecture are used.
Year
DOI
Venue
2004
10.1145/968280.968355
FPGA
Keywords
Field
DocType
petri net,reactions,cell,simulation,reconfigurable hardware,biology
Petri net,Degree of parallelism,Scheduling (computing),Computer science,Real-time computing,Computer hardware,Distributed computing,Architecture,Fair-share scheduling,Parallel computing,Field-programmable gate array,Algorithm,Dynamic priority scheduling,Reconfigurable computing
Conference
ISBN
Citations 
PageRank 
1-58113-829-6
2
0.39
References 
Authors
1
3