Publication: Object placement for high bandwidth memory augmented with high capacity memory
dc.contributor.coauthor | N/A | |
dc.contributor.department | N/A | |
dc.contributor.department | Department of Computer Engineering | |
dc.contributor.kuauthor | Laghari, Mohammad | |
dc.contributor.kuauthor | Erten, Didem Unat | |
dc.contributor.kuprofile | Master Student | |
dc.contributor.kuprofile | Faculty Member | |
dc.contributor.other | Department of Computer Engineering | |
dc.contributor.schoolcollegeinstitute | Graduate School of Sciences and Engineering | |
dc.contributor.schoolcollegeinstitute | College of Engineering | |
dc.contributor.yokid | N/A | |
dc.contributor.yokid | 219274 | |
dc.date.accessioned | 2024-11-10T00:11:55Z | |
dc.date.issued | 2017 | |
dc.description.abstract | High bandwidth memory (HBM) is a new emerging technology that aims to improve the performance of bandwidth limited applications. Even though it provides high bandwidth, it must be augmented with DRAM to meet the memory capacity requirement of any applications. Due to this limitation, objects in an application should be optimally placed on the heterogeneous memory subsystems. In this study, we propose an object placement algorithm that places program objects to fast or slow memories in case the capacity of fast memory is insufficient to hold all the objects to increase the overall application performance. Our algorithm uses the reference counts and type of references (read or write) to make an initial placement of data. In addition, we perform various memory bandwidth benchmarks to be used in our placement algorithm on Intel Knights Landing (KNL) architecture. Not surprisingly high bandwidth memory sustains higher read bandwidth than write bandwidth, however, placing write-intensive data on HBM results in better overall performance because write-intensive data is punished by the DRAM speed more severely compared to read intensive data. Moreover, our benchmarks demonstrate that if a basic block makes references to both types of memories, it performs worse than if it makes references to only one type of memory in some cases. We test our proposed placement algorithm with 6 applications under various system configurations. By allocating objects according to our placement scheme, we are able to achieve a speedup of up to 2x. | |
dc.description.indexedby | WoS | |
dc.description.indexedby | Scopus | |
dc.description.openaccess | NO | |
dc.description.sponsoredbyTubitakEu | TÜBİTAK | |
dc.description.sponsorship | TUBITAK [215E185, 116C066] Dr. Unat is supported by TUBITAK with project number 116C066. Authors from Koc University are supported by TUBITAK Grant No: 215E185. Authors would like to thank Dr. Pietro Cicotti from San Diego Supercomputer Center for his input in project. | |
dc.identifier.doi | 10.1109/SBAC-PAD.2017.24 | |
dc.identifier.isbn | 978-1-5090-1233-6 | |
dc.identifier.issn | 1550-6533 | |
dc.identifier.scopus | 2-s2.0-85041180497 | |
dc.identifier.uri | http://dx.doi.org/10.1109/SBAC-PAD.2017.24 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14288/17566 | |
dc.identifier.wos | 426895600017 | |
dc.keywords | High bandwidth memory | |
dc.keywords | Object placement | |
dc.keywords | Mcdram | |
dc.keywords | Dram | |
dc.keywords | Knl phase-change memory | |
dc.language | English | |
dc.publisher | IEEE | |
dc.source | IEEE 29th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD) | |
dc.subject | Computer science | |
dc.subject | Hardware and architecture | |
dc.subject | Engineering | |
dc.subject | Electrical and electronic engineering | |
dc.title | Object placement for high bandwidth memory augmented with high capacity memory | |
dc.type | Conference proceeding | |
dspace.entity.type | Publication | |
local.contributor.authorid | N/A | |
local.contributor.authorid | 0000-0002-2351-0770 | |
local.contributor.kuauthor | Laghari, Mohammad | |
local.contributor.kuauthor | Erten, Didem Unat | |
relation.isOrgUnitOfPublication | 89352e43-bf09-4ef4-82f6-6f9d0174ebae | |
relation.isOrgUnitOfPublication.latestForDiscovery | 89352e43-bf09-4ef4-82f6-6f9d0174ebae |