Sciweavers

283 search results - page 29 / 57
» A survey of scheduling problems with setup times or costs
Sort
View
JSSPP
2005
Springer
14 years 1 months ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
PERCOM
2007
ACM
14 years 7 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 16 days ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
ICDE
2010
IEEE
186views Database» more  ICDE 2010»
14 years 7 months ago
Mini-Me: A Min-Repro System for Database Software
Testing and debugging database software is often challenging and time consuming. A very arduous task for DB testers is finding a min-repro ? the "simplest possible setup"...
Nicolas Bruno, Rimma V. Nehme
ASPDAC
2005
ACM
146views Hardware» more  ASPDAC 2005»
13 years 9 months ago
High-level synthesis for DSP applications using heterogeneous functional units
Abstract— This paper addresses high level synthesis for realtime digital signal processing (DSP) architectures using heterogeneous functional units (FUs). For such special purpos...
Zili Shao, Qingfeng Zhuge, Chun Xue, Bin Xiao, Edw...