Nadathur Satish

6.9k total citations · 2 hit papers
52 papers, 4.2k citations indexed

About

Nadathur Satish is a scholar working on Computer Networks and Communications, Hardware and Architecture and Computer Vision and Pattern Recognition. According to data from OpenAlex, Nadathur Satish has authored 52 papers receiving a total of 4.2k indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computer Networks and Communications, 28 papers in Hardware and Architecture and 20 papers in Computer Vision and Pattern Recognition. Recurrent topics in Nadathur Satish's work include Parallel Computing and Optimization Techniques (25 papers), Advanced Data Storage Technologies (17 papers) and Graph Theory and Algorithms (15 papers). Nadathur Satish is often cited by papers focused on Parallel Computing and Optimization Techniques (25 papers), Advanced Data Storage Technologies (17 papers) and Graph Theory and Algorithms (15 papers). Nadathur Satish collaborates with scholars based in United States, United Kingdom and India. Nadathur Satish's co-authors include Pradeep Dubey, Jatin Chhugani, Changkyu Kim, Narayanan Sundaram, Anthony D. Nguyen, Mark Harris, Michael Garland, Victor W. Lee, Daehyun Kim and Margaret Martonosi and has published in prestigious journals such as Communications of the ACM, SIAM Journal on Scientific Computing and IEEE Transactions on Parallel and Distributed Systems.

In The Last Decade

Nadathur Satish

52 papers receiving 4.0k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Debunking the 100X GPU vs. CPU myth

2010 452 citations Victor W. Lee, Changkyu Kim et al. profile →
Designing efficient sorting algorithms for manycore GPUs

2009 395 citations Nadathur Satish, Mark Harris et al. profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author						Papers	Cites
Nadathur Satish	2.4k	2.1k	1.4k	1.1k	885	52	4.2k
Naga K. Govindaraju	2.4k 1.0×	1.8k 0.9×	1.8k 1.3×	982 0.9×	1.0k 1.2×	80	5.5k
Jatin Chhugani	1.7k 0.7×	1.3k 0.6×	721 0.5×	644 0.6×	483 0.5×	39	3.0k
Andrew Lumsdaine	2.2k 0.9×	1.9k 0.9×	1.6k 1.2×	1.1k 1.0×	1000 1.1×	241	5.3k
Changkyu Kim	3.2k 1.3×	2.7k 1.3×	567 0.4×	535 0.5×	572 0.6×	56	4.2k
Torsten Hoefler	3.5k 1.5×	2.7k 1.3×	819 0.6×	1.2k 1.0×	1.2k 1.4×	301	5.8k
Gagan Agrawal	2.3k 1.0×	1.2k 0.6×	438 0.3×	930 0.8×	1.7k 1.9×	309	4.6k
Anthony Skjellum	2.2k 0.9×	1.6k 0.8×	251 0.2×	650 0.6×	997 1.1×	165	3.9k
Manish Parashar	4.9k 2.0×	1000 0.5×	402 0.3×	917 0.8×	2.7k 3.0×	391	6.2k
Xipeng Shen	2.3k 1.0×	2.3k 1.1×	1.3k 1.0×	2.3k 2.0×	1.5k 1.7×	213	5.3k
Franck Cappello	4.2k 1.7×	2.3k 1.1×	660 0.5×	1.3k 1.1×	1.3k 1.4×	238	5.5k

Countries citing papers authored by Nadathur Satish

Since Specialization

Citations

This map shows the geographic impact of Nadathur Satish's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nadathur Satish with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nadathur Satish more than expected).

Fields of papers citing papers by Nadathur Satish

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nadathur Satish. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nadathur Satish. The network helps show where Nadathur Satish may publish in the future.

Co-authorship network of co-authors of Nadathur Satish

This figure shows the co-authorship network connecting the top 25 collaborators of Nadathur Satish. A scholar is included among the top collaborators of Nadathur Satish based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nadathur Satish. Nadathur Satish is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ham, Tae Jun, Lisa Wu, Narayanan Sundaram, Nadathur Satish, & Margaret Martonosi. (2016). Graphicionado: a high-performance and energy-efficient accelerator for graph analytics. International Symposium on Microarchitecture. 1–13. 127 indexed citations

Dulloor, Subramanya R., Amitabha Roy, Zheguang Zhao, et al.. (2016). Data tiering in heterogeneous memory systems. 1–16. 151 indexed citations

Anderson, Michael J., Narayanan Sundaram, Nadathur Satish, et al.. (2016). GraphPad: Optimized Graph Primitives for Parallel and Distributed Platforms. 313–322. 38 indexed citations

Khan, Arif, Alex Pothen, Mostofa Patwary, et al.. (2016). Efficient Approximation Algorithms for Weighted $b$-Matching. SIAM Journal on Scientific Computing. 38(5). S593–S619. 24 indexed citations

Patwary, Md. Mostofa Ali, Nadathur Satish, Narayanan Sundaram, et al.. (2016). PANDA: Extreme Scale Parallel K-Nearest Neighbor on Distributed Architectures. arXiv (Cornell University). 494–503. 26 indexed citations

Patwary, Md. Mostofa Ali, Nadathur Satish, Narayanan Sundaram, et al.. (2015). Parallel Efficient Sparse Matrix-Matrix Multiplication on Multicore Platforms.. 48–57. 2 indexed citations

Patwary, Md. Mostofa Ali, Nadathur Satish, Narayanan Sundaram, et al.. (2014). Pardicle: Parallel Approximate Density-Based Clustering. 560–571. 26 indexed citations

Satish, Nadathur, Narayanan Sundaram, Md. Mostofa Ali Patwary, et al.. (2014). Navigating the maze of graph analytics frameworks using massive graph datasets. Scholarworks@UNIST (Ulsan National Institute of Science and Technology). 979–990. 126 indexed citations

Sundaram, Narayanan, et al.. (2013). Streaming Similarity Search over One Billion Tweets Using Parallel Locality-Sensitive Hashing. DSpace@MIT (Massachusetts Institute of Technology). 1 indexed citations

10.

Satish, Nadathur, Changkyu Kim, Jatin Chhugani, & Pradeep Dubey. (2012). Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing. IEEE International Conference on High Performance Computing, Data, and Analytics. 1–11. 31 indexed citations

11.

Kim, Changkyu, Nadathur Satish, Jatin Chhugani, et al.. (2012). Closing the Ninja Performance Gap through Traditional Programming and Compiler Technology. 13 indexed citations

12.

Smelyanskiy, Mikhail, Jason Sewall, Dhiraj Kalamkar, et al.. (2012). Analysis and Optimization of Financial Analytics Benchmark on Modern Multi- and Many-core IA-Based Architectures. 1154–1162. 9 indexed citations

13.

Satish, Nadathur, Changkyu Kim, Jatin Chhugani, et al.. (2012). Can traditional programming bridge the Ninja performance gap for parallel computing applications?. ACM SIGARCH Computer Architecture News. 40(3). 440–451. 60 indexed citations

14.

Krueger, Jens, Changkyu Kim, Martin Grund, et al.. (2011). Fast updates on read-optimized databases using multi-core CPUs. Proceedings of the VLDB Endowment. 5(1). 61–72. 85 indexed citations

15.

Sewall, Jason, Jatin Chhugani, Changkyu Kim, Nadathur Satish, & Pradeep Dubey. (2011). PALM. Proceedings of the VLDB Endowment. 4(11). 795–806. 74 indexed citations

16.

Kim, Changkyu, Jatin Chhugani, Nadathur Satish, et al.. (2011). Designing fast architecture-sensitive tree search on modern multicore/many-core processors. ACM Transactions on Database Systems. 36(4). 1–34. 14 indexed citations

17.

Nguyen, Anthony D., Nadathur Satish, Jatin Chhugani, Changkyu Kim, & Pradeep Dubey. (2010). 3.5-D Blocking Optimization for Stencil Computations on Modern CPUs and GPUs. 1–13. 197 indexed citations

18.

Kim, Changkyu, Jatin Chhugani, Nadathur Satish, et al.. (2010). FAST. 339–350. 216 indexed citations

19.

Satish, Nadathur, Mark Harris, & Michael Garland. (2009). Designing efficient sorting algorithms for manycore GPUs. 1–10. 395 indexed citations breakdown →

20.

Satish, Nadathur, Kaushik Ravindran, & Kurt Keutzer. (2007). A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors. 57–62. 29 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact