An analysis of the performance impacts of lookahead execution in the conversation scheme
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The lookahead execution approach, which allows early finishing participant processes to exit from a conversation before other participants finish their conversation activities, is adopted as a fundamental approach to reducing the synchronization overhead. Queueing network models are developed for both the system operating under the basic conversation scheme and the system operating under the conversation scheme extended with the lookahead capability. Based on the models, various performance indicators such as the system throughput, the average number of processors idling inside a conversation due to the synchronization required, and the average time spent in a conversation are evaluated numerically for different application environments. The performances under the extended scheme are compared to those under the basic conversation scheme. The results provide insights into the extent of benefits that can be brought in by the lookahead execution approach.<>Keywords
This publication has 8 references indexed in Scilit:
- Fault-Tolerant ComputingPublished by Elsevier ,1987
- PRACTICAL FAULT TOLERANT SOFTWARE FOR ASYNCHRONOUS SYSTEMSPublished by Elsevier ,1983
- A flexible distributed testbed for real-time applicationsComputer, 1982
- Approaches to Mechanization of the Conversation Scheme Based on MonitorsIEEE Transactions on Software Engineering, 1982
- Application of a Methodology for the Development and Validation of Reliable Process Control SoftwareIEEE Transactions on Software Engineering, 1981
- Ballistic Missile Defense: A Supercomputer ChallengeComputer, 1980
- Fault-Tolerant Software for Real-Time ApplicationsACM Computing Surveys, 1976
- System structure for software fault toleranceIEEE Transactions on Software Engineering, 1975