Sciweavers

4670 search results - page 671 / 934
» Testing that distributions are close
Sort
View
ISHPC
1999
Springer
15 years 11 months ago
Dynamically Adaptive Parallel Programs
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
Michael Voss, Rudolf Eigenmann
IEEEPACT
1998
IEEE
15 years 11 months ago
Efficient Methods for Multi-Dimensional Array Redistribution
In this paper, we present efficient methods for multidimensional array redistribution. Based on the previous work, the basic-cycle calculation technique, we present a basic-block ...
Yeh-Ching Chung, Ching-Hsien Hsu
SCALESPACE
1999
Springer
15 years 11 months ago
Fast Marching to Moving Object Location
In this paper we address two important problems in motion analysis: the detection of moving objects and their localization. Statistical and level set approaches are adopted in orde...
Eftychios Sifakis, George Tziritas
IPPS
1998
IEEE
15 years 11 months ago
Optimizing Parallel Applications for Wide-Area Clusters
Recent developments in networking technology cause a growing interest in connecting local-area clusters of workstations over wide-area links, creating multilevel clusters, or meta...
Henri E. Bal, Aske Plaat, Mirjam G. Bakker, Peter ...
IPPS
1998
IEEE
15 years 11 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser