Towards complexity metrics for Ada tasking |
| |
| Authors: | Shatz SM |
| |
| Affiliation: | Dept. of Elect. Eng. & Comput. Sci., Illinois Univ., Chicago, IL; |
| |
| Abstract: | Using Ada as a representative distributed programming language, the author discusses some ideas on complexity metrics that focus on Ada tasking and rendezvous. Concurrently active rendezvous are claimed to be an important aspect of communication complexity. A Petri net graph model of Ada rendezvous is used to introduce a rendezvous graph, an abstraction that can be useful in viewing and computing effective communication complexity |
| |
| Keywords: | |
|
|
