540 search results - page 43 / 108 » Scheduling dynamic parallelism on accelerators |
IPPS
1999
IEEE
14 years 23 days ago
1999
IEEE
Executing subordinate activities by pushing return addresses on the stack is the most e cient working mode for sequential programs. It is supported by all current processors, yet i...
CLUSTER
2004
IEEE
14 years 7 days ago
2004
IEEE
Considerable research has focused on the problem of scheduling dynamically arriving independent parallel jobs on a given set of resources. There has also been some recent work in ...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important fe...
PPPJ
2009
ACM
14 years 3 months ago
2009
ACM
Accelerated graphics cards, or Graphics Processing Units (GPUs), have become ubiquitous in recent years. On the right kinds of problems, GPUs greatly surpass CPUs in terms of raw ...
JSSPP
2004
Springer
14 years 1 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...