Sciweavers

821 search results - page 4 / 165
» Addressing the Petersen graph
Sort
View
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
15 years 1 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
15 years 1 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik
SIGCOMM
2010
ACM
14 years 9 months ago
Generic and automatic address configuration for data center networks
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
Kai Chen, Chuanxiong Guo, Haitao Wu, Jing Yuan, Zh...
ICASSP
2008
IEEE
15 years 3 months ago
Address assignment sensitive variable partitioning and scheduling for DSPS with multiple memory banks
Multiple memory banks design is employed in many high performance DSP processors. This architectural feature supports higher memory bandwidth by allowing multiple data memory acce...
Chun Jason Xue, Tiantian Liu, Zili Shao, Jingtong ...
ICCS
2004
Springer
15 years 2 months ago
Predicting MPI Buffer Addresses
Communication latencies have been identified as one of the performance limiting factors of message passing applications in clusters of workstations/multiprocessors. On the receiver...
Felix Freitag, Montse Farreras, Toni Cortes, Jes&u...