1257 search results - page 172 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
110
click to vote
ICPADS
2010
IEEE
14 years 8 months ago
2010
IEEE
To fully tap into the potential of heterogeneous machines composed of multicore processors and multiple accelerators, simple offloading approaches in which the main trunk of the ap...
MOBIHOC
2009
ACM
15 years 10 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...
101
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—The design of optimal opportunistic multicast scheduling (OMS) that maximizes the throughput of cellular networks is investigated. In a cellular network, the base station (BS) t...
CLUSTER
2005
IEEE
15 years 3 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
TC
2010
14 years 4 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...