3934 search results - page 289 / 787 » Approximate Schedulability Analysis |
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,...
237
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...
276
click to vote
ICS
2007
Tsinghua U.
16 years 24 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...
184
click to vote
JSSPP
2004
Springer
16 years 1 hour ago
2004
Springer
As we continue to evolve into large-scale parallel systems, many of them employing hundreds of computing engines to take on mission-critical roles, it is crucial to design those s...
187
click to vote
COOPIS
2002
IEEE
15 years 11 months ago
2002
IEEE
The proportion of complex distributed real-time embedded (DRE) systems made up of commercial-off-the-shelf (COTS) hardware and software is increasing significantly in response to...