Sciweavers

16844 search results - page 3188 / 3369
» How to Design Programs
Sort
View
CGO
2005
IEEE
16 years 3 days ago
A General Compiler Framework for Speculative Optimizations Using Data Speculative Code Motion
Data speculative optimization refers to code transformations that allow load and store instructions to be moved across potentially dependent memory operations. Existing research w...
Xiaoru Dai, Antonia Zhai, Wei-Chung Hsu, Pen-Chung...
CLUSTER
2005
IEEE
16 years 3 days ago
Supporting iWARP Compatibility and Features for Regular Network Adapters
With several recent initiatives in the protocol offloading technology present on network adapters, the user market is now distributed amongst various technology levels including r...
Pavan Balaji, Hyun-Wook Jin, Karthikeyan Vaidyanat...
CODES
2005
IEEE
16 years 3 days ago
Aggregating processor free time for energy reduction
Even after carefully tuning the memory characteristics to the application properties and the processor speed, during the execution of real applications there are times when the pr...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
CODES
2005
IEEE
16 years 3 days ago
SOMA: a tool for synthesizing and optimizing memory accesses in ASICs
Arbitrary memory dependencies and variable latency memory systems are major obstacles to the synthesis of large-scale ASIC systems in high-level synthesis. This paper presents SOM...
Girish Venkataramani, Tiberiu Chelcea, Seth Copen ...
DSN
2005
IEEE
16 years 3 days ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
« Prev « First page 3188 / 3369 Last » Next »