2355 search results - page 347 / 471 » Scheduling in the Z-Polyhedral Model |
211
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—In this paper, we address a new unexplored problem - what are the optimal patterns to achieve connected coverage in wireless networks with directional antennas. As their name im...
168
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
181
click to vote
CCGRID
2005
IEEE
16 years 14 days ago
2005
IEEE
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
178
click to vote
MICRO
2005
IEEE
16 years 13 days ago
2005
IEEE
We introduce techniques to support efficient non-atomic execution of very long traces on a new binary translation based, x86-64 compatible VLIW microprocessor. Incrementally comm...
173
Voted
OTM
2005
Springer
16 years 10 days ago
2005
Springer
Timeliness in conventional real-time systems is addressed by employing well-known scheduling techniques that guarantee the execution of a number of tasks within certain deadlines. ...