Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog

DOI10.1007/BF03037058zbMath0592.68058MaRDI QIDQ1075767

Ehud Shapiro, Colin Mierowsky

Publication date: 1984

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

parallel programminglogic programmingcommunication-stream based systemsdistributed variant of the 2-3 tree deletion algorithmdynamically changing set of processesfair access to a shared resourcefair merge operatorsincomplete messagesstream communication

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items

Specification and initialization of a logic computer system

Cites Work

• Bounded-wait merge in Shapiro's concurrent Prolog
• Unnamed Item
• Unnamed Item
• Unnamed Item