Sciweavers

2563 search results - page 182 / 513
» Parallel matrix algorithms and applications
Sort
View
ISCAPDCS
2007
15 years 5 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
ICPP
1995
IEEE
15 years 7 months ago
Fusion of Loops for Parallelism and Locality
Loop fusion improves data locality and reduces synchronization in data-parallel applications. However, loop fusion is not always legal. Even when legal, fusion may introduce loop-...
Naraig Manjikian, Tarek S. Abdelrahman
ICPP
2005
IEEE
15 years 9 months ago
A Task Duplication Based Scheduling Algorithm Using Partial Schedules
We propose a novel replication-based two-phase scheduling algorithm designed to achieve DAG scheduling with small makespans and high efficiency. In the first phase, the schedule...
Doruk Bozdag, Füsun Özgüner, Eylem ...
PPSN
2004
Springer
15 years 9 months ago
Statistical Racing Techniques for Improved Empirical Evaluation of Evolutionary Algorithms
In empirical studies of Evolutionary Algorithms, it is usually desirable to evaluate and compare algorithms using as many different parameter settings and test problems as possible...
Bo Yuan, Marcus Gallagher
ICPP
1992
IEEE
15 years 8 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss