The Relationship Between Multiway and Two-Way Fair Merges

Other Titles
Abstract

In the context of communicating systems of autonomous processes, we study two kinds of processes - a two-way fair merge, that interleaves two possibly infinite sequences into one, and a multiway fair merge, that interleaves more than two possibly infinite sequences into one. We describe two constructions. The first one shows how the effect of any arbitrary number of two-way fair merges in a finite network can be exactly obtained by a single multiway fair merge and some determinate processes. The second one shows how the effect of a single multiway fair merge with any number of input channels can be exactly obtained by a finite network of two-way fair merges.

Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1990-08
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1146
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report
Accessibility Feature
Accessibility Hazard
Accessibility Summary
Link(s) to Catalog Record