Optimal schedules for parallel prefix computation with bounded resources

Abstract

article Optimal schedules for parallel prefix computation with bounded resources Share on Authors: Alexandru Nicolau View Profile , Haigeng Wang View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 26Issue 7July 1991 pp 1–10https://doi.org/10.1145/109626.109627Published:01 April 1991 17citation290DownloadsMetricsTotal Citations17Total Downloads290Last 12 Months2Last 6 weeks0 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 SiteGet Access