Sciweavers

202 search results - page 15 / 41
» Complexity of Collective Communications on NoCs
Sort
View
JASIS
2007
122views more  JASIS 2007»
13 years 7 months ago
Exploiting parallelism to support scalable hierarchical clustering
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
Rebecca Cathey, Eric C. Jensen, Steven M. Beitzel,...
IPPS
2000
IEEE
13 years 11 months ago
Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
Yuanyuan Yang, Jianchao Wang
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 26 days ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
FSTTCS
2010
Springer
13 years 5 months ago
Global Escape in Multiparty Sessions
Abstract. This paper proposes a global escape mechanism which can handle unexpected or unwanted conditions changing the default execution of distributed communicational flows, pres...
Sara Capecchi, Elena Giachino, Nobuko Yoshida
GCC
2007
Springer
14 years 1 months ago
Improving the Performance of MPI Applications over Computational Grid
The Message Passing Interface (MPI) is a standard in parallel computing, and can also be used as a highperformance programming model for Grid application development. How to execu...
Bo Song, Guangwen Yang, Qiming Fang