Sciweavers

76 search results - page 7 / 16
» Reconfigurable Gang Scheduling Algorithm
Sort
View
CODES
2008
IEEE
13 years 8 months ago
Guaranteed scheduling for repetitive hard real-time tasks under the maximal temperature constraint
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show th...
Gang Quan, Yan Zhang, William Wiles, Pei Pei
GLOBECOM
2009
IEEE
13 years 10 months ago
Frame-Scheduling for Input-Queued Switches with Energy Reconfiguration Costs
We consider a slotted input-queued switch with a crossbar-like switching fabric. In each time-slot, a centralized scheduler determines a switching fabric configuration to transfer ...
Andrea Bianco, Paolo Giaccone, Marco Ricca
FPL
2001
Springer
123views Hardware» more  FPL 2001»
13 years 11 months ago
Compilation Increasing the Scheduling Scope for Multi-memory-FPGA-Based Custom Computing Machines
This paper presents new achievements on the automatic mapping of algorithms, written in imperative software programming languages, to custom computing machines. The reconfigurable ...
João M. P. Cardoso, Horácio C. Neto
ICCAD
2002
IEEE
103views Hardware» more  ICCAD 2002»
14 years 3 months ago
A realistic variable voltage scheduling model for real-time applications
Voltage scheduling is indispensable for exploiting the benefit of variable voltage processors. Though extensive research has been done in this area, current processor limitations...
Bren Mochocki, Xiaobo Sharon Hu, Gang Quan
RTS
2011
123views more  RTS 2011»
13 years 1 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna