2438 search results - page 71 / 488 » Scheduling problems for parallel and distributed systems |
147
click to vote
PAMI
2011
14 years 11 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
143
click to vote
ICPADS
2006
IEEE
15 years 10 months ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
145
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
The rapid progress in high-performance microprocessor design has made it di cult to adapt real-time scheduling results to new models of microprocessor hardware, thus leaving an un...
117
Voted
LCPC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during par...
142
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...