dblp.uni-trier.dewww.uni-trier.de

Theodore P. Baker

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
50 Theodore P. Baker, Alain Bui, Sébastien Tixeuil: Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings Springer 2008
49EESanjoy K. Baruah, Theodore P. Baker: Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems. ECRTS 2008: 3-12
48EEMark J. Stanovich, Theodore P. Baker, An-I Andy Wang: Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements. IEEE Real-Time and Embedded Technology and Applications Symposium 2008: 331-341
47EESanjoy K. Baruah, Theodore P. Baker: Schedulability analysis of global edf. Real-Time Systems 38(3): 223-235 (2008)
46EETheodore P. Baker, Michele Cirinei, Marko Bertogna: EDZL scheduling analysis. Real-Time Systems 40(3): 264-289 (2008)
2007
45EEMichele Cirinei, Theodore P. Baker: EDZL Scheduling Analysis. ECRTS 2007: 9-18
44EEMark Lewandowski, Mark J. Stanovich, Theodore P. Baker, Kartik Gopalan, An-I Andy Wang: Modeling Device Driver Effects in Real-Time Schedulability Analysis: Study of a Network Driver. IEEE Real-Time and Embedded Technology and Applications Symposium 2007: 57-68
43EETheodore P. Baker, Michele Cirinei: Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks. OPODIS 2007: 62-75
2006
42EENathan Fisher, Sanjoy K. Baruah, Theodore P. Baker: The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities. ECRTS 2006: 118-127
41EENathan Fisher, Theodore P. Baker, Sanjoy K. Baruah: Algorithms for Determining the Demand-Based Load of a Sporadic Task System. RTCSA 2006: 135-146
40EETheodore P. Baker, Michele Cirinei: A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks. RTSS 2006: 178-190
39EETheodore P. Baker: An Analysis of Fixed-Priority Schedulability on a Multiprocessor. Real-Time Systems 32(1-2): 49-71 (2006)
2005
38 Marco Caccamo, Theodore P. Baker, Alan Burns, Giorgio C. Buttazzo, Lui Sha: Real-Time Scheduling for Embedded Systems. Handbook of Networked and Embedded Control Systems 2005: 173-196
37EETheodore P. Baker: An Analysis of EDF Schedulability on a Multiprocessor. IEEE Trans. Parallel Distrib. Syst. 16(8): 760-768 (2005)
2004
36EELui Sha, Tarek F. Abdelzaher, Karl-Erik Årzén, Anton Cervin, Theodore P. Baker, Alan Burns, Giorgio C. Buttazzo, Marco Caccamo, John P. Lehoczky, Aloysius K. Mok: Real Time Scheduling Theory: A Historical Perspective. Real-Time Systems 28(2-3): 101-155 (2004)
2003
35EETheodore P. Baker: Multiprocessor EDF and Deadline Monotonic Schedulability Analysis. RTSS 2003: 120-129
1999
34EEHongfeng Shen, Arnaud Charlet, Theodore P. Baker: A ``Bare-Machine'' Implementation of Ada Multi-tasking Beneath the Linux Kernel. Ada-Europe 1999: 287-297
1998
33 Dong-Ik Oh, Theodore P. Baker: Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment. Real-Time Systems 15(2): 183-192 (1998)
1997
32 Theodore P. Baker, Dong-Ik Oh: Ada Bindings for C Interfaces: Lessons Learned from the Florist Implementation. Ada-Europe 1997: 13-22
31EEDong-Ik Oh, Theodore P. Baker: Optimization of Ada '95 Tasking Constructs. TRI-Ada 1997: 79-88
1996
30 Dong-Ik Oh, Theodore P. Baker, Seung-Jin Moon: The GNARL Implementation of POSIX/Ada Signal Services. Ada-Europe 1996: 275-286
1995
29 T. M. Ghazalie, Theodore P. Baker: Aperiodic Servers in a Deadline Scheduling Environment. Real-Time Systems 9(1): 31-67 (1995)
1994
28EEE. W. Giering, Frank Mueller, Theodore P. Baker: Features of the GNU Ada Runtime Library. TRI-Ada 1994: 93-103
27 Marion G. Harmon, Theodore P. Baker, David B. Whalley: A Retargetable Technique for Predicting Execution Time of Code Segments. Real-Time Systems 7(2): 159-182 (1994)
1993
26EEE. W. Giering, Frank Mueller, Theodore P. Baker: Implementing Ada 9X Features Using POSIX Threads: Design Issues. TRI-Ada 1993: 214-228
1992
25EEMarion G. Harmon, Theodore P. Baker, David B. Whalley: A Retargetable Technique for Predicting Execution Time. IEEE Real-Time Systems Symposium 1992: 68-77
24EEE. W. Giering, Theodore P. Baker: Using POSIX Threads to Implement Ada Tasking: Description of Work in Progress. TRI-Ada 1992: 518-529
1991
23 Theodore P. Baker, Offer Pazy: Real-Time Features for Ada 9X. IEEE Real-Time Systems Symposium 1991: 172-180
22 Theodore P. Baker: Stack-based Scheduling of Realtime Processes. Real-Time Systems 3(1): 67-99 (1991)
1990
21 Theodore P. Baker: A Stack-Based Resource Allocation Policy for Realtime Processes. IEEE Real-Time Systems Symposium 1990: 191-200
1989
20 E. W. Giering, Theodore P. Baker: Toward the Deterministic Scheduling of Ada Tasks. IEEE Real-Time Systems Symposium 1989: 31-40
19 Theodore P. Baker, Alan C. Shaw: The Cyclic Executive Model and Ada. Real-Time Systems 1(1): 7-25 (1989)
1988
18 Theodore P. Baker, Alan C. Shaw: The Cyclic Executive Model and Ada. IEEE Real-Time Systems Symposium 1988: 120-129
17EETheodore P. Baker: An improved Ada run-time system interface. Journal of Systems and Software 8(5): 373-393 (1988)
1987
16 Theodore P. Baker, Kevin Jeffay: Corset and Lace: Adapting Ada Runtime Support to Real-Time Systems. IEEE Real-Time Systems Symposium 1987: 158-167
1982
15EETheodore P. Baker: A Single-Pass Syntax-Directed Front End for Ada. SIGPLAN Symposium on Compiler Construction 1982: 318-326
14EETheodore P. Baker: A One-Pass Algorithm for Overload Resolution in Ada. ACM Trans. Program. Lang. Syst. 4(4): 601-614 (1982)
1981
13 Theodore P. Baker: Extending Lookahead for LR Parsers. J. Comput. Syst. Sci. 22(2): 243-259 (1981)
1979
12 Theodore P. Baker, Juris Hartmanis: Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages FOCS 1979: 392-396
11 Juris Hartmanis, Theodore P. Baker: Relative Succinctness of Representations of Languages and Separation of Complexity Classes. MFCS 1979: 70-88
10 Theodore P. Baker: On "Provable" Analogs of P and MP. Mathematical Systems Theory 12: 213-218 (1979)
9 Theodore P. Baker, Alan L. Selman: A Second Step Toward the Polynomial Hierarchy. Theor. Comput. Sci. 8: 177-187 (1979)
1978
8 Theodore P. Baker: Surveyor's Forum: Is Software Science Hard? ACM Comput. Surv. 10(4): 504 (1978)
7 Theodore P. Baker: "Natural" Properties of Flowchart Step-Counting Measures. J. Comput. Syst. Sci. 16(1): 1-22 (1978)
6 Theodore P. Baker: A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension. SIAM J. Comput. 7(4): 533-541 (1978)
1976
5 Theodore P. Baker, Alan L. Selman: A Second Step toward the Polynomial Hierarchy FOCS 1976: 71-75
1975
4 Juris Hartmanis, Theodore P. Baker: On Simple Gödel Numberings and Translations. SIAM J. Comput. 4(1): 1-11 (1975)
3 Theodore P. Baker, John Gill, Robert Solovay: Relativizatons of the P =? NP Question. SIAM J. Comput. 4(4): 431-442 (1975)
1974
2 Theodore P. Baker: ``Natural'' Properties of Flowchart Complexity Measures FOCS 1974: 178-184
1 Juris Hartmanis, Theodore P. Baker: On Simple Goedel Numberings and Translations. ICALP 1974: 301-316

Coauthor Index

1Tarek F. Abdelzaher [36]
2Karl-Erik Årzén [36]
3Sanjoy K. Baruah [41] [42] [47] [49]
4Marko Bertogna [46]
5Alain Bui [50]
6Alan Burns [36] [38]
7Giorgio C. Buttazzo [36] [38]
8Marco Caccamo [36] [38]
9Anton Cervin [36]
10Arnaud Charlet [34]
11Michele Cirinei [40] [43] [45] [46]
12Nathan Fisher [41] [42]
13T. M. Ghazalie [29]
14E. W. Giering [20] [24] [26] [28]
15John Gill [3]
16Kartik Gopalan [44]
17Marion G. Harmon [25] [27]
18Juris Hartmanis [1] [4] [11] [12]
19Kevin Jeffay [16]
20John P. Lehoczky [36]
21Mark Lewandowski [44]
22Aloysius K. Mok [36]
23Seung-Jin Moon [30]
24Frank Mueller [26] [28]
25Dong-Ik Oh [30] [31] [32] [33]
26Offer Pazy [23]
27Alan L. Selman [5] [9]
28Lui Sha [36] [38]
29Alan C. Shaw [18] [19]
30Hongfeng Shen [34]
31Robert Solovay [3]
32Mark J. Stanovich [44] [48]
33Sébastien Tixeuil [50]
34An-I Wang (An-I Andy Wang) [44] [48]
35David B. Whalley [25] [27]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)