default search action
Theodore P. Baker
Person information
- affiliation: Florida State University, Tallahassee, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1973
- [b1]Theodore P. Baker:
Computational Complexity and Nondeterminism in Flowchart Programs. Cornell University, USA, 1973
Journal Articles
- 2011
- [j27]Theodore P. Baker, Michele Cirinei:
A unified analysis of global EDF and fixed-task-priority schedulability of sporadic task systems on multiprocessors. J. Embed. Comput. 4(2): 55-69 (2011) - 2009
- [j26]Theodore P. Baker, Sanjoy K. Baruah:
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems. Real Time Syst. 43(1): 3-24 (2009) - 2008
- [j25]Sanjoy K. Baruah, Theodore P. Baker:
Schedulability analysis of global edf. Real Time Syst. 38(3): 223-235 (2008) - [j24]Theodore P. Baker, Michele Cirinei, Marko Bertogna
:
EDZL scheduling analysis. Real Time Syst. 40(3): 264-289 (2008) - 2006
- [j23]Theodore P. Baker:
An Analysis of Fixed-Priority Schedulability on a Multiprocessor. Real Time Syst. 32(1-2): 49-71 (2006) - 2005
- [j22]Theodore P. Baker:
An Analysis of EDF Schedulability on a Multiprocessor. IEEE Trans. Parallel Distributed Syst. 16(8): 760-768 (2005) - 2004
- [j21]Lui Sha, Tarek F. Abdelzaher, Karl-Erik Årzén, Anton Cervin
Real Time Scheduling Theory: A Historical Perspective. Real Time Syst. 28(2-3): 101-155 (2004) - 1998
- [j20]Dong-Ik Oh, Theodore P. Baker:
Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment. Real Time Syst. 15(2): 183-192 (1998) - 1995
- [j19]Jeffrey S. Snyder, David B. Whalley, Theodore P. Baker:
Fast context switches: compiler and architectural support for preemptive scheduling. Microprocess. Microsystems 19(1): 35-42 (1995) - [j18]T. M. Ghazalie, Theodore P. Baker:
Aperiodic Servers in a Deadline Scheduling Environment. Real Time Syst. 9(1): 31-67 (1995) - 1994
- [j17]Alexander D. Stoyenko, Theodore P. Baker:
Real-time schedulability-analyzable mechanisms in Ada9X. Proc. IEEE 82(1): 95-107 (1994) - [j16]Marion G. Harmon, Theodore P. Baker, David B. Whalley:
A Retargetable Technique for Predicting Execution Time of Code Segments. Real Time Syst. 7(2): 159-182 (1994) - 1991
- [j15]Theodore P. Baker:
Stack-based Scheduling of Realtime Processes. Real Time Syst. 3(1): 67-99 (1991) - 1989
- [j14]Theodore P. Baker, Alan C. Shaw:
The Cyclic Executive Model and Ada. Real Time Syst. 1(1): 7-25 (1989) - 1988
- [j13]Theodore P. Baker:
An improved Ada run-time system interface. J. Syst. Softw. 8(5): 373-393 (1988) - 1986
- [j12]Theodore P. Baker, Gregory M. Scallon:
Special Feature: An Architecture for Real-Time Software Systems. IEEE Softw. 3(3): 50-58 (1986) - [j11]Theodore P. Baker, Gregory A. Riccardi:
Implementing Ada Exceptions. IEEE Softw. 3(5): 42-51 (1986) - 1985
- [j10]Theodore P. Baker, Gregory A. Riccardi:
Ada Tasking: From semantics to Efficient Implementation. IEEE Softw. 2(2): 34-46 (1985) - 1982
- [j9]Theodore P. Baker:
A One-Pass Algorithm for Overload Resolution in Ada. ACM Trans. Program. Lang. Syst. 4(4): 601-614 (1982) - 1981
- [j8]Theodore P. Baker:
Extending Lookahead for LR Parsers. J. Comput. Syst. Sci. 22(2): 243-259 (1981) - 1979
- [j7]Theodore P. Baker:
On "Provable" Analogs of P and MP. Math. Syst. Theory 12: 213-218 (1979) - [j6]Theodore P. Baker, Alan L. Selman:
A Second Step Toward the Polynomial Hierarchy. Theor. Comput. Sci. 8: 177-187 (1979) - 1978
- [j5]Theodore P. Baker:
Surveyor's Forum: Is Software Science Hard? ACM Comput. Surv. 10(4): 504 (1978) - [j4]Theodore P. Baker:
"Natural" Properties of Flowchart Step-Counting Measures. J. Comput. Syst. Sci. 16(1): 1-22 (1978) - [j3]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) - 1975
- [j2]Juris Hartmanis, Theodore P. Baker:
On Simple Gödel Numberings and Translations. SIAM J. Comput. 4(1): 1-11 (1975) - [j1]Theodore P. Baker, John Gill, Robert Solovay:
Relativizations of the P =? NP Question. SIAM J. Comput. 4(4): 431-442 (1975)
Conference and Workshop Papers
- 2010
- [c49]Theodore P. Baker:
What to Make of Multicore Processors for Reliable Real-Time Systems? Ada-Europe 2010: 1-18 - [c48]Mark J. Stanovich, Theodore P. Baker, An-I Wang
Defects of the POSIX Sporadic Server and How to Correct Them. IEEE Real-Time and Embedded Technology and Applications Symposium 2010: 35-45 - 2009
- [c47]Theodore P. Baker, Sanjoy K. Baruah:
Sustainable Multiprocessor Scheduling of Sporadic Task Systems. ECRTS 2009: 141-150 - 2008
- [c46]Sanjoy K. Baruah, Theodore P. Baker:
Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems. ECRTS 2008: 3-12 - [c45]Mark 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 - 2007
- [c44]Michele Cirinei, Theodore P. Baker:
EDZL Scheduling Analysis. ECRTS 2007: 9-18 - [c43]Theodore P. Baker, Michele Cirinei:
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks. OPODIS 2007: 62-75 - [c42]Mark Lewandowski, Mark J. Stanovich, Theodore P. Baker, Kartik Gopalan
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 - 2006
- [c41]Nathan Fisher
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities. ECRTS 2006: 118-127 - [c40]Nathan Fisher, Theodore P. Baker, Sanjoy K. Baruah:
Algorithms for Determining the Demand-Based Load of a Sporadic Task System. RTCSA 2006: 135-146 - [c39]Theodore P. Baker, Michele Cirinei:
A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks. RTSS 2006: 178-190 - 2003
- [c38]Theodore P. Baker:
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis. RTSS 2003: 120-129 - 1999
- [c37]Hongfeng Shen, Arnaud Charlet, Theodore P. Baker:
A "Bare-Machine" Implementation of Ada Multi-tasking Beneath the Linux Kernel. Ada-Europe 1999: 287-297 - [c36]Hongfeng Shen, Theodore P. Baker:
A Linux kernel module implementation of restricted Ada tasking. IRTAW 1999: 96-103 - 1998
- [c35]Laurent Millet, Ted Baker:
Porting the GNAT Tasking Runtime System to the Java Virtual Machine. Ada-Europe 1998: 19-28 - [c34]Ted Baker:
From POSIX Threads to Ada to Java: A Brief History of Runtime Development for Some Real-Time Programming Languages. RTSS 1998: 319- - 1997
- [c33]Theodore P. Baker, Dong-Ik Oh:
Ada Bindings for C Interfaces: Lessons Learned from the Florist Implementation. Ada-Europe 1997: 13-22 - [c32]Alan Burns, Ted Baker, Tullio Vardanega
Tasking profiles (session summary). IRTAW 1997: 5-7 - [c31]Dong-Ik Oh, Theodore P. Baker:
Optimization of Ada '95 Tasking Constructs. TRI-Ada 1997: 79-88 - 1996
- [c30]Dong-Ik Oh, Theodore P. Baker, Seung-Jin Moon:
The GNARL Implementation of POSIX/Ada Signal Services. Ada-Europe 1996: 275-286 - 1995
- [c29]Frank Mueller, Viresh Rustagi, Ted Baker:
MiThOS - A Real-Time Micro-Kernel Threads Operating System. RTSS 1995: 49-53 - [c28]E. W. Giering, Theodore P. Baker:
Implementing Ada protected objects - interface issues and optimization. TRI-Ada 1995: 134-143 - 1994
- [c27]Edward William Giering III, Theodore P. Baker:
A tool for the deterministic scheduling of real-time programs implemented as periodic Ada tasks. SETA 1994: 54-73 - [c26]E. W. Giering, Frank Mueller, Theodore P. Baker:
Features of the GNU Ada Runtime Library. TRI-Ada 1994: 93-103 - [c25]Edward William Giering III, Theodore P. Baker:
The GNU Ada runtime library (GNARL). WADAS 1994: 97-107 - 1993
- [c24]E. W. Giering, Frank Mueller, Theodore P. Baker:
Implementing Ada 9X Features Using POSIX Threads: Design Issues. TRI-Ada 1993: 214-228 - 1992
- [c23]Marion G. Harmon, Theodore P. Baker, David B. Whalley:
A Retargetable Technique for Predicting Execution Time. RTSS 1992: 68-77 - [c22]E. W. Giering, Theodore P. Baker:
Using POSIX Threads to Implement Ada Tasking: Description of Work in Progress. TRI-Ada 1992: 518-529 - [c21]Edward William Giering III, Theodore P. Baker:
POSIX/Ada real-time bindings: description of work in progress. WADAS 1992: 27-41 - 1991
- [c20]Theodore P. Baker, Offer Pazy:
Real-Time Features for Ada 9X. RTSS 1991: 172-180 - 1990
- [c19]Ted Baker:
Protected records, time management and distribution. IRTAW 1990: 17-28 - [c18]Ted Baker:
Opening up Ada-tasking. IRTAW 1990: 60-64 - [c17]Theodore P. Baker:
A Stack-Based Resource Allocation Policy for Realtime Processes. RTSS 1990: 191-200 - [c16]Edward William Giering III, Theodore P. Baker:
Compile time scheduling of an Ada subset. WADAS 1990: 143-155 - 1989
- [c15]Ted Baker:
Time issues working group. IRTAW 1989: 119-135 - [c14]Ted Baker:
Fixing some time-related problems in Ada. IRTAW 1989: 136-143 - [c13]E. W. Giering, Theodore P. Baker:
Toward the Deterministic Scheduling of Ada Tasks. RTSS 1989: 31-40 - 1988
- [c12]Ted Baker:
Improving immediacy in Ada. IRTAW 1988: 50-56 - [c11]Theodore P. Baker, Alan C. Shaw:
The Cyclic Executive Model and Ada. RTSS 1988: 120-129 - 1987
- [c10]Ted Baker:
Ada runtime support environments to better support real-time systems. IRTAW 1987: 85-87 - [c9]Theodore P. Baker, Kevin Jeffay:
Corset and Lace: Adapting Ada Runtime Support to Real-Time Systems. RTSS 1987: 158-167 - [c8]Theodore P. Baker:
A low-level tasking package for Ada. SIGAda 1987: 141-146 - 1985
- [c7]Gregory A. Riccardi, Theodore P. Baker:
A runtime supervisor to support Ada tasking: rendezvous and delays. SIGAda 1985: 329-342 - 1982
- [c6]Theodore P. Baker:
A Single-Pass Syntax-Directed Front End for Ada. SIGPLAN Symposium on Compiler Construction 1982: 318-326 - 1979
- [c5]Theodore P. Baker, Juris Hartmanis:
Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages. FOCS 1979: 392-396 - [c4]Juris Hartmanis, Theodore P. Baker:
Relative Succinctness of Representations of Languages and Separation of Complexity Classes. MFCS 1979: 70-88 - 1976
- [c3]Theodore P. Baker, Alan L. Selman:
A Second Step toward the Polynomial Hierarchy. FOCS 1976: 71-75 - 1974
- [c2]Theodore P. Baker:
"Natural" Properties of Flowchart Complexity Measures. SWAT 1974: 178-184 - [c1]Juris Hartmanis, Theodore P. Baker:
On Simple Goedel Numberings and Translations. ICALP 1974: 301-316
Parts in Books or Collections
- 2005
- [p1]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
Editorship
- 2009
- [e2]Theodore P. Baker:
Proceedings of the 30th IEEE Real-Time Systems Symposium, RTSS 2009, Washington, DC, USA, 1-4 December 2009. IEEE Computer Society 2009, ISBN 978-0-7695-3875-4 [contents] - 2008
- [e1]Theodore P. Baker, Alain Bui, Sébastien Tixeuil:
Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings. Lecture Notes in Computer Science 5401, Springer 2008, ISBN 978-3-540-92220-9 [contents]
Reference Works
- 2007
- [r1]Sanjoy K. Baruah, Theodore P. Baker:
Schedulability Analysis of Multiprocessor Sporadic Task Systems. Handbook of Real-Time and Embedded Systems 2007
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: