Constant complexity scheduling for hardware multitasking in two dimensional reconfigurable field-programmable gate arrays

Roman, Sara; Mecha, Hortensia; Mozos, Daniel; Septién, J.

doi:10.1049/iet-cdt:20070060

Cited by 10 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…al. [7] presented Constant complexity scheduling for hardware multitasking in two dimensional reconfigurable field-programmable gate arrays which described the need of extending operating system to manage the FPGAs. An algorithm has been presented which decides the scheduling and placing of arrival tasks with real time constraints, like deadline, in FPGA device.…”

Section: Literature Surveymentioning

confidence: 99%

Comparative Study of Scheduling Algorithms for Real Time Environment

Khera¹,

Kakkar²

2012

IJCA

View full text Add to dashboard Cite

ABSTRACT:Scheduling is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but also on the time at which results are produced. Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in a real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters. Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done. The various issues have been presented on which there is still a need to work.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Comparative Study of Scheduling Algorithms for Real Time Environment

Khera¹,

Kakkar²

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…present interesting techniques to deal with task allocation in an FPGA that is being used for HW multitasking, but all of them neglect the fact that reconfiguration in present day FPGAs is a key aspect to make hardware multitasking effective. Another very interesting approach is presented in [9] which deals with the online problem of 2D task scheduling.…”

Section: State Of the Artmentioning

confidence: 99%

Reconfiguration Strategies for Online Hardware Multitasking in Embedded Systems

Elez¹

2012

CSEIJ

View full text Add to dashboard Cite

show abstract

“…Second category of the recent work such as [12][13][14][15][16][17][18][19][20] address on-line scheduling in RC systems. Some of these studies such as [13] focuses on real-time and preemptive tasks.…”

Section: Related Workmentioning

confidence: 99%

“…They define alignment status of the free space segments and use it to make the correct decision on task placement position in order to maximize the free space area. In another work [20] , Roman et al have proposed a technique in which FPGA area is divided into four partitions of different sizes. Each partition has an associated queue where the hardware manager places each arriving task depending on its size, shape and real-time parameters as deadline.…”

Section: Related Workmentioning

confidence: 99%

Configuration Reusing in On-Line Task Scheduling for Reconfigurable Computing Systems

Bassiri

Shahhoseini

2011

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Reconfigurable computing systems can be reconfigured at runtime and support partial reconfigurability which makes us able to execute tasks in a true multitasking manner. To manage such systems at runtime, a reconfigurable operating system is needed. The main part of this operating system is resource management unit which performs on-line scheduling and placement of hardware tasks at runtime. Reconfiguration overhead is an important obstacle that limits the performance of on-line scheduling algorithms in reconfigurable computing systems and increases the overall execution time. Configuration reusing (task reusing) can decrease reconfiguration overhead considerably, particularly in periodic applications or the applications in which the probability of tasks recurrence is high. In this paper, we present a technique called reusing-based scheduling (RBS), for on-line scheduling and placement in which configuration reusing is considered as a main characteristic in order to reduce reconfiguration overhead and decrease total execution time of the tasks. Several experiments have been conducted on the proposed algorithm. Obtained results show considerable improvement in overall execution time of the tasks.

show abstract

Constant complexity scheduling for hardware multitasking in two dimensional reconfigurable field-programmable gate arrays

Cited by 10 publications

References 7 publications

Comparative Study of Scheduling Algorithms for Real Time Environment

Comparative Study of Scheduling Algorithms for Real Time Environment

Reconfiguration Strategies for Online Hardware Multitasking in Embedded Systems

Configuration Reusing in On-Line Task Scheduling for Reconfigurable Computing Systems

Contact Info

Product

Resources

About