Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Rodrigues Carvalho, Daniel"'
Autor:
Lowe-Power, Jason, Ahmad, Abdul, Armejach, Adria, Herrera, Adrian, Roelke, Alec, Farmahini-Farahani, Amin, Mondelli, Andrea, Hansson, Andreas, Sandberg, Andreas, Gutierrez, Anthony, Harris, Austin, Akram, Ayaz, Hanindhito, Bagus, Pham, Binh, Bruce, Bobby, Shingarov, Boris, Beckmann, Brad, Escuin, Carlos, Menard, Christian, Weis, Christian, Rodrigues Carvalho, Daniel, Wood, David, Gope, Dibakar, Zulian, Éder, Black, Gabe, Bloom, Gedare, Travaglini, Giacomo, Khaleghzadeh, Hamidreza, Jang, Hanhwi, Nguyen, Hoa, Yoon, Hongil, Vougioukas, Ilias, Setoain, Javier, Gandhi, Jayneel, Castrillon, Jeronimo, Nathella, Krishnendra, Olson, Lena, Chen, Lizhong, Samani, Mahyar, Orr, Marc, Fariborz, Marjan, Andreozzi, Matteo, Sinclair, Matthew, Horsnell, Matthew, Jung, Matthias, Upton, Michael, Moreto, Miquel, Alian, Mohammad, Derumigny, Nicolas, Nikoleris, Nikos, Vaish, Nilay, Asmussen, Nils, Wehn, Norbert, Naji, Omar, Prieto, Pablo, Fotouhi, Pouya, Jagtap, Radhika, Thakur, Rahul, Jafri, Raza, Jeyapaul, Reiley, Amslinger, Rico, Gambord, Ryan, Bharadwaj, Srikant, Diestelhorst, Stephan, Kannoth, Subash, Haria, Swapnil, Ali, Syed, Grass, Thomas, Mück, Tiago, Hayes, Timothy, Jones, Timothy, Marinelli, Tommaso, Reddy, Trivikram, Ta, Tuan, Krishna, Tushar, Elsasser, Wendy, Wang, William, Kodama, Yuetsu, Wang, Zhengrong
The open-source and community-supported gem5 simulator is one of the most popular tools for computer architecture research. This simulation infrastructure allows researchers to model modern computer hardware at the cycle level, and it has enough fide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::db24271bddc402330356989413710181
https://inria.hal.science/hal-03100818/document
https://inria.hal.science/hal-03100818/document
Publikováno v:
ICCD 2021-39th IEEE International Conference on Computer Design
ICCD 2021-39th IEEE International Conference on Computer Design, Oct 2021, Virtual, United States. pp.1-5
ICCD 2021-39th IEEE International Conference on Computer Design, Oct 2021, Virtual, United States. pp.1-5
International audience; Cache compression algorithms must abide by hardware constraints; thus, their efficiency ends up being low, and most cache lines end up barely compressed. Moreover, schemes that compress relatively well often decompress slowly,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65b5082a42551f507ef370062052b463
https://hal.inria.fr/hal-03354883
https://hal.inria.fr/hal-03354883
Publikováno v:
SAMOS XXI 2021-International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation
SAMOS XXI 2021-International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, Jul 2021, Samos, Greece. pp.1-13
SAMOS XXI 2021-International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, Jul 2021, Samos, Greece. pp.1-13
Virtual Conference; International audience; Compressed cache layouts require adding the block's size information to the metadata array. This field can be either constrained - in which case compressed blocks must fit in predetermined sizes; thus, it r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::00b6d0f27a3fc62571c04ed017e4a08c
https://hal.inria.fr/hal-03284824/document
https://hal.inria.fr/hal-03284824/document
Autor:
Rodrigues Carvalho, Daniel
Publikováno v:
Other [cs.OH]. Université de Rennes 1, 2021. English
Other [cs.OH]. Université de Rennes 1, 2021. English. ⟨NNT : ⟩
Other [cs.OH]. Université de Rennes 1, 2021. English. ⟨NNT : ⟩
Hardware compression techniques are typically simplifications of software compression methods. They must, however, comply with area, power and latency constraints. This study unveils the challenges of adopting compression in memory design. The goal o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c73dc025254cffaeb31015d18599cab5
https://hal.inria.fr/tel-03454941
https://hal.inria.fr/tel-03454941