Sciweavers

1024 search results - page 29 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
SIMUTOOLS
2008
13 years 10 months ago
Transforming sources to petri nets: a way to analyze execution of parallel programs
Model checking is a suitable formal technique to analyze parallel programs' execution in an industrial context because automated tools can be designed and operated with very ...
Jean-Baptiste Voron, Fabrice Kordon
DAC
2002
ACM
14 years 9 months ago
An integer linear programming based approach for parallelizing applications in On-chip multiprocessors
With energy consumption becoming one of the first-class optimization parameters in computer system design, compilation techniques that consider performance and energy simultaneous...
Ismail Kadayif, Mahmut T. Kandemir, Ugur Sezer
ICVS
2001
Springer
14 years 1 months ago
Compiling SA-C Programs to FPGAs: Performance Results
Abstract. At the first ICVS, we presented SA-C (“sassy”), a singleassignment variant of the C programming language designed to exploit both coarse-grain and fine-grain parallel...
Bruce A. Draper, A. P. Wim Böhm, Jeffrey Hamm...
CORR
2009
Springer
74views Education» more  CORR 2009»
13 years 6 months ago
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kul...
DDEP
2000
Springer
14 years 1 months ago
A Link-Oriented Comparison of Hyperdocuments and Programs
There are parallels between the construction of programs and the construction of hypertexts, and in ar between the abstractions available to the application programmer and those a...
Heather Brown, Peter J. Brown, Les Carr, Wendy Hal...