dc.contributor.authorCao, Yangjie
dc.contributor.authorSun, Hongyang
dc.contributor.authorQian, Depei
dc.contributor.authorWu, Weiguo
dc.date.accessioned2013-10-18T03:15:06Z
dc.date.available2013-10-18T03:15:06Z
dc.date.copyright2012en_US
dc.date.issued2012
dc.identifier.citationCao, Y., Sun, H., Qian, D., & Wu, W. (2012). Stable Adaptive Work-Stealing for Concurrent Many-Core Runtime Systems. IEICE Transactions on Information and Systems, E95-D(5), 1407-1416.en_US
dc.identifier.urihttp://hdl.handle.net/10220/16589
dc.description.abstractThe proliferation of many-core architectures has led to the explosive development of parallel applications using programming models, such as OpenMP, TBB, and Cilk/Cilk++. With increasing number of cores, however, it becomes even harder to efficiently schedule parallel applications on these resources since current many-core runtime systems still lack effective mechanisms to support collaborative scheduling of these applications. In this paper, we study feedback-driven adaptive scheduling based on work stealing, which provides an efficient solution for concurrently executing a set of applications on many-core systems. To dynamically estimate the number of cores desired by each application, a stable feedback-driven adaptive algorithm, called SAWS, is proposed using active workers and the length of active deques, which well captures the runtime characteristics of the applications. Furthermore, a prototype system is built by extending the Cilk runtime system, and the experimental results, which are obtained on a Sun Fire server, show that SAWS has more advantages for scheduling concurrent parallel applications. Specifically, compared with existing algorithms A-Steal and WS-EQUI, SAWS improves the performances by up to 12.43% and 21.32% with respect to mean response time respectively, and 25.78% and 46.98% with respect to processor utilization, respectively.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesIEICE transactions on information and systemsen_US
dc.rights© 2012 Institute of Electronics, Information and Communication Engineers. This paper was published in IEICE transactions on information and systems and is made available as an electronic reprint (preprint) with permission of Institute of Electronics, Information and Communication Engineers. The paper can be found at the following official DOI: [http://dx.doi.org/10.1587/transinf.E95.D.1407]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.
dc.subjectDRNTU::Engineering::Computer science and engineering
dc.titleStable adaptive work-stealing for concurrent many-core runtime systemsen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1587/transinf.E95.D.1407
dc.description.versionPublished Version


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record