Sciweavers

595 search results - page 73 / 119
» The Graph Programming Language GP
Sort
View
CASES
2009
ACM
14 years 3 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
DAGSTUHL
2006
13 years 10 months ago
Rule-based Model Extraction from Source Code
Abstract. In the context of an approach for reengineering legacy software systems at the architectural level, we present in this paper a reverse engineering methodology that uses a...
Rui Correia, Carlos M. P. Matos, Mohammad El-Ramly...
POPL
2003
ACM
14 years 9 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
SCP
1998
112views more  SCP 1998»
13 years 8 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
ICALP
2009
Springer
14 years 9 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald