Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/11712
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKarman, N.-
dc.contributor.authorWei, K.-
dc.contributor.authorScott, D.-
dc.contributor.authorRatnasegar, N.-
dc.contributor.authorCanpolat, O.-
dc.contributor.authorMai, H.-
dc.contributor.authorFerdman, M.-
dc.date.accessioned2024-08-18T17:23:07Z-
dc.date.available2024-08-18T17:23:07Z-
dc.date.issued2024-
dc.identifier.isbn979-835037638-8-
dc.identifier.urihttps://doi.org/10.1109/ISPASS61541.2024.00043-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/11712-
dc.descriptionAMD; IEEE Computer Society; IEEE Computer Society Technical Committee on Computer Architecture; IEEE Computer Society Technical Community on Microprogramming and Microarchitecture (TCuARCH); Intel; NSFen_US
dc.description2024 IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2024 -- 5 May 2024 through 7 May 2024 - Indianapolis -- 201090en_US
dc.description.abstractSingle-Instruction Multiple-Thread (SIMT) computing has enabled a revolution in graphics, high-performance computing, and artificial intelligence. However, despite its benefits in these domains, SIMT processing has been relegated to accelerators rather than becoming a feature of general-purpose computing. Although a number of recent works have explored the potential benefits of 'G PSIMT,' current research infrastructures to study high performance general-purpose CPUs provide no support for the SIMT architecture and its programming model. This work presents our initial efforts toward developing a full-system GPSIMT research infrastructure. We first describe how we extend the QEMU emulator with SIMT features, enabling ISA pathfinding for GPSIMT hardware and providing a platform for the rapid development of system software for GPSIMT. We then present our approach to leveraging the Chip yard hardware gen-eration framework to develop a full-system GPSIMT exploration platform on an FPGA by extending the RISC- V Rocket Core. © 2024 IEEE.en_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.relation.ispartofProceedings - 2024 IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2024en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectmultithreaded architectureen_US
dc.subjectparallel processingen_US
dc.subjectsimulation techniquesen_US
dc.subjectGeneral purpose computersen_US
dc.subjectParallel architecturesen_US
dc.subjectProgram processorsen_US
dc.subject'currenten_US
dc.subjectGeneral purpose processorsen_US
dc.subjectGeneral-purpose computingen_US
dc.subjectMultiple threadsen_US
dc.subjectMultithreaded architectureen_US
dc.subjectParallel processingen_US
dc.subjectPerformance computingen_US
dc.subjectPotential benefitsen_US
dc.subjectResearch infrastructureen_US
dc.subjectSimulation techniqueen_US
dc.subjectRocketsen_US
dc.titleInfrastructure for Exploring SIMT Architecture in General-Purpose Processorsen_US
dc.typeConference Objecten_US
dc.departmentTOBB ETÜen_US
dc.identifier.startpage316en_US
dc.identifier.endpage318en_US
dc.identifier.scopus2-s2.0-85199880284en_US
dc.institutionauthor-
dc.identifier.doi10.1109/ISPASS61541.2024.00043-
dc.authorscopusid59237893900-
dc.authorscopusid59237737500-
dc.authorscopusid59238498300-
dc.authorscopusid59238791400-
dc.authorscopusid59121440600-
dc.authorscopusid58248906500-
dc.authorscopusid16070073900-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.grantfulltextnone-
item.openairetypeConference Object-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Show simple item record



CORE Recommender

Page view(s)

48
checked on Sep 16, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.