A compile-time optimization framework for Ada rendezvous

Authors:
Hongmin Lu;Yuming Zhou;Jiangtao Lu;Baowen Xu
Affiliations:
Southeast University, Nanjing;Tsinghua University, Beijing;Guangxi Normal University, Guilin;Southeast University, Nanjing
Venue:
ACM SIGPLAN Notices
Year:
2004

Citing 6
Cited 0

Non-concurrency analysis

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Extracting task-level parallelism

ACM Transactions on Programming Languages and Systems (TOPLAS)
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Transforming Ada serving tasks into protected objects

Proceedings of the 1998 annual ACM SIGAda international conference on Ada
An efficient algorithm for computing MHP information for concurrent Java programs

ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Detecting concurrently executed pairs of statements using an adapted MHP algorithm

Proceedings of the 2001 annual ACM SIGAda international conference on Ada

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rendezvous is the basic synchronous communication mechanism used by tasks, which causes tasks blocked under some circumstances. Holding the semantics of the rendezvous, this paper uses semaphores to transform the entry call and accept statement pairs and makes tasks execute some statements during the blocked time because of waiting for the beginning or end of a rendezvous. Therefore, the parallelism between the client and the server is improved.