Sciweavers

239 search results - page 33 / 48
» Dynamic Response Time Optimization for SDF Graphs
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
MICRO
1991
IEEE
85views Hardware» more  MICRO 1991»
13 years 11 months ago
Comparing Static and Dynamic Code Scheduling for Multiple-Instruction-Issue Processors
This paper examines two alternative approaches to supporting code scheduling for multiple-instruction-issue processors. One is to provide a set of non-trapping instructions so tha...
Pohua P. Chang, William Y. Chen, Scott A. Mahlke, ...
MICRO
2009
IEEE
134views Hardware» more  MICRO 2009»
14 years 2 months ago
A case for dynamic frequency tuning in on-chip networks
Performance and power are the first order design metrics for Network-on-Chips (NoCs) that have become the de-facto standard in providing scalable communication backbones for mult...
Asit K. Mishra, Reetuparna Das, Soumya Eachempati,...
PDIS
1996
IEEE
13 years 11 months ago
Scrambling Query Plans to Cope With Unexpected Delays
Accessing data from numerous widely-distributed sources poses signi cant new challenges for query optimization and execution. Congestion and failures in the network can introduce ...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
CGO
2011
IEEE
12 years 11 months ago
Dynamically accelerating client-side web applications through decoupled execution
— The emergence and wide adoption of web applications have moved the client-side component, often written in JavaScript, to the forefront of computing on the web. Web application...
Mojtaba Mehrara, Scott A. Mahlke