Sciweavers

2703 search results - page 523 / 541
» Optimizing memory transactions
Sort
View
QSHINE
2005
IEEE
14 years 3 months ago
Retransmission Strategies for Wireless Connections with Resource-Limited Devices
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
Lavy Libman
PLDI
2005
ACM
14 years 3 months ago
Demystifying on-the-fly spill code
Modulo scheduling is an effective code generation technique that exploits the parallelism in program loops by overlapping iterations. One drawback of this optimization is that reg...
Alex Aletà, Josep M. Codina, Antonio Gonz&a...
AADEBUG
2005
Springer
14 years 3 months ago
Tdb: a source-level debugger for dynamically translated programs
Debugging techniques have evolved over the years in response to changes in programming languages, implementation techniques, and user needs. A new type of implementation vehicle f...
Naveen Kumar, Bruce R. Childers, Mary Lou Soffa
ICALP
2005
Springer
14 years 3 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
OOPSLA
2005
Springer
14 years 3 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...