Sciweavers

2976 search results - page 212 / 596
» On the bounded integer programming
Sort
View
RTCSA
2009
IEEE
16 years 1 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
CISS
2007
IEEE
16 years 25 days ago
Bounding A Statistical Measure Of Network Lifetime For Wireless Sensor Networks
—The inherent many-to-one flow of traffic in Wireless Sensor Networks produces a skewed distribution of energy consumption rates leading to the early demise of those sensors that...
Muhammad Usman Ilyas, Hayder Radha
SPAA
2009
ACM
15 years 11 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
RTAS
1998
IEEE
15 years 10 months ago
Bounding Loop Iterations for Timing Analysis
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
Christopher A. Healy, Mikael Sjödin, Viresh R...
FPL
2006
Springer
113views Hardware» more  FPL 2006»
15 years 10 months ago
A Novel Heuristic and Provable Bounds for Reconfigurable Architecture Design
This paper is concerned with the application of formal optimisation methods to the design of mixed-granularity FPGAs. In particular, we investigate the appropriate mix and floorpl...
Alastair M. Smith, George A. Constantinides, Peter...