Sciweavers

723 search results - page 13 / 145
» Computationally Efficient Transductive Machines
Sort
View
IPPS
1996
IEEE
13 years 11 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
FPL
1994
Springer
435views Hardware» more  FPL 1994»
13 years 11 months ago
Data-Procedural Languages for FPL-based Machines
This paper introduces a new high level programming language for a novel class of computational devices namely data-procedural machines. These machines are by up to several orders o...
Andreas Ast, Jürgen Becker, Reiner W. Hartens...
NPC
2007
Springer
14 years 1 months ago
A Cost-Aware Parallel Workload Allocation Approach Based on Machine Learning Techniques
Parallelism is one of the main sources for performance improvement in modern computing environment, but the efficient exploitation of the available parallelism depends on a number ...
Shun Long, Grigori Fursin, Björn Franke
MST
2000
101views more  MST 2000»
13 years 7 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
ENTCS
2006
136views more  ENTCS 2006»
13 years 7 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand