DocumentCode :
781515
Title :
Scheduling constraint generation for communicating processes
Author :
Takach, Andrds ; Wolf, Wayne
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., NJ, USA
Volume :
3
Issue :
2
fYear :
1995
fDate :
6/1/1995 12:00:00 AM
Firstpage :
215
Lastpage :
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 :
VLSI; constraint handling; finite state machines; logic CAD; processor scheduling; scheduling; VLSI systems; communicating processes; cyclic constraints; modular specification; scheduling constraint generation; state-dependent constraints; synchronization; timing constraints; Algorithm design and analysis; Automata; Automatic control; Clocks; Communication system control; Costs; Delay; Dynamic scheduling; Scheduling algorithm; Timing;
fLanguage :
English
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1063-8210
Type :
jour
DOI :
10.1109/92.386222
Filename :
386222
Link To Document :
بازگشت