Sciweavers

273 search results - page 33 / 55
» Improving program slicing with dynamic points-to data
Sort
View
CSMR
2007
IEEE
15 years 4 months ago
The Dynamic Function Coupling Metric and Its Use in Software Evolution
Many of the existing techniques for impact set computation in change propagation and regression testing are approximate for the sake of efficiency. A way to improve precision is ...
Árpád Beszédes, Tamás ...
ICDCS
2003
IEEE
15 years 2 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
ISCA
2003
IEEE
88views Hardware» more  ISCA 2003»
15 years 2 months ago
Dynamically Managing the Communication-Parallelism Trade-off in Future Clustered Processors
Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-d...
Rajeev Balasubramonian, Sandhya Dwarkadas, David H...
CLUSTER
2011
IEEE
13 years 9 months ago
Exploring Fine-Grained Task-Based Execution on Multi-GPU Systems
Using multi-GPU systems, including GPU clusters, is gaining popularity in scientific computing. However, when using multiple GPUs concurrently, the conventional data parallel GPU...
Long Chen, Oreste Villa, Guang R. Gao
RECOMB
2005
Springer
15 years 10 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...