Sciweavers

6939 search results - page 64 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
SIAMSC
2008
129views more  SIAMSC 2008»
13 years 8 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
OTM
2007
Springer
14 years 2 months ago
Parallelizing Tableaux-Based Description Logic Reasoning
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
Thorsten Liebig, Felix Müller
IPPS
1999
IEEE
14 years 10 days ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun
JPDC
2006
134views more  JPDC 2006»
13 years 8 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ARCS
2006
Springer
13 years 11 months ago
The Robustness of Resource Allocations in Parallel and Distributed Computing Systems
This corresponds to the material in the invited keynote presentation by H. J. Siegel, summarizing the research in [2, 23]. Resource allocation decisions in heterogeneous parallel a...
Vladimir Shestak, Howard Jay Siegel, Anthony A. Ma...