Sciweavers

1002 search results - page 135 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
116
Voted
FCCM
2008
IEEE
176views VLSI» more  FCCM 2008»
15 years 2 months ago
The Effectiveness of Configuration Merging in Point-to-Point Networks for Module-based FPGA Reconfiguration
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
Shannon Koh, Oliver Diessel
OOPSLA
2010
Springer
15 years 25 days ago
Parallel inclusion-based points-to analysis
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
Mario Méndez-Lojo, Augustine Mathew, Keshav...
98
Voted
ASPLOS
2006
ACM
15 years 8 months ago
A spatial path scheduling algorithm for EDGE architectures
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
Katherine E. Coons, Xia Chen, Doug Burger, Kathryn...
DC
2011
14 years 2 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 3 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...