Naming Ada tasks at run-time

Authors:
J. Cheng;K. Ushijma
Affiliations:
Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka 812, Japan;Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka 812, Japan
Venue:
ACM SIGAda Ada Letters
Year:
1989

Citing 4
Cited 3

ADA: Concurrent Programming

ADA: Concurrent Programming
Tasking communication deadlocks in concurrent Ada programs

ACM SIGAda Ada Letters
Saving traces for Ada debugging

SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada
TSL: task sequencing language

SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada

Deterministic execution testing of concurrent Ada programs

TRI-Ada '89 Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment
A survey of tasking deadlock detection methods

ACM SIGAda Ada Letters
A bibliography of parallel debuggers, 1990 edition

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new strategy for uniquely naming Ada tasks at run-time. The strategy has two features. First, it can easily be used to name tasks in their activations. Second, it does not impose a total order with respect to the start of activations and/or executions on the tasks to be named.