By Topic

Partition Based Dynamic 2D HW Multitasking Management

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. Roman ; Universidad Complutense de Madrid, Spain ; H. Mecha ; D. Mozos ; J. Septien

The design of computing systems is facing an interesting challenge with the opportunity to include runtime reconfigurable (RTR) devices in them. Operating systems (OS) need to be extended with functionalities that allow to efficiently manage such devices. We present a simple and fast algorithm for the management of FPGA area in a general-purpose computing system with hardware multitasking. It divides the device area into four partitions with different sizes. Each partition has an associated queue where the hardware manager places each arriving task depending on its size, shape and deadline requirements. Rectangular tasks may be rotated when necessary, and partition merging done if needed for tasks not fitting any partition. The queue selection criterium and the size of the partitions may be changed during run-time in order to adapt algorithm behaviour to different circumstances. This is a constant complexity algorithm and we will show experimental results that prove it may compete in performance with other algorithms

Published in:

9th EUROMICRO Conference on Digital System Design (DSD'06)

Date of Conference:

0-0 0