Sciweavers

232 search results - page 8 / 47
» On Characterizing the Data Access Complexity of Programs
Sort
View
ISCA
1999
IEEE
110views Hardware» more  ISCA 1999»
15 years 2 months ago
Decoupling Local Variable Accesses in a Wide-Issue Superscalar Processor
Providing adequate data bandwidth is extremely important for a wide-issue superscalar processor to achieve its full performance potential. Adding a large number of ports to a data...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee
TVLSI
2002
98views more  TVLSI 2002»
14 years 10 months ago
Minimizing memory access energy in embedded systems by selective instruction compression
We propose a technique for reducing the energy spent in the memory-processor interface of an embedded system during the execution of firmware code. The method is based on the idea ...
Luca Benini, Alberto Macii, Enrico Macii, Massimo ...
CCGRID
2007
IEEE
15 years 5 months ago
Revisit of View-Oriented Parallel Programming
Traditional parallel programming styles have many problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers...
Z. Huang, W. Chen
PADL
2010
Springer
15 years 7 months ago
Skeleton Composition Using Remote Data
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
Mischa Dieterle, Thomas Horstmeyer, Rita Loogen
VLDB
2003
ACM
141views Database» more  VLDB 2003»
15 years 11 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li