1257 search results - page 204 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
JSSPP
2007
Springer
15 years 4 months ago
2007
Springer
Current resource managers do not have adequate node allocation and distribution strategies to efficiently schedule jobs on multi-core multi-threaded systems. Clusters composed of ...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
PVM
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...