544 search results - page 31 / 109 » Can Realistic BitTorrent Experiments Be Performed on Cluster... |
PDP
2010
IEEE
14 years 2 months ago
2010
IEEE
—Two strategies of distribution of computations can be used to implement parallel solvers for dense linear algebra problems for Heterogeneous Computational Clusters of Multicore ...
PVM
2001
Springer
14 years 9 days ago
2001
Springer
Dynamic process management is a much-needed feature for applications and tools development in Beowulf cluster environment. A welldefined and efficient dynamic process management in...
KDD
1999
ACM
14 years 4 days ago
1999
ACM
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
CCGRID
2005
IEEE
14 years 1 months ago
2005
IEEE
Running Data Grid applications such as High Energy Nuclear Physics (HENP) and weather modelling experiments involves working with huge data sets possibly of hundreds of Terabytes ...