Sciweavers

5640 search results - page 576 / 1128
» Parallelizing the Data Cube
Sort
View
IPPS
1996
IEEE
15 years 8 months ago
Maximizing Speedup through Self-Tuning of Processor Allocation
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
Thu D. Nguyen, Raj Vaswani, John Zahorjan
120
Voted
CCGRID
2004
IEEE
15 years 8 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 ...
PDP
1995
IEEE
15 years 8 months ago
Iterated Runge-Kutta methods on distributed memory multiprocessors
We investigate the parallel implementation of the diagonal{implicitly iterated Runge{ Kutta (DIIRK) method, an iteration method based on a predictor{corrector scheme. This method ...
Thomas Rauber, Gudula Rünger
154
Voted
IFIP12
2008
15 years 6 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
EOR
2008
52views more  EOR 2008»
15 years 4 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao