321 search results - page 34 / 65 » Implementing Randomized Matrix Algorithms in Parallel and Di... |
160
Voted
ISPAN
2002
IEEE
15 years 7 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
103
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
108
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Mobile entity navigation in dynamic environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the ...
109
Voted
HPDC
2002
IEEE
15 years 7 months ago
2002
IEEE
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
102
Voted
CCGRID
2004
IEEE
15 years 6 months ago
2004
IEEE
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...