Sciweavers

303 search results - page 40 / 61
» Link-Time Improvement of Scheme Programs
Sort
View
STACS
2009
Springer
14 years 2 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
LCPC
2000
Springer
13 years 11 months ago
Automatic Coarse Grain Task Parallel Processing on SMP Using OpenMP
This paper proposes a simple and efficient implementation method for a hierarchical coarse grain task parallel processing scheme on a SMP machine. OSCAR multigrain parallelizing c...
Hironori Kasahara, Motoki Obata, Kazuhisa Ishizaka
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
SIGSOFT
2004
ACM
14 years 1 months ago
Correlation exploitation in error ranking
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
Ted Kremenek, Ken Ashcraft, Junfeng Yang, Dawson R...
ASPLOS
2011
ACM
12 years 11 months ago
MemScale: active low-power modes for main memory
Main memory is responsible for a large and increasing fraction of the energy consumed by servers. Prior work has focused on exploiting DRAM low-power states to conserve energy. Ho...
Qingyuan Deng, David Meisner, Luiz E. Ramos, Thoma...