Sciweavers

63 search results - page 5 / 13
» Reducing Indirect Function call Overhead in C Programs
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient checkpointing of java software using context-sensitive capture and replay
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
Guoqing Xu, Atanas Rountev, Yan Tang, Feng Qin
IPPS
2006
IEEE
14 years 1 months ago
Algorithmic skeletons for stream programming in embedded heterogeneous parallel image processing applications
Algorithmic skeletons can be used to write architecture independent programs, shielding application developers from the details of a parallel implementation. In this paper, we pre...
Wouter Caarls, Pieter P. Jonker, Henk Corporaal
PLDI
1995
ACM
13 years 11 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove
SAC
2008
ACM
13 years 7 months ago
Automatic software fault localization using generic program invariants
Despite extensive testing in the development phase, residual defects can be a great threat to dependability in the operational phase. This paper studies the utility of lowcost, ge...
Rui Abreu, Alberto González 0002, Peter Zoe...