Sciweavers

2429 search results - page 287 / 486
» Toposemantic Network Clustering
Sort
View
PPOPP
2003
ACM
15 years 11 months ago
CC-MPI: a compiled communication capable MPI prototype for ethernet switched clusters
Compiled communication has recently been proposed to improve communication performance for clusters of workstations. The idea of compiled communication is to apply more aggressive...
Amit Karwande, Xin Yuan, David K. Lowenthal
ICCSA
2003
Springer
15 years 11 months ago
Parallel CLUSTAL W for PC Clusters
This paper presents a parallel version of CLUSTAL W, called pCLUSTAL. In contrast to the commercial SGI parallel Clustal, which requires an expensive shared memory SGI multiprocess...
James Cheetham, Frank K. H. A. Dehne, Sylvain Pitr...
ICPP
2002
IEEE
15 years 11 months ago
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
Xiaobo Zhou, Cheng-Zhong Xu
IPPS
2009
IEEE
16 years 1 months ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl