1257 search results - page 66 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
154
click to vote
ISHPC
2003
Springer
15 years 11 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
183
click to vote
BROADNETS
2006
IEEE
16 years 6 days ago
2006
IEEE
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
172
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
181
click to vote
GRID
2000
Springer
15 years 9 months ago
2000
Springer
Resource management in the typical Grid environment based on multi-MPP systems or clusters today still is one of the challenging problems. We will present MeSch, a solution for the...
186
click to vote
HOTI
2002
IEEE
15 years 11 months ago
2002
IEEE
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Que...