310 search results - page 27 / 62 » A Parallel Genetic Algorithm for Task Mapping on Parallel Ma... |
CLOUDCOM
2009
Springer
13 years 11 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
CAMP
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper describes the mapping of a recently introduced template matching algorithm based on the Normalized Cross Correlation (NCC) on a general purpose processor endowed wit...
PC
1998
13 years 7 months ago
1998
The difficulty of handling out-of-core data limits the performance of supercomputers as well as the potential of the parallel machines. Since writing an efficient out-of-core ve...