Sciweavers

341 search results - page 32 / 69
» Redundancy elimination revisited
Sort
View
ICCL
1998
IEEE
14 years 1 months ago
Loop Optimization for Aggregate Array Computations
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
Yanhong A. Liu, Scott D. Stoller
ICPP
1998
IEEE
14 years 1 months ago
Supporting Software Distributed Shared Memory with an Optimizing Compiler
To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as pos...
Tatsushi Inagaki, Junpei Niwa, Takashi Matsumoto, ...
SIGMOD
1997
ACM
113views Database» more  SIGMOD 1997»
14 years 11 days ago
Size Separation Spatial Join
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
Nick Koudas, Kenneth C. Sevcik
MM
1995
ACM
100views Multimedia» more  MM 1995»
14 years 11 days ago
Fast Lossy Internet Image Transmission
Images are usually transmitted across the Internet using a lossless protocol such as TCP/IP. Lossless protocols require retransmission of lost packets, which substantially increas...
John M. Danskin, Geoffrey M. Davis, Xiyong Song
ASPLOS
2008
ACM
13 years 10 months ago
SoftSig: software-exposed hardware signatures for code analysis and optimization
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
James Tuck, Wonsun Ahn, Luis Ceze, Josep Torrellas