371 search results - page 11 / 75 » On Centralized Smooth Scheduling |
JSSPP
2005
Springer
15 years 6 months ago
2005
Springer
As grid computing becomes more commonplace, so does the importance of coscheduling these geographically distributed resourcest. Negotiating resource management and scheduling deci...
115
click to vote
JSSPP
2010
Springer
14 years 11 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
127
click to vote
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
116
click to vote
WINET
2010
14 years 11 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
128
click to vote
COMCOM
2007
15 years 1 months ago
2007
IEEE 802.16 employs TDMA (Time Division Multiple Access) as the access method and the policy for selecting scheduled links in a given time slot will definitely impact the system ...