Date of Original Version

10-1979

Type

Technical Report

Rights Management

All Rights Reserved

Abstract or Description

Traditional implementations of conditional critical regions and monitors can lead to unproductive "busy waiting" if processes are allowed to wait on arbitrary boolean expressions. Techniques from global flow analysis may be employed at compile time to obtain information about which critical regions (monitor calls) are enabled by the execution of a given critical region (monitor call). We investigate the complexity of computing this information and show how it can be used to obtain efficient scheduling algorithms with less busy waiting.

DOI

10.1109/SFCS.1979.5

Share

COinS
 

Published In

Foundations of Computer Science, 1979., 20th Annual Symposium on, 255-266.