Sciweavers

461 search results - page 51 / 93
» Verifying parallel programs with dynamic communication struc...
Sort
View
TPDS
1998
98views more  TPDS 1998»
13 years 7 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
PC
2006
96views Management» more  PC 2006»
13 years 7 months ago
Modeling Master/Worker applications for automatic performance tuning
Parallel application development is a very difficult task for non-expert programmers, and therefore support tools are needed for all phases of this kind of application development...
Eduardo César, Andreu Moreno, Joan Sorribes...
CCGRID
2004
IEEE
13 years 11 months ago
High performance LU factorization for non-dedicated clusters
This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing re...
Toshio Endo, Kenji Kaneda, Kenjiro Taura, Akinori ...
ICPP
2007
IEEE
14 years 1 months ago
Toward Automatic Data Distribution for Migrating Computations
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Di...
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
14 years 7 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua