Thumbnail
Access Restriction
Subscribed

Author Suleman, M. Aater ♦ Mutlu, Onur ♦ Patt, Yale N. ♦ Joao, José A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Multicore ♦ Critical sections ♦ Barriers ♦ Heterogeneous cmps ♦ Asymmetric cmps ♦ Pipeline parallelism
Abstract Performance of multithreaded applications is limited by a variety of bottlenecks, e.g. critical sections, barriers and slow pipeline stages. These bottlenecks serialize execution, waste valuable execution cycles, and limit scalability of applications. This paper proposes Bottleneck Identification and Scheduling in Multithreaded Applications (BIS), a cooperative software-hardware mechanism to identify and accelerate the most critical bottlenecks. BIS identifies which bottlenecks are likely to reduce performance by measuring the number of cycles threads have to wait for each bottleneck, and accelerates those bottlenecks using one or more fast cores on an Asymmetric Chip Multi-Processor (ACMP). Unlike previous work that targets specific bottlenecks, BIS can identify and accelerate bottlenecks regardless of their type. We compare BIS to four previous approaches and show that it outperforms the best of them by 15% on average. BIS' performance improvement increases as the number of cores and the number of fast cores in the system increase.
Description Affiliation: Calxeda Inc., Austin, TX, USA (Suleman, M. Aater) || The University of Texas at Austin, Austin, TX, USA (Joao, José A.; Patt, Yale N.) || Carnegie Mellon University, Pittsburgh, PA, USA (Mutlu, Onur)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 47
Issue Number 4
Page Count 12
Starting Page 223
Ending Page 234


Open content in new tab

   Open content in new tab
Source: ACM Digital Library