By Topic

Task scheduling strategies for dynamic reconfigurable processors in distributed systems

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
$31 $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)
Nadeem, M.F. ; Comput. Eng. Lab., Delft Univ. of Technol., Delft, Netherlands ; Ostadzadeh, S.A. ; Wong, S. ; Bertels, K.

Reconfigurable processors in distributed grid systems can potentially offer enhanced performance along with flexibility. Therefore, grid systems, such as TeraGrid, are utilizing reconfigurable computing resources next to general purpose processors (GPPs) in their computing nodes. In general, the application task scheduling largely affects the near-optimal performance of resources in distributed grid systems. The inclusion of reconfigurable nodes in such systems requires to take into account reconfigurable hardware characteristics, such as, area utilization, reconfiguration time, and time to communicate configuration bit streams, execution codes, and data. Generally, many of these characteristics are not taken into account by traditional task scheduling systems in distributed grids. In this paper, we present a simulation framework for application task distribution among different nodes of a reconfigurable computing grid. Furthermore, we propose three different task scheduling strategies, namely Optional Closest Match (OCM), Exact Match Priority (EMP), and Sufficient-Area Priority (SAP). The simulation results are presented based on the average scheduling steps required by the scheduler to accommodate each task, the total scheduler workload, and the average waiting time per task. We compare the impacts of the three scheduling strategies on these metrics. In addition, we present a thorough discussion of the results. In particular, the results show that the two key metrics average scheduling steps per task and average waiting time per task are reduced for the EMP and the SAP when compared to the OCM.

Published in:

High Performance Computing and Simulation (HPCS), 2011 International Conference on

Date of Conference:

4-8 July 2011