Sciweavers

1095 search results - page 73 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
75
Voted
ADHOC
2010
292views more  ADHOC 2010»
14 years 10 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
DFT
1999
IEEE
125views VLSI» more  DFT 1999»
15 years 2 months ago
Algorithms for Efficient Runtime Fault Recovery on Diverse FPGA Architectures
The inherent redundancy and in-the-field reconfiguration capabilities of field programmable gate arrays (FPGAs) provide alternatives to integrated circuit redundancy-based fault r...
John Lach, William H. Mangione-Smith, Miodrag Potk...
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
15 years 4 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini
CLUSTER
2006
IEEE
15 years 4 months ago
Stochastic Scheduling with Availability Constraints in Heterogeneous Clusters
High availability plays an important role in heterogeneous clusters, where processors operate at different speeds and are not continuously available for processing. Existing sched...
Tao Xie 0004, Xiao Qin
DATE
2004
IEEE
122views Hardware» more  DATE 2004»
15 years 1 months ago
Phase Coupled Code Generation for DSPs Using a Genetic Algorithm
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
Markus Lorenz, Peter Marwedel