5683 search results - page 233 / 1137 » Interactive Schedulability Analysis |
185
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
173
click to vote
SCHEDULING
2008
15 years 6 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
235
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
185
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
276
click to vote
ICS
2007
Tsinghua U.
16 years 22 days ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...