Paper Info
Title
Task scheduling strategies for dynamic reconfigurable processors in distributed systems
Abstract
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.
Year
DOI
Venue
2011
10.1109/HPCSim.2011.5999811
High Performance Computing and Simulation
Keywords
Field
DocType
grid computing,scheduling,EMP,SAP,TeraGrid,application task distribution,area utilization,average scheduling steps,configuration bit stream,distributed grid system,dynamic reconfigurable processor,exact match priority,execution codes,general purpose processor,optional closest match,reconfigurable computing grid,reconfigurable computing resource,reconfiguration time,sufficient-area priority,task scheduling strategy,Distributed systems,Reconfigurable computing,Resource management,Simulation framework,Task scheduling
Fixed-priority pre-emptive scheduling,Grid computing,Fair-share scheduling,Scheduling (computing),Computer science,Dynamic priority scheduling,Control reconfiguration,Grid,Distributed computing,Reconfigurable computing
Conference
ISBN
Citations 
PageRank 
978-1-61284-380-3
2
0.41
References 
Authors
10
4
Name
Order
Citations
PageRank
M. Faisal Nadeem1202.88
S. Arash Ostadzadeh2477.12
Stephan Wong344334.14
Koen Bertels41365138.66