Primitives for resource management in a demand-driven reduction model
Journal Article
·
· Int. J. Parallel Program.; (United States)
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
Similar Records
Processes, tasks, and monitors: a comparative study of concurrent programming primitives
Demand-driven interpretation of FP programs on a data-flow multiprocessor
Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives
Journal Article
·
Fri Jul 01 00:00:00 EDT 1983
· IEEE Trans. Software Eng.; (United States)
·
OSTI ID:5304386
Demand-driven interpretation of FP programs on a data-flow multiprocessor
Journal Article
·
Mon Aug 01 00:00:00 EDT 1988
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6902290
Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives
Patent
·
Tue Sep 16 00:00:00 EDT 2014
·
OSTI ID:1158797
Related Subjects
99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER CODES
COMPUTER GRAPHICS
COMPUTERIZED SIMULATION
CONTROL
DATA PROCESSING
DATA TRANSMISSION
DATA-FLOW PROCESSING
EFFICIENCY
EXECUTIVE CODES
GRAPHS
IMPLEMENTATION
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
PROGRAMMING LANGUAGES
SIMULATION
SYNCHRONIZATION
TASK SCHEDULING
990210* -- Supercomputers-- (1987-1989)
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER CODES
COMPUTER GRAPHICS
COMPUTERIZED SIMULATION
CONTROL
DATA PROCESSING
DATA TRANSMISSION
DATA-FLOW PROCESSING
EFFICIENCY
EXECUTIVE CODES
GRAPHS
IMPLEMENTATION
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
PROGRAMMING LANGUAGES
SIMULATION
SYNCHRONIZATION
TASK SCHEDULING