Sciweavers

363 search results - page 15 / 73
» Optimizing Memory Accesses For Spatial Computation
Sort
View
CC
2003
Springer
192views System Software» more  CC 2003»
14 years 27 days ago
Address Register Assignment for Reducing Code Size
Abstract. In DSP processors, minimizing the amount of address calculations is critical for reducing code size and improving performance since studies of programs have shown that in...
Mahmut T. Kandemir, Mary Jane Irwin, Guilin Chen, ...
IPPS
2010
IEEE
13 years 5 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá
SPAA
2010
ACM
14 years 15 days ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
IWCMC
2006
ACM
14 years 1 months ago
Bounds on the fading number of multiple-input single-output fading channels with memory
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
Stefan M. Moser
IPPS
2005
IEEE
14 years 1 months ago
A Cost-Effective Main Memory Organization for Future Servers
Today, the amount of main memory in mid-range servers is pushing practical limits with as much as 192 GB memory in a 24 processor system [21]. Further, with the onset of multi-thr...
Magnus Ekman, Per Stenström