540 search results - page 22 / 108 » Scheduling dynamic parallelism on accelerators |
JSSPP
1997
Springer
13 years 11 months ago
1997
Springer
This paper examinestheimplicationsofgang schedulingfor generalpurpose multiprocessors. The workloads in these environments include both compute-bound parallel jobs, which often re...
JISE
2002
13 years 6 months ago
2002
Load balancing and data locality are the two most important factors in the performance of parallel programs on distributed-memory multiprocessors. A good balancing scheme should e...
IPPS
2006
IEEE
14 years 23 days ago
2006
IEEE
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, concurrent programming methods in distributed systems have not been studi...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
VLIW machines possibly provide the most direct way to exploit instruction level parallelism; however, they cannot be used to emulate current general-purpose instruction set archit...
ICPP
1993
IEEE
13 years 11 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...