Spatio-Temporal Scheduling for 3D Reconfigurable \& Multiprocessor Architecture - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Spatio-Temporal Scheduling for 3D Reconfigurable \& Multiprocessor Architecture

(1) , (1) , (1) , (1)
1

Abstract

This article proposes a spatio-temporal schedul- ing algorithm for a three-dimensional integrated circuits (3D ICs) defined by stacking an homogeneous embedded Field- Programmable Gate Array (eFPGA) above an homogenous Chip MultiProcessor (CMP) layer over through-silicon vias (TSVs) connection. Our proposal, based on Proportionate-fair (Pfair) algorithm, computes the spatio-temporal scheduling of hardware tasks on the reconfigurable resources by taking into account the communication between tasks and then places the associated software tasks on the multiprocessors layer. Compared to the "equivalent" solutions produced by the recursive Branch and Bound (BB) algorithm, our proposal shows up to 14,5% communication cost reduction.
Not file

Dates and versions

hal-00753902 , version 1 (19-11-2012)

Identifiers

  • HAL Id : hal-00753902 , version 1

Cite

Quang Hai Khuat, Quang Hoa Le, Daniel Chillet, Sébastien Pillement. Spatio-Temporal Scheduling for 3D Reconfigurable \& Multiprocessor Architecture. International Design and Test Symposium, IDT 2012, University at Qatar, Dec 2012, Doha, Qatar. ⟨hal-00753902⟩
151 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More