Sciweavers

1550 search results - page 56 / 310
» Benchmarking for Graph Transformation
Sort
View
ISPD
2005
ACM
153views Hardware» more  ISPD 2005»
14 years 4 months ago
Evaluation of placer suboptimality via zero-change netlist transformations
In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formal...
Andrew B. Kahng, Sherief Reda
ICDE
2009
IEEE
121views Database» more  ICDE 2009»
15 years 22 days ago
Holistic Query Transformations for Dynamic Web Applications
A promising approach to scaling Web applications is to distribute the server infrastructure on which they run. This approach, unfortunately, can introduce latency between the appl...
Amit Manjhi, Charles Garrod, Bruce M. Maggs, Todd ...
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
14 years 3 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
POPL
1997
ACM
14 years 3 months ago
Synchronization Transformations for Parallel Computing
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
Pedro C. Diniz, Martin C. Rinard
ICS
2000
Tsinghua U.
14 years 2 months ago
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop ...
Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali