Sciweavers

2355 search results - page 102 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
MOBIHOC
2012
ACM
12 years 16 days ago
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
Peng-Jun Wan, XiaoHua Xu, Zhu Wang, ShaoJie Tang, ...
QSHINE
2009
IEEE
14 years 4 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
CPAIOR
2009
Springer
14 years 4 months ago
Sequencing and Counting with the multicost-regular Constraint
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
Julien Menana, Sophie Demassey
EMSOFT
2005
Springer
14 years 3 months ago
Communication strategies for shared-bus embedded multiprocessors
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
Neal K. Bambha, Shuvra S. Bhattacharyya
GLVLSI
2002
IEEE
98views VLSI» more  GLVLSI 2002»
14 years 3 months ago
Minimizing concurrent test time in SoC's by balancing resource usage
We present a novel test scheduling algorithm for embedded corebased SoC’s. Given a system integrated with a set of cores and a set of test resources, we select a test for each c...
Dan Zhao, Shambhu J. Upadhyaya, Martin Margala