The use of object-based mechanisms, i.e., abstract data types (ADTs), for constructing software systems can help to decrease development costs, increase understandability and increase maintainability. However, execution efficiency may be sacrificed due to the large number of procedure calls, and due to contention for shared ADTs in concurrent systems. Such inefficiencies are a concern in real-time applications that have stringent timing requirements. To address these issues, the potentially inefficient procedure calls are turned into a source of concurrency via asynchronous procedure calls (ARPCs), and contention for shared ADTS is reduced via ADT cloning. A framework for concurrency analysis in object-based systems is developed, and compil...
This paper presents language constructs for the expression of timing and concurrency requirements in...
Concurrent object-oriented programming systems require support for concurrency control, to enforce c...
International audienceWe study the problem of automatically computing the time complexity of concurr...
The use of object-based mechanisms, i.e., abstract data types (ADTs), for constructing software syst...
The construct of Abstract Data Type (ADT) modules and Abstract Data Object (ADO) modules supported b...
Concurrent real-time applications are complicated since both timing and consistency constraints must...
Concurrency control algorithms use a conflict detection strategy to determine operations that have ...
Advanced software systems utilize highly structured, complex data that can be effectively represente...
The proliferation of shared mutable state in object-oriented programming complicates software develo...
Approved for public release; distribution unlimited Acknowledgments This thesis would not have been ...
Advanced software systems utilize highly structured, complex data that can be effectively represente...
In this thesis, we investigate some of the options programmers have when writing a concurrent progra...
This paper presents language constructs for the expression of timing and concurrency requirements in...
The problem of schedulability analysis of a set of real time programs form a NP complete problem. Th...
PhD ThesisModern computing systems support concurrency as a means of increasing the performance o...
This paper presents language constructs for the expression of timing and concurrency requirements in...
Concurrent object-oriented programming systems require support for concurrency control, to enforce c...
International audienceWe study the problem of automatically computing the time complexity of concurr...
The use of object-based mechanisms, i.e., abstract data types (ADTs), for constructing software syst...
The construct of Abstract Data Type (ADT) modules and Abstract Data Object (ADO) modules supported b...
Concurrent real-time applications are complicated since both timing and consistency constraints must...
Concurrency control algorithms use a conflict detection strategy to determine operations that have ...
Advanced software systems utilize highly structured, complex data that can be effectively represente...
The proliferation of shared mutable state in object-oriented programming complicates software develo...
Approved for public release; distribution unlimited Acknowledgments This thesis would not have been ...
Advanced software systems utilize highly structured, complex data that can be effectively represente...
In this thesis, we investigate some of the options programmers have when writing a concurrent progra...
This paper presents language constructs for the expression of timing and concurrency requirements in...
The problem of schedulability analysis of a set of real time programs form a NP complete problem. Th...
PhD ThesisModern computing systems support concurrency as a means of increasing the performance o...
This paper presents language constructs for the expression of timing and concurrency requirements in...
Concurrent object-oriented programming systems require support for concurrency control, to enforce c...
International audienceWe study the problem of automatically computing the time complexity of concurr...