• Buttazzo G. (2024). Real-Time Operating Systems and Standards. Hard Real-Time Computing Systems. 10.1007/978-3-031-45410-3_13. (407-439).

    https://link.springer.com/10.1007/978-3-031-45410-3_13

  • Anderson M, Williamson M and Subramani K. (2019). Empirical analysis of algorithms for the shortest negative cost cycle problem. Discrete Applied Mathematics. 10.1016/j.dam.2018.03.055. 253. (167-184). Online publication date: 1-Jan-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S0166218X18301549

  • Caskurlu B, Williamson M, Subramani K and Mkrtchyan V. (2018). On approximating optimal weight "no"-certificates in weighted difference constraint systems. Journal of Combinatorial Optimization. 36:2. (329-345). Online publication date: 1-Aug-2018.

    https://doi.org/10.1007/s10878-018-0292-8

  • Williamson M and Subramani K. (2015). On the negative cost girth problem in planar networks. Journal of Discrete Algorithms. 35:C. (40-50). Online publication date: 1-Nov-2015.

    https://doi.org/10.1016/j.jda.2015.10.001

  • Ehsan Saboori , Shahriar Mohammadi and Shafigh Parsazad . (2010). A new scheduling algorithm for server farms load balancing 2010 2nd International Conference on Industrial and Information Systems (IIS 2010). 10.1109/INDUSIS.2010.5565821. 978-1-4244-7860-6. (417-420).

    http://ieeexplore.ieee.org/document/5565821/

  • Noguero A and Calvo I. A framework with proactive nodes for scheduling and optimizing distributed embedded systems. Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management. (236-245).

    /doi/10.5555/1875907.1875938

  • Noguero A and Calvo I. (2010). A Framework with Proactive Nodes for Scheduling and Optimizing Distributed Embedded Systems. Networked Services and Applications - Engineering, Control and Management. 10.1007/978-3-642-13971-0_23. (236-245).

    http://link.springer.com/10.1007/978-3-642-13971-0_23

  • Subramani K. (2009). Optimal Length Resolution Refutations of Difference Constraint Systems. Journal of Automated Reasoning. 43:2. (121-137). Online publication date: 1-Aug-2009.

    https://doi.org/10.1007/s10817-009-9139-4

  • Subramani K and Yellajyosula K. (2008). On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers. International Journal of Parallel Programming. 36:4. (386-411). Online publication date: 1-Apr-2008.

    https://doi.org/10.1007/s10766-007-0061-2

  • Subramani K and Madduri K. Accomplishing approximate FCFS fairness without queues. Proceedings of the 14th international conference on High performance computing. (540-551).

    /doi/10.5555/1782174.1782234

  • Subramani K. (2007). A polynomial time algorithm for Zero-Clairvoyant scheduling. Journal of Applied Logic. 10.1016/j.jal.2006.08.001. 5:4. (667-680). Online publication date: 1-Dec-2007.

    https://linkinghub.elsevier.com/retrieve/pii/S1570868306000589

  • Subramani K. (2007). On a decision procedure for quantified linear programs. Annals of Mathematics and Artificial Intelligence. 51:1. (55-77). Online publication date: 1-Sep-2007.

    https://doi.org/10.1007/s10472-007-9085-y

  • Subramani K and Madduri K. Accomplishing Approximate FCFS Fairness Without Queues. High Performance Computing – HiPC 2007. 10.1007/978-3-540-77220-0_49. (540-551).

    http://link.springer.com/10.1007/978-3-540-77220-0_49

  • Subramani K. Totally clairvoyant scheduling with relative timing constraints. Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation. (398-411).

    https://doi.org/10.1007/11609773_26

  • Subramani K. (2005). An Analysis of Totally Clairvoyant Scheduling. Journal of Scheduling. 8:2. (113-133). Online publication date: 1-Apr-2005.

    https://doi.org/10.1007/s10951-005-6367-2

  • Subramani K and Yellajyosula K. A shared memory dispatching approach for partially clairvoyant schedulers. Proceedings of the 11th international conference on High Performance Computing. (111-122).

    https://doi.org/10.1007/978-3-540-30474-6_17

  • Subramani K. A Specification Framework for Real-Time Scheduling. Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics. (195-207).

    /doi/10.5555/647012.712986

  • Subramani K. An Analysis of Zero-Clairvoyant Scheduling. Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. (98-112).

    /doi/10.5555/646486.694633

  • Subramani K. (2002). An Analysis of Zero-Clairvoyant Scheduling. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/3-540-46002-0_8. (98-112).

    http://link.springer.com/10.1007/3-540-46002-0_8

  • Subramani K. (2002). A Specification Framework for Real-Time Scheduling. SOFSEM 2002: Theory and Practice of Informatics. 10.1007/3-540-36137-5_14. (195-207).

    http://link.springer.com/10.1007/3-540-36137-5_14

  • Subramani K. Parametric Scheduling - Algorithms and Complexity. Proceedings of the 8th International Conference on High Performance Computing. (36-46).

    /doi/10.5555/645447.652923

  • Cheng S and Hwang S. (2001). Optimal Real-Time Scheduling with Minimal Rejections andMinimal Finishing Time. Real-Time Systems. 20:3. (229-253). Online publication date: 1-May-2001.

    https://doi.org/10.1023/A:1008150101419

  • Subramani K. (2001). Parametric Scheduling for Network Constraints. Computing and Combinatorics. 10.1007/3-540-44679-6_61. (550-560).

    http://link.springer.com/10.1007/3-540-44679-6_61

  • Lortz V, Shin K and Kim J. (2000). MDARTS. IEEE Transactions on Knowledge and Data Engineering. 12:4. (621-644). Online publication date: 1-Jul-2000.

    https://doi.org/10.1109/69.868911

  • Subramani E and Agrawala A. The static polytope and its applications to a scheduling problem WFCS 2000. 3rd IEEE International Workshop on Factory Communication Systems. 10.1109/WFCS.2000.882560. 0-7803-6500-3. (283-290).

    http://ieeexplore.ieee.org/document/882560/

  • Abeni L and Buttazzo G. Support for dynamic QoS in the HARTIK kernel Seventh International Conference on Real-Time Computing Systems and Applications. 10.1109/RTCSA.2000.896372. 0-7695-0930-4. (65-72).

    http://ieeexplore.ieee.org/document/896372/

  • Schon F, Schroder-Preikschat W, Spinczyk O and Spinczyk U. On interrupt-transparent synchronization in an embedded object-oriented operating system Third IEEE International Symposium on Object- Oriented Real-Time Distributed Computing (ISORC 2000). 10.1109/ISORC.2000.839540. 0-7695-0607-0. (270-277).

    http://ieeexplore.ieee.org/document/839540/

  • Subramani K and Agrawala A. (2000). A Dual Interpretation of “Standard Constraints” in Parametric Scheduling. Formal Techniques in Real-Time and Fault-Tolerant Systems. 10.1007/3-540-45352-0_12. (121-133).

    http://link.springer.com/10.1007/3-540-45352-0_12

  • Jehuda J. Collaborative best-effort real-time agents-a new paradigm HICSS 32 - 32nd Annual Hawaii International Conference on System Sciences. 10.1109/HICSS.1999.772822. 0-7695-0001-3. (11).

    http://ieeexplore.ieee.org/document/772822/

  • Takashio K, Shitomi H and Tokoro M. (1996). Design and implementation of DROL runtime environment on Real-Time Mach kernel. Object-Based Parallel and Distributed Computation. 10.1007/3-540-61487-7_32. (257-272).

    http://link.springer.com/10.1007/3-540-61487-7_32

  • Takashio K, Shitomi H and Tokoro M. Constructing distributed real-time systems with DROL real-time objects. Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications.

    /doi/10.5555/527074.828553

  • Malcolm N and Zhao W. (1995). Hard real-time communication in multiple-access networks. Real-Time Systems. 8:1. (35-77). Online publication date: 11-Jan-1995.

    https://doi.org/10.1007/BF01893145

  • Zimmermann C and Cahill V. Roo: a framework for real-time threads Third Workshop on Parallel and Distributed Real-Time Systems. 10.1109/WPDRTS.1995.470496. 0-8186-7099-1. (137-146).

    http://ieeexplore.ieee.org/document/470496/

  • Takashio K, Shitomi H and Tokoro M. Constructing distributed real-time systems with DROL real-time objects Second International Workshop on Real-Time Computing Systems and Applications. 10.1109/RTCSA.1995.528764. 0-8186-7106-8. (142-149).

    http://ieeexplore.ieee.org/document/528764/

  • Jensen E. (1994). Asynchronous Decentralized Realtime Computer Systems. Real Time Computing. 10.1007/978-3-642-88049-0_17. (347-371).

    http://link.springer.com/10.1007/978-3-642-88049-0_17

  • Langan D. EOS. Proceedings of the 1993 ACM conference on Computer science. (60-65).

    https://doi.org/10.1145/170791.170803

  • Buttazzo G. HARTIK: A real-time kernel for robotics applications 1993 Real-Time Systems Symposium. 10.1109/REAL.1993.393499. 0-8186-4480-X. (201-205).

    http://ieeexplore.ieee.org/document/393499/

  • Saksena M and Agrawala A. Temporal analysis for hard real-time scheduling Phoenix Conference on Computers and Communications. 10.1109/PCCC.1993.344527. 0-7803-0922-7. (538-544).

    http://ieeexplore.ieee.org/document/344527/

  • Tayli M and Benmaiza M. An efficient circuit-switching mechanism for interprocess communication in a transputer network 1993 4th Workshop on Future Trends of Distributed Computing Systems. 10.1109/FTDCS.1993.344154. 0-8186-4430-3. (215-220).

    http://ieeexplore.ieee.org/document/344154/

  • Panzieri F and Davoli R. Real time systems: A tutorial. Performance Evaluation of Computer and Communication Systems. 10.1007/BFb0013863. (435-462).

    http://www.springerlink.com/index/10.1007/BFb0013863

  • Weiderman N and Kamenoff N. (1992). Hartstone Uniprocessor Benchmark. Real-Time Systems. 4:4. (353-382). Online publication date: 1-Dec-1992.

    https://doi.org/10.1007/BF00355299

  • Natarajan S and Zhao W. (1992). Issues in Building Dynamic Real-Time Systems. IEEE Software. 9:5. (16-21). Online publication date: 1-Sep-1992.

    https://doi.org/10.1109/52.156893

  • Gantenbein R. (1992). An annotated bibliography of dependable distributed computing. ACM SIGOPS Operating Systems Review. 26:2. (60-81). Online publication date: 1-Apr-1992.

    https://doi.org/10.1145/142111.142116

  • Nirkhe V and Pugh W. Partial evaluation of high-level imperative programming languages with applications in hard real-time systems. Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (269-280).

    https://doi.org/10.1145/143165.143223

  • Kopetz H. (1991). Real-time systems. Software Engineer's Reference Book. 10.1016/B978-0-7506-0813-8.50064-2. (56/1-56/9).

    https://linkinghub.elsevier.com/retrieve/pii/B9780750608138500642

  • Tripathi S and Nirkhe V. Pre-scheduling for synchronization in hard real-time systems. Operating Systems of the 90s and Beyond. 10.1007/BFb0024531. (102-108).

    http://www.springerlink.com/index/10.1007/BFb0024531

  • Nirkhe V, Tripathi S and Agrawala A. (1990). Language support for the Maruti real-time system [1990] Proceedings 11th Real-Time Systems Symposium. 10.1109/REAL.1990.128756. 0-8186-2112-5. (257-266).

    http://ieeexplore.ieee.org/document/128756/

  • Gudmundsson O, Mosse D, Agrawala A and Tripathi S. MARUTI: a hard real-time operating system IEEE Workshop on Experimental Distributed Systems. 10.1109/EDS.1990.138046. . (29-34).

    http://ieeexplore.ieee.org/document/138046/

  • Tripathi S and Nirkhe V. (1990). Synchronization in Hard Real-Time Systems. Frontiers of Computing Systems Research. 10.1007/978-1-4613-0633-7_6. (187-230).

    http://link.springer.com/10.1007/978-1-4613-0633-7_6