Sanya Srivastava
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sanya Srivastava has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Vijay Nagarajan
University of Utah, Salt Lake City, USA
2 shared publications - Andrés Goens
TU Darmstadt, Darmstadt, Germany
1 shared publication - Daniel J. Sorin
Duke University
1 shared publication - Fletch Rydell
Duke University, Durham, NC, USA
1 shared publication - Reese Levine
University of California at Santa Cruz, Santa Cruz, USA
1 shared publication - Ryan Stutsman
University of Utah, Salt Lake City, USA
1 shared publication
Latest Publications
- Open Access
- 11 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 66-79
Consistency and Coherence of the NVIDIA Grace-Hopper Superchip
- 11 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 66-79
Open AccessConsistency and Coherence of the NVIDIA Grace-Hopper Superchip
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (2) , 305-308
Efficient Deadlock Avoidance by Considering Stalling, Message Dependencies, and Topology
Traditional schemes for avoiding deadlocks compose techniques for both protocol deadlocks (virtual networks) and network deadlocks (virtual channels). Recent work has shown how to use fewer virtual networks by analyzing protocol stalls instead of just considering the longest chain of causally dependent messages. We identify a shortcoming in this work, which can lead to deadlocks, and show that combining stall analysis with analyses of message dependencies and topology can avoid deadlocks while using fewer buffers than the conventional approach.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 24 (2) , 305-308
Efficient Deadlock Avoidance by Considering Stalling, Message Dependencies, and Topology
Traditional schemes for avoiding deadlocks compose techniques for both protocol deadlocks (virtual networks) and network deadlocks (virtual channels). Recent work has shown how to use fewer virtual networks by analyzing protocol stalls instead of just considering the longest chain of causally dependent messages. We identify a shortcoming in this work, which can lead to deadlocks, and show that combining stall analysis with analyses of message dependencies and topology can avoid deadlocks while using fewer buffers than the conventional approach.