Sciweavers

3202 search results - page 468 / 641
» Memory access scheduling
Sort
View
HPCA
1997
IEEE
14 years 11 days ago
Design Issues and Tradeoffs for Write Buffers
Processors with write-through caches typically require a write buffer to hide the write latency to the next level of memory hierarchy and to reduce write traffic. A write buffer ...
Kevin Skadron, Douglas W. Clark
ICPP
1993
IEEE
14 years 8 days ago
Automatic Parallelization Techniques for the EM-4
: This paper presents a Data-Distributed Execution approach that exploits interation-level parallelism in loops operating over arrays. It performs data-dependency analysis, based o...
Lubomir Bic, Mayez A. Al-Mouhamed
DATE
2004
IEEE
134views Hardware» more  DATE 2004»
13 years 12 months ago
Application of a Multi-Processor SoC Platform to High-Speed Packet Forwarding
In this paper, we explore the requirements of emerging complex SoC's and describe StepNP, an experimental flexible, multi-processor SoC platform targeted towards communicatio...
Pierre G. Paulin, Chuck Pilkington, Essaid Bensoud...
EUC
2006
Springer
13 years 11 months ago
Data-Layout Optimization Using Reuse Distance Distribution
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
Xiong Fu, Yu Zhang, Yiyun Chen
ICS
2000
Tsinghua U.
13 years 11 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy