Sciweavers

1003 search results - page 97 / 201
» How to Parallelize Sequential Processes
Sort
View
EUROPAR
2007
Springer
14 years 3 months ago
Fine Tuning Algorithmic Skeletons
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
Denis Caromel, Mario Leyton
CLUSTER
2006
IEEE
14 years 2 months ago
Resource Management for Interactive Jobs in a Grid Environment
1 Most recent Grid middleware technologies have been aimed at the execution of sequential batch jobs. However, some users require interactive access when running jobs on Grid sites...
Enol Fernández, Elisa Heymann, Miquel A. Se...
HPCA
1999
IEEE
14 years 1 months ago
Using Lamport Clocks to Reason about Relaxed Memory Models
Cache coherence protocols of current shared-memory multiprocessors are difficult to verify. Our previous work proposed an extension of Lamport's logical clocks for showing th...
Anne Condon, Mark D. Hill, Manoj Plakal, Daniel J....
TPDS
2010
144views more  TPDS 2010»
13 years 7 months ago
Performance Evaluation of Dynamic Speculative Multithreading with the Cascadia Architecture
—Thread-level parallelism (TLP) has been extensively studied in order to overcome the limitations of exploiting instruction-level parallelism (ILP) on high-performance superscala...
David A. Zier, Ben Lee
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 6 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud