Integrating object-oriented programming and protected objects in Ada 95

Wellings, Andy; Johnson, B.; Sandén, Bo I.; Kienzle, Jörg; Wolf, Thomas; Michell, Stephen

doi:10.1145/564983.564984

Cited by 5 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The compiler includes the necessary operations in the locks. A protected type can have protected operations of three kinds: functions, procedures, and entries [12].…”

Section: Protected Objectsmentioning

confidence: 99%

The implementation of the Priority Ceiling Protocol in Ada-2005

Cheng

Ras

2007

Ada Lett.

View full text Add to dashboard Cite

show abstract

“…The compiler includes the necessary operations in the locks. A protected type can have protected operations of three kinds: functions, procedures, and entries [12].…”

Section: Protected Objectsmentioning

confidence: 99%

The implementation of the Priority Ceiling Protocol in Ada-2005

Cheng

Ras

2007

Ada Lett.

View full text Add to dashboard Cite

show abstract

“…Protected objects are standard objects where only a single method can be executed at any time. This approach is based on Ada protected objects [42], and the core concept itself comes from Monitors [16]. When coupled with tight data encapsulation within objects along the principles of components, it facilitates the identification of deadlocks and the management of concurrency.…”

Section: Compiler Support For Component Programmingmentioning

confidence: 99%

CAPSULE: Hardware-Assisted Parallel Execution of Component-Based Programs

Palatin

Lhuillier

Temam³

2006

2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06)

View full text Add to dashboard Cite

Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incentive to parallelize a broad range of applications, including those with complex control flow and data structures. And writing parallel programs is a notoriously difficult task. Beyond processor performance, the architect can help by facilitating the task of the programmer, especially by simplifying the model exposed to the programmer. In this article, among the many issues associated with writing parallel programs, we focus on finding the appropriate parallelism granularity, and efficiently mapping tasks with complex control and data flow to threads. We propose to relieve the user and compiler of both tasks by delegating the parallelization decision to the architecture at run-time, through a combination of hardware and software support and a tight dialogue between both. For the software support, we leverage an increasingly popular approach in software engineering, called component-based programming; the component contract assumes tight encapsulation of code and data for easy manipulation. Previous research works have shown that it is possible to augment components with the ability to split/spawn, providing a simple and fitting approach for programming parallel applications with complex control and data structures. However, such environments still require the programmer to determine the appropriate granularity of parallelism, and spawning incurs significant overheads due to software run-time system management. For that purpose, we provide an environment with the ability to spawn conditionally depending on available hardware resources, and we delegate spawning decisions and actions to the architecture. This conditional spawning is implemented through frequent hardware resource probing by the program. This, in turn, enables rapid adaptation to varying workload conditions, data sets and hardware resources. Furthermore, thanks to appropriate combined hardware and compiler support, the probing has no significant overhead on program performance. We demonstrate this approach on an 8-context SMT, several non-trivial algorithms and re-engineered SPEC CINT2000 benchmarks, written using component syntax processed by our toolchain. We achieve speedups ranging from 1.1 to 3.0 on our test suite.

show abstract

“…A mechanism for mutual exclusion found in Ada is the protected objects [28]. The objects are interesting since they are a source of non-determinism in the Ravenscar tasking profile, as will be explained below.…”

Section: Protected Objectsmentioning

confidence: 99%

Temporal skeletons for verifying time

2005

View full text Add to dashboard Cite

This paper presents an intermediate notation used in a framework for verification of real-time properties. The framework aims at overcoming the need for the framework user to have significant knowledge of the verification specific detail that formal verification at some level is bound to impose on a model. In order to accomplish this, model extraction from source code of an initial formal model, a timing skeleton, is made automatically.The model refinement needed to transform the temporal skeleton into a model that can be verified is not done immediately. This allows postponement of the abstraction and specialisation needed for the verification which further improves the readability of the skeleton. The purpose of the timing skeleton is that it easily can be validated to represent the source code it was created from. The timing skeleton is then automatically refined with verification detail, and then hidden for the user, transformed into the notation of a verification tool. This transformation is hidden from the user.In order to reduce the complexity of the application model the framework uses a formally verified run-time kernel with a clear separation from the application. The kernel supports preemption, dynamic priorities and multiple processors.

show abstract

Integrating object-oriented programming and protected objects in Ada 95

Cited by 5 publications

References 22 publications

The implementation of the Priority Ceiling Protocol in Ada-2005

The implementation of the Priority Ceiling Protocol in Ada-2005

CAPSULE: Hardware-Assisted Parallel Execution of Component-Based Programs

Temporal skeletons for verifying time

Contact Info

Product

Resources

About