Sciweavers

116 search results - page 7 / 24
» Loop-Carried Code Placement
Sort
View
ACL
1997
13 years 10 months ago
Learning Features that Predict Cue Usage
Our goal is to identify the features that predict the occurrence and placement of discourse cues in tutorial explanations in order to aid in the automatic generation of explanatio...
Barbara Di Eugenio, Johanna D. Moore, Massimo Paol...
VLSID
2009
IEEE
96views VLSI» more  VLSID 2009»
14 years 9 months ago
Efficient Placement of Compressed Code for Parallel Decompression
Code compression is important in embedded systems design since it reduces the code size (memory requirement) and thereby improves overall area, power and performance. Existing res...
Xiaoke Qin, Prabhat Mishra
PAAPP
2002
76views more  PAAPP 2002»
13 years 8 months ago
Performance of PDE solvers on a self-optimizing NUMA architecture
Abstract. The performance of shared-memory (OpenMP) implementations of three different PDE solver kernels representing finite difference methods, finite volume methods, and spectra...
Sverker Holmgren, Markus Nordén, Jarmo Rant...
TC
2002
13 years 8 months ago
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimen...
Krishnendu Chakrabarty, S. Sitharama Iyengar, Hair...
ICCAD
2005
IEEE
130views Hardware» more  ICCAD 2005»
14 years 5 months ago
A cache-defect-aware code placement algorithm for improving the performance of processors
— Yield improvement through exploiting fault-free sections of defective chips is a well-known technique [1][2]. The idea is to partition the circuitry of a chip in a way that fau...
Tohru Ishihara, Farzan Fallah