@inproceedings{19fb64f6b8334cc2927da639872d383e,
title = "Optimal implementation of wait-free binary relations",
abstract = "In this article we derive an algorithm for computing the {"}optimal{"} wait-free program on two processors that implements a given relation from the semantics of a small atomic read/write shared-memory parallel language. This algorithm is compared with the more general algorithm given in based on the participated set algorithm of. An extension to this is given, where we add a test\&set primitive to the previous language. This work is a natural follow up of.",
author = "Eric Goubault",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 7th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1997 ; Conference date: 14-04-1997 Through 18-04-1997",
year = "1997",
month = jan,
day = "1",
doi = "10.1007/bfb0030599",
language = "English",
isbn = "9783540627814",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "225--236",
editor = "Michel Bidoit and Michel Bidoit and Max Dauchet and Max Dauchet",
booktitle = "TAPSOFT 1997",
}