Sciweavers

3171 search results - page 180 / 635
» Application of Reduce Order Modeling to Time Parallelization
Sort
View
125
Voted
IPPS
2006
IEEE
15 years 9 months ago
Loosely-coupled loop scheduling in computational grids
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...
123
Voted
ISPDC
2006
IEEE
15 years 9 months ago
Distributed, Real-Time Programming on Commodity POSIX Systems: A Preliminary Report
We present an incipient implementation of a programming language that allows programming of realtime applications distributed over a network. We have several goals in mind: First,...
Stefan D. Bruda, Petter Haggholm, Scott Stoddard
147
Voted
RSA
2000
170views more  RSA 2000»
15 years 3 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
142
Voted
HPCC
2007
Springer
15 years 9 months ago
An Adaptive Parallel Hierarchical Clustering Algorithm
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
Zhaopeng Li, Kenli Li, Degui Xiao, Lei Yang
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 8 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...