@INPROCEEDINGS{andersoj:jtres06, key = {andersoj:jtres06}, author = {Jonathan S. Anderson and E. Douglas Jensen}, title = {The Distributed Real-Time Specification for {J}ava: A Status Report}, booktitle = {Proceedings of the 4th International Workshop on Java Technologies for Real-time and Embedded Systems (JTRES 2006)}, publisher = {}, year = {2006}, url = {http://andersoj.org/papers/drtsj-jtres06-final.pdf}, pages = {UNKNOWN}, month = {October}, note = {Conservatoire National des Arts et Métiers (CNAM) Paris, France, 11-13 October 2006}, abstract = {The Distributed Real-Time Specification for Java (DRTSJ) is underdevelopment within Sun's Java Community Process (JCP) as Java Specification Request 50 (JSR-50), lead by the MITRE Corporation. We present the engineering considerations and design decisions settled by the Expert Group, the current and proposed form of the Reference Implementation, and a summary of open issues. In particular, we present an approach to integrating the distributable threads programming model with the Real-Time Specification for Java and discuss the ramifications for composing distributed, real-time systems in Java. The Expert Group plans to release an initial Early Draft Review (EDR) for previewing the distributable threads abstraction in the coming months, which we describe in detail. Along with that EDR, we will make available a demonstration application from Virginia Tech, and a DRTSJ-compatible RTSJ VM from Apogee.} } @INPROCEEDINGS{andersoj:srds06, key = {andersoj:srds06}, author = {Edward Curley and Jonathan S. Anderson and Binoy Ravindran and E. Douglas Jensen}, title = {Recovering from Distributable Thread Failures with Assured Timeliness in Real-Time Distributed Systems}, booktitle = {Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)}, publisher = {IEEE Computer Society}, year = {2006}, url = {http://www.real-time.ece.vt.edu/srds06.pdf}, isbn = {0-7695-2677-2}, issn = {1060-9857}, pages = {267-276}, month = {October}, abstract = {We consider the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orphans---i.e., thread segments that are disconnected from the thread's root. We consider a termination model for recovering from such failures, where the orphans must be detected and aborted, and failure-exception notification must be delivered to the farthest, contiguous surviving thread segment for resuming thread execution. We present a real-time scheduling algorithm called AUA, and a distributable thread integrity protocol called TPTR. We show that AUA and TPTR bound the orphan cleanup and recovery time, thereby bounding thread starvation durations, and maximize the total thread accrued timeliness utility. We implement AUA and TPTR in a real-time middleware that supports distributable threads. Our experimental studies with the implementation validate the algorithm/protocol's time-bounded recovery property and confirm their effectiveness.}, keywords = { distributable thread, thread maintenance and recovery, time/utility function, utility accrual scheduling} } @MISC{andersoj:srds06-slides, key = {andersoj:srds06-slides}, author = {Jonathan S. Anderson and Edward Curley and Binoy Ravindran and E. Douglas Jensen}, title = {Real-time Recovery from Distributable Thread Failures}, year = {2006}, url = {http://andersoj.org/papers/realtime-dt-integrity-srds06.pdf}, month = {October}, note = {Foils for Jonathan's SRDS 2006 Presentation} } @MISC{andersoj:awinn-final-slides, key = {andersoj:awinn-final-slides}, author = {Jonathan S. Anderson and Binoy Ravindran}, title = {{AWINN} Task 2.2 Demonstration: Coastal Air Defense Scenario}, year = {2006}, url = {http://andersoj.org/papers/20060814-awinn-demo-v8.pdf}, month = {August}, note = {Foils for our final AWINN Demo Presentation} } @ARTICLE{andersoj:toc06, author = { Umut Balli and Haisang Wu and Binoy Ravindran and Jonathan Anderson and E. Douglas Jensen}, title = { Utility Accrual Real-Time Scheduling Under Variable Cost Functions}, journal = {IEEE Transactions on Computers (To Appear)}, year = { 2006}, url = { http://andersoj.org/papers/toc05-vcf.pdf}, abstract = {We present a utility accrual real-time scheduling algorithm called CIC-VCUA, for tasks whose execution times are functions of their starting times (and potentially other factors). We model such variable execution times using variable cost functions (or VCFs). The algorithm considers application activities that are subject to time/utility function time constraints, execution times described using VCFs, and mutual exclusion constraints on concurrent sharing of non-CPU resources. We consider the two-fold scheduling objective of (1) assure that the maximum interval between any two consecutive, successful completions of job instances in an activity must not exceed the activity period (an application-specific objective), and (2) maximizing the system's total accrued utility, while satisfying mutual exclusion resource constraints. Since the scheduling problem is intractable, CIC-VCUA is a polynomial-time heuristic algorithm. The algorithm statically computes worst-case task sojourn times, dynamically selects tasks for execution based on their potential utility density, and completes tasks at specific times. We establish that CIC-VCUA achieves optimal timeliness during under-loads, and tightly upper bounds inter- and intra-task completion times. Our simulation experiments confirm the algorithm's effectiveness and superiority. }, keywords = {variable-cost functions, time/utility functions, utility accrual scheduling, real-time scheduling, overload scheduling, dynamic scheduling, resource management, mutual exclusion} }