Sciweavers

443 search results - page 7 / 89
» Analysis of Heuristics for Number Partitioning
Sort
View
TPDS
2002
136views more  TPDS 2002»
13 years 7 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
DATE
2010
IEEE
111views Hardware» more  DATE 2010»
14 years 19 days ago
Evaluation of runtime task mapping heuristics with rSesame - a case study
Abstract—rSesame is a generic modeling and simulation framework which can explore and evaluate reconfigurable systems at the early design stages. The framework can be used to ex...
Kamana Sigdel, Mark Thompson, Carlo Galuzzi, Andy ...
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
14 years 25 days ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
CC
2007
Springer
126views System Software» more  CC 2007»
14 years 1 months ago
An Array Allocation Scheme for Energy Reduction in Partitioned Memory Architectures
This paper presents a compiler technique that reduces the energy consumption of the memory subsystem, for an off-chip partitioned memory architecture having multiple memory banks ...
K. Shyam, R. Govindarajan
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 7 months ago
Evolutionary Mesh Numbering: Preliminary Results
Abstract. Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This pa...
Francis Sourd, Marc Schoenauer