138 search results - page 3 / 28 » A Parallel Branch-and-Bound Algorithm for Computing Optimal ... |
EUROPAR
2007
Springer
13 years 11 months ago
2007
Springer
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
IPPS
1997
IEEE
13 years 9 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
SAC
2005
ACM
13 years 10 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
TPDS
1998
13 years 4 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...