Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Primitives for resource management in a demand-driven reduction model

Journal Article · · Int. J. Parallel Program.; (United States)
DOI:https://doi.org/10.1007/BF01414555· OSTI ID:5271683
Graph reduction has recently become well-known as a suitable technique for implementing applicative languages. However, its use hitherto has been primarily in implementing determinate programs. This paper is concerned with extensions to a demand-driven graph reduction language for performing resource management, and entail indeterminate operations. Their focus is on primitives for programming the synchronization and scheduling of resources, as found, for example, in operating systems. They propose queueing operators and operators for controlling the order of execution of operations. They show that demand-driven graph reduction simplifies the implementation of resource management, especially in obviating explicit protocols for task creation and deletion, and for busy waiting. The language FGL (Function Graph Language) is first introduced, and the primitives are presented in this language. A number of examples are then presented to show the versatility of these primitives. The paper concludes with a brief sketch of a higher-level notation, called resource expressions, for specifying synchronization properties.
Research Organization:
Univ. of North Carolina, Chapel Hill (USA)
OSTI ID:
5271683
Journal Information:
Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 15:3; ISSN IJPPE
Country of Publication:
United States
Language:
English