In this paper, we address the problem of automatically transforming arbitrary programs written for an ideal parallel machine to run on a completely asynchronous machine. We present a transformation which can be applied to an ideal program such that the resulting program's execution on an asynchronous machine is work and space efficient, relative to the ideal program from which it is derived. Above all, the transformation will guarantee that the ideal program will execute in a continually progressive manner on the asynchronous machine; these instructions are not universal. Furthermore, the individual processors can get delayed for arbitrary amounts of time while executing any instruction. In contrast, previous work relied either on the asynchronous machine having universal read-modify-write instructions as primitives, or on limited asynchrony by restricting the relative speeds of the processors.

Article Free Access Share on Combining tentative and definite executions for very fast dependable parallel computing Authors: Z. M. Kedem Ecole des Hautes Etudes en Informatique, Université René Descartes, 45, rue des Saints-Pères, 75006 Paris, France and Department of Computer Science, New York University, 251 Mercer St., New York, NY Ecole des Hautes Etudes en Informatique, Université René Descartes, 45, rue des Saints-Pères, 75006 Paris, France and Department of Computer Science, New York University, 251 Mercer St., New York, NYView Profile , K. V. Palem IBM Research Division, T. J. Watson Research Center, P. O. Box 704, Yorktown Heights, NY IBM Research Division, T. J. Watson Research Center, P. O. Box 704, Yorktown Heights, NYView Profile , A. Raghunathan Computer Science Division, University of California, Davis, CA and New York University Computer Science Division, University of California, Davis, CA and New York UniversityView Profile , P. G. Spirakis Computer Technology Institute, Patras University, P. O. Box 1122, 26110 Patras, Greece Computer Technology Institute, Patras University, P. O. Box 1122, 26110 Patras, GreeceView Profile Authors Info & Claims STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of ComputingJanuary 1991 Pages 381–390https://doi.org/10.1145/103418.103459Published:03 January 1991Publication History 57citation260DownloadsMetricsTotal Citations57Total Downloads260Last 12 Months14Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF