P. Sadayappan

13.5k total citations · 1 hit paper
347 papers, 7.5k citations indexed

About

P. Sadayappan is a scholar working on Hardware and Architecture, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, P. Sadayappan has authored 347 papers receiving a total of 7.5k indexed citations (citations by other indexed papers that have themselves been cited), including 262 papers in Hardware and Architecture, 237 papers in Computer Networks and Communications and 53 papers in Artificial Intelligence. Recurrent topics in P. Sadayappan's work include Parallel Computing and Optimization Techniques (249 papers), Distributed and Parallel Computing Systems (128 papers) and Advanced Data Storage Technologies (106 papers). P. Sadayappan is often cited by papers focused on Parallel Computing and Optimization Techniques (249 papers), Distributed and Parallel Computing Systems (128 papers) and Advanced Data Storage Technologies (106 papers). P. Sadayappan collaborates with scholars based in United States, France and India. P. Sadayappan's co-authors include J. Ramanujam, Uday Bondhugula, Louis-Noël Pouchet, Albert Hartono, Sriram Krishnamoorthy, Atanas Rountev, Fikret Erçal, Muthu Manikandan Baskaran, Qingda Lu and James Dinan and has published in prestigious journals such as Proceedings of the IEEE, Journal of Computational Physics and The Journal of Physical Chemistry A.

In The Last Decade

P. Sadayappan

324 papers receiving 7.1k 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.

A practical automatic polyhedral parallelizer and locality optimizer

2008 518 citations J. Ramanujam, P. Sadayappan et al. profile →

Author Peers

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

Author						Papers	Cites
P. Sadayappan	5.5k	5.0k	1.2k	1.2k	780	347	7.5k
Katherine Yelick	5.0k 0.9×	4.7k 0.9×	851 0.7×	866 0.7×	836 1.1×	149	6.8k
Richard Vuduc	2.5k 0.5×	2.0k 0.4×	495 0.4×	711 0.6×	452 0.6×	132	3.7k
Samuel Williams	3.3k 0.6×	2.9k 0.6×	574 0.5×	688 0.6×	910 1.2×	135	5.4k
Robert A. Geijn	2.8k 0.5×	2.3k 0.5×	300 0.2×	767 0.6×	517 0.7×	148	4.2k
J. Ramanujam	3.2k 0.6×	2.6k 0.5×	392 0.3×	661 0.5×	442 0.6×	178	4.2k
Marc Snir	3.5k 0.6×	4.8k 1.0×	898 0.7×	1.4k 1.1×	942 1.2×	181	7.3k
Piotr Łuszczek	2.0k 0.4×	1.6k 0.3×	585 0.5×	331 0.3×	411 0.5×	137	3.1k
Stanimire Tomov	2.1k 0.4×	1.5k 0.3×	321 0.3×	456 0.4×	408 0.5×	188	3.6k
Andrew Lumsdaine	1.9k 0.3×	2.2k 0.4×	1000 0.8×	1.1k 0.9×	530 0.7×	241	5.3k
Naga K. Govindaraju	1.8k 0.3×	2.4k 0.5×	1.0k 0.8×	982 0.8×	303 0.4×	80	5.5k

Countries citing papers authored by P. Sadayappan

Since Specialization

Citations

This map shows the geographic impact of P. Sadayappan'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 P. Sadayappan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites P. Sadayappan more than expected).

Fields of papers citing papers by P. Sadayappan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by P. Sadayappan. 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 P. Sadayappan. The network helps show where P. Sadayappan may publish in the future.

Co-authorship network of co-authors of P. Sadayappan

This figure shows the co-authorship network connecting the top 25 collaborators of P. Sadayappan. A scholar is included among the top collaborators of P. Sadayappan 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 P. Sadayappan. P. Sadayappan 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

Rastello, Fabrice, et al.. (2025). How effective is matrix reordering for improving performance of sparse matrix-vector multiplication?. 823–827.

Panyala, Ajay, et al.. (2025). Guiding Application Users via Estimation of Computational Resources for Massively Parallel Chemistry Computations. 11–19.

Rajamanickam, Sivasankaran, et al.. (2025). Distributed Sparse Tensor Computations in MLIR. 1088–1095.

Rountev, Atanas, et al.. (2025). FaSTCC: Fast Sparse Tensor Contractions on CPUs. 617–630.

Li, Chendi, et al.. (2024). Accelerated Auto-Tuning of GPU Kernels for Tensor Computations. 549–561.

Kong, Martin, et al.. (2023). Automatic Generation of Distributed-Memory Mappings for Tensor Computations. 1–13. 2 indexed citations

Nisa, Israt, Jiajia Li, Aravind Sukumaran-Rajam, Richard Vuduc, & P. Sadayappan. (2019). Load-Balanced Sparse MTTKRP on GPUs. 123–133. 31 indexed citations

Ramanujam, J. & P. Sadayappan. (2012). Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming. 11 indexed citations

Rajbhandari, Samyam, et al.. (2012). International Conference on Computational Science, ICCS 2012.. 412–421. 71 indexed citations

10.

Park, Eun‐Jung, et al.. (2011). Predictive modeling in a polyhedral optimization space. 119–129. 28 indexed citations

11.

Ravishankar, M., et al.. (2010). Optimal loop unrolling for GPGPU programs. OhioLink ETD Center (Ohio Library and Information Network). 1–11. 36 indexed citations

12.

Krishnamoorthy, Sriram, Ümit V. Çatalyürek, Jarek Nieplocha, Atanas Rountev, & P. Sadayappan. (2006). An extensible global address space framework with decoupled task and data abstractions. International Parallel and Distributed Processing Symposium. 283–283. 4 indexed citations

13.

Sadayappan, P., et al.. (2004). Special issue on mobile computing. Journal of information science and engineering. 20(3). 5 indexed citations

14.

Srinivasan, S., Rajkumar Kettimuthu, V. Subramani, & P. Sadayappan. (2003). Characterization of backfilling strategies for parallel job scheduling. 514–519. 96 indexed citations

15.

Sadayappan, P., et al.. (2003). A Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs.. Cluster Computing. 92–99. 19 indexed citations

16.

Sharma, Sanjeev, et al.. (1992). An algebraic theory for modeling direct interconnection networks. Conference on High Performance Computing (Supercomputing). 488–497. 1 indexed citations

17.

Sadayappan, P., et al.. (1991). Removal of redundant dependences in DOACROSS loops with constant dependences. ACM SIGPLAN Notices. 26(7). 51–60. 1 indexed citations

18.

Sadayappan, P., et al.. (1991). Removal of redundant dependences in DOACROSS loops with constant dependences. 51–60. 8 indexed citations

19.

Ramanujam, J. & P. Sadayappan. (1990). Tiling of Iteration Spaces for Multicomputers.. Proceedings of the International Conference on Parallel Processing. 179–186. 28 indexed citations

20.

Ashok, Vikas, et al.. (1985). Modeling Switch-Level Simulation Using Data Flow. Design Automation Conference. 637–644. 1 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