DocumentCode
342517
Title
A model for scheduling protocol-constrained components and environments
Author
Haynal, Steve ; Brewer, Forrest
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
fYear
1999
fDate
1999
Firstpage
292
Lastpage
295
Abstract
This paper presents a technique for highly constrained event sequence scheduling. System resource protocols as well as an external interface protocol are described by non-deterministic finite automata (NFA). All valid schedules which adhere to interfacing constraints and resource bounds for flow graph described behavior are determined exactly. A model and scheduling results are presented for an extensive design example
Keywords
constraint theory; finite automata; flow graphs; protocols; scheduling; design model; flow graph; interface protocol; nondeterministic finite automata; protocol-constrained event sequence scheduling; system resource protocol; Automata; Digital systems; Flow graphs; High level synthesis; Job shop scheduling; Manufacturing; Modems; Permission; Processor scheduling; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 1999. Proceedings. 36th
Conference_Location
New Orleans, LA
Print_ISBN
1-58113-092-9
Type
conf
DOI
10.1109/DAC.1999.781328
Filename
781328
Link To Document