Period assignment in multidimensional periodic scheduling

We discuss the problem of assigning periods in multidimensional periodic scheduling such that storage costs are minimized. This problem originates from the design of high throughput DSP systems, where highly parallel execution of loops is of utmost importance, and thus finding an optimal order of th...

Full description

Saved in:
Bibliographic Details
Published in:Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design pp. 585 - 592
Main Authors: Verhaegh, Wim F. J., Aarts, Emile H. L., van Gorp, Paul C. N.
Format: Conference Proceeding Journal Article
Language:English
Published: New York, NY, USA ACM 1998
IEEE
Series:ACM Conferences
Subjects:
Applied computing > Physical sciences and engineering > Engineering
Automatic control
Clocks
Computer systems organization > Dependable and fault-tolerant systems and networks
Constraint optimization
Costs
Digital signal processing
Flow graphs
General and reference > Cross-computing tools and techniques > Performance
Hardware > Robustness
Mathematics of computing > Mathematical analysis > Mathematical optimization > Continuous optimization > Linear programming
Mathematics of computing > Mathematical software
Minimization methods
Multidimensional systems
Networks > Network performance evaluation
Storage automation
Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis > Scheduling algorithms
Theory of computation > Design and analysis of algorithms > Mathematical optimization > Continuous optimization > Linear programming
Theory of computation > Design and analysis of algorithms > Online algorithms > Online learning algorithms > Scheduling algorithms
Theory of computation > Theory and algorithms for application domains > Machine learning theory > Reinforcement learning > Sequential decision making
Timing
ISBN:1581130082, 9781581130089
ISSN:1092-3152
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We discuss the problem of assigning periods in multidimensional periodic scheduling such that storage costs are minimized. This problem originates from the design of high throughput DSP systems, where highly parallel execution of loops is of utmost importance, and thus finding an optimal order of the loops is an important task. We formulate the period assignment problem as a linear programming (LP) problem with some additional, nonlinear constraints. The nonlinear constraints are handled by a branch and bound approach, whereas the LP relaxation is handled by a constraint generation technique. The effectiveness and efficiency of the approach are good, which is illustrated by means of some practical examples.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
content type line 25
ISBN:1581130082
9781581130089
ISSN:1092-3152
DOI:10.1145/288548.289090