Sciweavers

3047 search results - page 207 / 610
» Randomized Parallel Selection
Sort
View
102
Voted
OTM
2007
Springer
15 years 5 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
PDP
2010
IEEE
15 years 3 months ago
Malleable-Lab: A Tool for Evaluating Adaptive Online Schedulers on Malleable Jobs
—The emergence of multi-core computers has led to explosive development of parallel applications and hence the need of efficient schedulers for parallel jobs. Adaptive online sc...
Yangjie Cao, Hongyang Sun, Wen-Jing Hsu, Depei Qia...
SIAMSC
2010
120views more  SIAMSC 2010»
14 years 9 months ago
Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers
The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of ...
Murat Manguoglu, Mehmet Koyutürk, Ahmed H. Sa...
PPOPP
2010
ACM
15 years 5 months ago
Thread to strand binding of parallel network applications in massive multi-threaded systems
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
Petar Radojkovic, Vladimir Cakarevic, Javier Verd&...
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 3 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla