Sciweavers

874 search results - page 15 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 7 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
ESANN
2008
13 years 9 months ago
Survival SVM: a practical scalable algorithm
This work advances the Support Vector Machine (SVM) based approach for predictive modelling of failure time data as proposed in [1]. The main results concern a drastic reduction in...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
IPPS
2006
IEEE
14 years 1 months ago
Multisite co-allocation algorithms for computational grid
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
Weizhe Zhang, A. M. K. Cheng, Mingzeng Hu
EUROPAR
2006
Springer
13 years 11 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom
PODC
1996
ACM
13 years 11 months ago
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
Maged M. Michael, Michael L. Scott