Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog (Q1075767)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog |
scientific article |
Statements
Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog (English)
0 references
1984
0 references
logic programming
0 references
parallel programming
0 references
stream communication
0 references
dynamically changing set of processes
0 references
fair access to a shared resource
0 references
communication-stream based systems
0 references
fair merge operators
0 references
incomplete messages
0 references
distributed variant of the 2-3 tree deletion algorithm
0 references
