Zobrazeno 1 - 10
of 438
pro vyhledávání: '"Martonosi, Margaret"'
The design space exploration of scaled-out manycores for communication-intensive applications (e.g., graph analytics and sparse linear algebra) is hampered due to either lack of scalability or accuracy of existing frameworks at simulating data-depend
Externí odkaz:
http://arxiv.org/abs/2312.10244
Autor:
Alexeev, Yuri, Amsler, Maximilian, Baity, Paul, Barroca, Marco Antonio, Bassini, Sanzio, Battelle, Torey, Camps, Daan, Casanova, David, Choi, Young Jai, Chong, Frederic T., Chung, Charles, Codella, Chris, Corcoles, Antonio D., Cruise, James, Di Meglio, Alberto, Dubois, Jonathan, Duran, Ivan, Eckl, Thomas, Economou, Sophia, Eidenbenz, Stephan, Elmegreen, Bruce, Fare, Clyde, Faro, Ismael, Fernández, Cristina Sanz, Ferreira, Rodrigo Neumann Barros, Fuji, Keisuke, Fuller, Bryce, Gagliardi, Laura, Galli, Giulia, Glick, Jennifer R., Gobbi, Isacco, Gokhale, Pranav, Gonzalez, Salvador de la Puente, Greiner, Johannes, Gropp, Bill, Grossi, Michele, Gull, Emanuel, Healy, Burns, Huang, Benchen, Humble, Travis S., Ito, Nobuyasu, Izmaylov, Artur F., Javadi-Abhari, Ali, Jennewein, Douglas, Jha, Shantenu, Jiang, Liang, Jones, Barbara, de Jong, Wibe Albert, Jurcevic, Petar, Kirby, William, Kister, Stefan, Kitagawa, Masahiro, Klassen, Joel, Klymko, Katherine, Koh, Kwangwon, Kondo, Masaaki, Kurkcuoglu, Doga Murat, Kurowski, Krzysztof, Laino, Teodoro, Landfield, Ryan, Leininger, Matt, Leyton-Ortega, Vicente, Li, Ang, Lin, Meifeng, Liu, Junyu, Lorente, Nicolas, Luckow, Andre, Martiel, Simon, Martin-Fernandez, Francisco, Martonosi, Margaret, Marvinney, Claire, Medina, Arcesio Castaneda, Merten, Dirk, Mezzacapo, Antonio, Michielsen, Kristel, Mitra, Abhishek, Mittal, Tushar, Moon, Kyungsun, Moore, Joel, Motta, Mario, Na, Young-Hye, Nam, Yunseong, Narang, Prineha, Ohnishi, Yu-ya, Ottaviani, Daniele, Otten, Matthew, Pakin, Scott, Pascuzzi, Vincent R., Penault, Ed, Piontek, Tomasz, Pitera, Jed, Rall, Patrick, Ravi, Gokul Subramanian, Robertson, Niall, Rossi, Matteo, Rydlichowski, Piotr, Ryu, Hoon, Samsonidze, Georgy, Sato, Mitsuhisa, Saurabh, Nishant, Sharma, Vidushi, Sharma, Kunal, Shin, Soyoung, Slessman, George, Steiner, Mathias, Sitdikov, Iskandar, Suh, In-Saeng, Switzer, Eric, Tang, Wei, Thompson, Joel, Todo, Synge, Tran, Minh, Trenev, Dimitar, Trott, Christian, Tseng, Huan-Hsin, Tureci, Esin, Valinas, David García, Vallecorsa, Sofia, Wever, Christopher, Wojciechowski, Konrad, Wu, Xiaodi, Yoo, Shinjae, Yoshioka, Nobuyuki, Yu, Victor Wen-zhe, Yunoki, Seiji, Zhuk, Sergiy, Zubarev, Dmitry
Publikováno v:
Future Generation Computer Systems, Volume 160, November 2024, Pages 666-710
Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of the
Externí odkaz:
http://arxiv.org/abs/2312.09733
Graph search and sparse data-structure traversal workloads contain challenging irregular memory patterns on global data structures that need to be modified atomically. Distributed processing of these workloads has relied on server threads operating o
Externí odkaz:
http://arxiv.org/abs/2311.15810
In recent years, the growing demand to process large graphs and sparse datasets has led to increased research efforts to develop hardware- and software-based architectural solutions to accelerate them. While some of these approaches achieve scalable
Externí odkaz:
http://arxiv.org/abs/2311.15443
Formal property verification (FPV) has existed for decades and has been shown to be effective at finding intricate RTL bugs. However, formal properties, such as those written as SystemVerilog Assertions (SVA), are time-consuming and error-prone to wr
Externí odkaz:
http://arxiv.org/abs/2309.09437
Autor:
Stein, Samuel, Sussman, Sara, Tomesh, Teague, Guinn, Charles, Tureci, Esin, Lin, Sophia Fuhui, Tang, Wei, Ang, James, Chakram, Srivatsan, Li, Ang, Martonosi, Margaret, Chong, Fred T., Houck, Andrew A., Chuang, Isaac L., DeMarco, Michael Austin
Noisy Intermediate-Scale Quantum Computing (NISQ) has dominated headlines in recent years, with the longer-term vision of Fault-Tolerant Quantum Computation (FTQC) offering significant potential albeit at currently intractable resource costs and quan
Externí odkaz:
http://arxiv.org/abs/2305.03243
Recent works have introduced task-based parallelization schemes to accelerate graph search and sparse data-structure traversal, where some solutions scale up to thousands of processing units (PUs) on a single chip. However parallelizing these memory-
Externí odkaz:
http://arxiv.org/abs/2304.09389
Autor:
Ang, James, Carini, Gabriella, Chen, Yanzhu, Chuang, Isaac, DeMarco, Michael Austin, Economou, Sophia E., Eickbusch, Alec, Faraon, Andrei, Fu, Kai-Mei, Girvin, Steven M., Hatridge, Michael, Houck, Andrew, Hilaire, Paul, Krsulich, Kevin, Li, Ang, Liu, Chenxu, Liu, Yuan, Martonosi, Margaret, McKay, David C., Misewich, James, Ritter, Mark, Schoelkopf, Robert J., Stein, Samuel A., Sussman, Sara, Tang, Hong X., Tang, Wei, Tomesh, Teague, Tubman, Norm M., Wang, Chen, Wiebe, Nathan, Yao, Yong-Xin, Yost, Dillon C., Zhou, Yiyu
Many proposals to scale quantum technology rely on modular or distributed designs where individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is
Externí odkaz:
http://arxiv.org/abs/2212.06167
Publikováno v:
2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA)
Applications with low data reuse and frequent irregular memory accesses, such as graph or sparse linear algebra workloads, fail to scale well due to memory bottlenecks and poor core utilization. While prior work with prefetching, decoupling, or pipel
Externí odkaz:
http://arxiv.org/abs/2207.13219
Autor:
Tang, Wei, Martonosi, Margaret
Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits to produce accurate results for problems at useful scales. Furthermore, classical simulations of quantum circuits generally do not scale. In
Externí odkaz:
http://arxiv.org/abs/2207.00933