Sciweavers

716 search results - page 17 / 144
» Semilinear Program Feasibility
Sort
View
DATE
2010
IEEE
183views Hardware» more  DATE 2010»
15 years 2 months ago
Multithreaded code from synchronous programs: Extracting independent threads for OpenMP
—Synchronous languages offer a deterministic model of concurrency at the level of actions. However, essentially all compilers for synchronous languages compile these actions into...
Daniel Baudisch, Jens Brandt, Klaus Schneider
73
Voted
IPPS
1994
IEEE
15 years 1 months ago
Toward Flexible Control of the Temporal Mapping from Concurrent Program Events to Animations
As parallel and distributed computers become more widely available and used, the already important process of understanding and debugging concurrent programs will take on even gre...
Eileen Kraemer, John T. Stasko
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
15 years 1 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 1 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
ESEC
1995
Springer
15 years 1 months ago
An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
A. T. Chamillard