How “hard” is thread partitioning and how “bad” is a list scheduling based partitioning algorithm?
Xinan Tang, Guang R. Gao · 1998
Article Free Access Share on How “hard” is thread partitioning and how “bad” is a list scheduling based partitioning algorithm? Authors: Xinan Tang Department of Electrical and Computer Engineering, University of Delaware, Newark, Delaware Department of Electrical and Computer Engineering, University of Delaware, Newark, DelawareView Profile , Guang R. Gao Department of Electrical and Computer Engineering, University of Delaware, Newark, Delaware Department of Electrical and Computer Engineering, University of Delaware, Newark, DelawareView Profile Authors Info & Claims SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architecturesJune 1998 Pages 130–139https://doi.org/10.1145/277651.277679Published:01 June 1998Publication History 9citation731DownloadsMetricsTotal Citations9Total Downloads731Last 12 Months7Last 6 weeks1 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