Scheduling constraint generation for communicating processes
Authors:
- 1 June 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 3 (2) , 215-230
Abstract
This paper describes a new algorithm for generation of scheduling constraints in networks of communicating processes. Our model of communication intertwines the schedules of the machines in the network: timing constraints of a machine may affect the schedules of machines communicating with it. This model of communication facilitates the modular specification of timing constraints. A feasible solution to the set of constraints generated gives a schedule for each machine in the network such that all internal constraints of each machine are satisfied and communication between machines is statically coordinated whenever possible. Static scheduling of communication saves on the cost of handshake associated with dynamic synchronization. Our algorithm can handle complex, state-dependent and cyclic timing constraints. Experimental results show that our algorithm is both effective and efficient.Keywords
This publication has 6 references indexed in Scilit:
- An automaton model for scheduling constraints in synchronous machinesIEEE Transactions on Computers, 1995
- Interface optimization for concurrent systems under timing constraintsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1993
- A formal approach to the scheduling problem in high level synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- OPERATION/EVENT GRAPHS: A Design Representation for Timing Behavior1991
- Path-based scheduling for synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- The Olympus synthesis systemIEEE Design & Test of Computers, 1990