Modeling operating systems schedulers with multi-stack-queue grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1684, Issue , 1999, Pages 161-172

  Breveglieri, Luca ^a   Reghizzi, Stefano Crespi ^a   Cherubini, Alessandra ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LANGUAGES; SCHEDULING; SEMANTICS; SYNTACTICS;

BNF GRAMMARS; BREADTH-FIRST; DEPTH FIRST; PRIORITY SCHEDULING; PUMPING LEMMA; SCHEDULING POLICIES; SEMANTIC ATTRIBUTE; TIME SLICING;

SCHEDULING ALGORITHMS;

EID: 35248876903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_12     Document Type: Conference Paper

References (14)

1. Brandenburg F. J.: On the Intersection of Stacks and Queues, in Theoretical Computer Science, Elsevier, vol. 58, pp. 69-80, 1988
2. Breveglieri, L., Cherubini, A., Crespi Reghizzi, S: Real-Time Scheduling by Queue Automata, in LNCS Formal Techniques in Real-Time and Fault-Tolerant Systems '92, n. 571, (J. Vytopil, ed.), pp. 131-148, Springer Verlag, 1992
3. Breveglieri, L., Cherubini, A. Citrini, C., Crespi Reghizzi, S.: Multi-Pushdown Stack Languages and Grammars, International Journal of Foundation of Computer Science, World Scientific, n., pp., 1996
4. Breveglieri, L., Cherubini, A., Crespi Reghizzi, S: Syntax-Directed Scheduling, Int. Rep. 98-048, Dip. di Elettronica e Informazione, Politecnico di Milano, 1998
5. Cherubini, A., Citrini, C., Crespi Reghizzi, S., Mandrioli, D.: Breadth and Depth Grammars and Dequeue Automata International Journal of Foundations of Computer Science, World Scientific, vol. 1, n. 3, pp. 219-232, 1990
6. Cherubini, A., Citrini, C., Crespi Reghizzi, S., Mandrioli, D.: Quasi-Real-Time FIFO Automata, Breadth-first Grammars and their Relations, in Theoretical Computer Science, Elsevier, n. 85, pp.171-203, 1991
7. Cherubini, A., San Pietro, P.: A Polynomial-Time Parsing Algorithm for k-Depth Languages, Journal of Computer Systems Science, vol. 52, n. 1, pp. 61-79, 1996
8. Floyd, R., Beigel, R.: The Language of Machines, Freeman, 1994
9. Ginsburgh, S.: The mathematical Theory of Context-free Languages, McGraw-Hill, New York, 1968
10. Hemmendinger, D.: Specifying Ada Server Tasks with executable formal Gram- mars, in IEEE Transactions on Software Engineering, n. 16, pp. 741-754, 1990
11. Kang, S., Lee, H.: Analysis and Solution of non-Preemptive Policies for Scheduling Readers and Writers, in Operating Systems Review, ACM Press, vol. 32, n. 3, pp. 30-50, July, 1998
12. Manna, Z.: Mathematical Theory of Computation, McGraw Hill, New York, 1974
13. Galvin, P., Silberschatz, A.: Operating Systems Concepts, Addison Wesley, Rea- ding, 1994
14. Vauquelin, B., Franchi-Zannettacci, P.: Automates à File, in Theoretical Computer Science, Elsevier, n. 11, pp. 221-225, 1980