Loading...
2003
Net Algorithm Optimization
Net Algorithm Optimization, Proceedingss of Belarusian Engineering Academy
conference paper
In the paper methods for optimization of net algorithms describing concurrent processes are proposed. The depth of concurrency is modeled by the set of parallel statement pairs. The optimization is performed in two steps: first the execution time is minimized under constraints on the implementation cost and second the net algorithm existence problem is resolved for the generated concurrency depth. Some experimental results are presented.
Type
conference paper
Author(s)
Date Issued
2003
Journal
Net Algorithm Optimization
Volume
8
Start page
147
End page
149
Written at
EPFL
EPFL units
Available on Infoscience
June 14, 2006
Use this identifier to reference this record