881 search results - page 26 / 177 » A decentralized task scheduling algorithm and its performanc... |
SIGCOMM
2004
ACM
14 years 1 months ago
2004
ACM
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
TC
2008
13 years 7 months ago
2008
High availability is a key requirement in the design and development of heterogeneous systems, where processors operate at different speeds and are not continuously available for ...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
ICPP
1999
IEEE
13 years 12 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...