Sciweavers

20 search results - page 4 / 4
» Optimistic Register Coalescing
Sort
View
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
13 years 9 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
IEEEPACT
2002
IEEE
13 years 9 months ago
Software Bubbles: Using Predication to Compensate for Aliasing in Software Pipelines
This paper describes a technique for utilizing predication to support software pipelining on EPIC architectures in the presence of dynamic memory aliasing. The essential idea is t...
Benjamin Goldberg, Emily Crutcher, Chad Huneycutt,...
INFOCOM
1999
IEEE
13 years 8 months ago
Enhancing Survivability of Mobile Internet Access Using Mobile IP with Location Registers
The Mobile IP (MIP) protocol for IP version 4 provides continuous Internet connectivity to mobile hosts. However, currently it has some drawbacks in the areas of survivability, per...
Ravi Jain, Thomas Raleigh, Danny Yang, Li-Fung Cha...
IEEEPACT
2002
IEEE
13 years 9 months ago
A Framework for Parallelizing Load/Stores on Embedded Processors
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
Xiaotong Zhuang, Santosh Pande, John S. Greenland ...
IEEECIT
2010
IEEE
13 years 2 months ago
Parallel Best Neighborhood Matching Algorithm Implementation on GPU Platform
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Guangyong Zhang, Liqiang He, Yanyan Zhang