3 search results - page 1 / 1 » Using Recorded Values for Bounding the Minimum Completion Ti... |
TPDS
1998
13 years 4 months ago
1998
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
APPINF
2003
13 years 6 months ago
2003
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...