The Relationship Between Multiway and Two-Way Fair Merges
| dc.contributor.author | Shanbhogue, Vasant | en_US |
| dc.date.accessioned | 2007-04-23T17:49:05Z | |
| dc.date.available | 2007-04-23T17:49:05Z | |
| dc.date.issued | 1990-08 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 897822 bytes | |
| dc.format.extent | 448123 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1146 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6986 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | The Relationship Between Multiway and Two-Way Fair Merges | en_US |
| dc.type | technical report | en_US |