default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMuthu Manikandan Baskaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c40]Dimitri Leggas, Muthu Manikandan Baskaran, James R. Ezick, Brendan von Hofe:
Filtered Tensor Construction and Decomposition for Drug Repositioning. HPEC 2021: 1-7- [c39]Teresa M. Ranadive, Muthu Manikandan Baskaran:
An All-at-Once CP Decomposition Method for Count Tensors. HPEC 2021: 1-8 - 2020
- [c38]Muthu Manikandan Baskaran, Charles Jin, Benoît Meister, Jonathan Springer:
Automatic Mapping and Optimization to Kokkos with Polyhedral Compilation. HPEC 2020: 1-7 - [c37]Dimitri Leggas, Thomas Henretty, James R. Ezick, Muthu Manikandan Baskaran, Brendan von Hofe, Grace H. Cimaszewski, Harper Langston, Richard Lethin:
Multiscale Data Analysis Using Binning, Tensor Decompositions, and Backtracking. HPEC 2020: 1-7 - [c36]Teresa M. Ranadive, Muthu Manikandan Baskaran:
Large-scale Sparse Tensor Decomposition Using a Damped Gauss-Newton Method. HPEC 2020: 1-8
2010 – 2019
- 2019
- [j1]Muthu Manikandan Baskaran, Thomas Henretty, James R. Ezick, Richard Lethin, David Bruns-Smith:
Enhancing Network Visibility and Security through Tensor Analysis. Future Gener. Comput. Syst. 96: 207-215 (2019) - [c35]Charles Jin, Muthu Manikandan Baskaran, Benoît Meister:
POSTER: Automatic Parallelization Targeting Asynchronous Task-Based Runtimes. PACT 2019: 465-466 - [c34]Muthu Manikandan Baskaran, Thomas Henretty, James R. Ezick:
Fast and Scalable Distributed Tensor Decompositions. HPEC 2019: 1-7 - [c33]James R. Ezick, Ben Parsons, William Glodek, Tom Henretty, Muthu Manikandan Baskaran, Richard Lethin, John Feo, Tai-Ching Tuan, Christopher J. Coley, Leslie Leonard, Rajeev Agrawal:
Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale. HPEC 2019: 1-7 - [c32]Charles Jin, Muthu Manikandan Baskaran, Benoît Meister, Jonathan Springer:
Automatic Parallelization to Asynchronous Task-Based Runtimes Through a Generic Runtime Layer. HPEC 2019: 1-11 - 2018
- [c31]Aditya Gudibanda, Tom Henretty, Muthu Manikandan Baskaran, James R. Ezick, Richard Lethin:
All-at-once Decomposition of Coupled Billion-scale Tensors in Apache Spark. HPEC 2018: 1-8 - [c30]Pierre-David Letourneau, Muthu Manikandan Baskaran, Tom Henretty, James R. Ezick, Richard Lethin:
Computationally Efficient CP Tensor Decomposition Update Framework for Emerging Component Discovery in Streaming Data. HPEC 2018: 1-8 - [c29]Charles Jin, Muthu Manikandan Baskaran:
Analysis of Explicit vs. Implicit Tasking in OpenMP Using Kripke. ESPM2@SC 2018: 62-70 - 2017
- [c28]Muthu Manikandan Baskaran, Tom Henretty, Benoît Pradelle, Matthew Harper Langston, David Bruns-Smith, James R. Ezick, Richard Lethin:
Memory-efficient parallel tensor decompositions. HPEC 2017: 1-7 - [c27]Tom Henretty, Muthu Manikandan Baskaran, James R. Ezick, David Bruns-Smith, Tyler A. Simon:
A quantitative and qualitative analysis of tensor decompositions on spatiotemporal data. HPEC 2017: 1-7 - [c26]Benoît Pradelle, Benoît Meister, Muthu Manikandan Baskaran, Jonathan Springer, Richard Lethin:
Polyhedral Optimization of TensorFlow Computation Graphs. ESPT/VPA@SC 2017: 74-89 - 2016
- [c25]Muthu Manikandan Baskaran, Matthew Harper Langston, Tahina Ramananandro, David Bruns-Smith, Tom Henretty, James R. Ezick, Richard Lethin:
Accelerated low-rank updates to tensor decompositions. HPEC 2016: 1-7 - [c24]Benoît Pradelle, Muthu Manikandan Baskaran, Thomas Henretty, Benoît Meister, Athanasios Konstantinidis, Richard Lethin:
Polyhedral compilation for energy efficiency. HPEC 2016: 1-7 - [c23]Benoît Pradelle, Benoît Meister, Muthu Manikandan Baskaran, Athanasios Konstantinidis, Thomas Henretty, Richard Lethin:
Scalable Hierarchical Polyhedral Compilation. ICPP 2016: 432-441 - [c22]Muthu Manikandan Baskaran, Benoît Pradelle, Benoît Meister, Athanasios Konstantinidis, Richard A. Lethin:
Automatic Code Generation and Data Management for an Asynchronous Task-Based Runtime. ESPT@SC 2016: 34-41 - [i2]Benoît Meister, Muthu Manikandan Baskaran, Benoît Pradelle, Thomas Henretty, Richard Lethin:
Efficient Compilation to Event-Driven Task Programs. CoRR abs/1601.05458 (2016) - 2015
- [c21]Jonathon Cai, Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Optimization of symmetric tensor computations. HPEC 2015: 1-7 - [c20]Sanket Tavarageri, Benoît Meister, Muthu Manikandan Baskaran, Benoît Pradelle, Thomas Henretty, Athanasios Konstantinidis, Ann Johnson, Richard Lethin:
Automatic cluster parallelization and minimizing communication via selective data replication. HPEC 2015: 1-7 - [c19]Eric Papenhausen, Bing Wang, Harper Langston, Muthu Manikandan Baskaran, Thomas Henretty, Taku Izubuchi, Ann Johnson, Chulwoo Jung, Meifeng Lin, Benoît Meister, Klaus Mueller, Richard Lethin:
Polyhedral user mapping and assistant visualizer tool for the r-stream auto-parallelizing compiler. VISSOFT 2015: 180-184 - 2014
- [c18]Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Low-overhead load-balanced scheduling for sparse tensor computations. HPEC 2014: 1-6 - [c17]Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Parallelizing and optimizing sparse tensor computations. ICS 2014: 179 - [i1]Nicolas Vasilache, Muthu Manikandan Baskaran, Thomas Henretty, Benoît Meister, Harper Langston, Sanket Tavarageri, Richard Lethin:
A Tale of Three Runtimes. CoRR abs/1409.1914 (2014) - 2013
- [c16]Nicolas Vasilache, Muthu Manikandan Baskaran, Benoît Meister, Richard Lethin:
Memory reuse optimizations in the R-Stream compiler. GPGPU@ASPLOS 2013: 42-53 - [c15]Harper Langston, Muthu Manikandan Baskaran, Benoît Meister, Nicolas Vasilache, Richard Lethin:
Re-Introduction of communication-avoiding FMM-accelerated FFTs with GPU acceleration. HPEC 2013: 1-6 - 2012
- [c14]Muthu Manikandan Baskaran, Benoît Meister, Nicolas Vasilache, Richard Lethin:
Efficient and scalable computations with sparse tensors. HPEC 2012: 1-6 - [c13]Muthu Manikandan Baskaran, Nicolas Vasilache, Benoît Meister, Richard Lethin:
Automatic communication optimizations through memory reuse strategies. PPoPP 2012: 277-278 - 2011
- [r1]Benoît Meister, Nicolas Vasilache, David Wohlford, Muthu Manikandan Baskaran, Allen Leung, Richard Lethin:
R-Stream Compiler. Encyclopedia of Parallel Computing 2011: 1756-1765 - 2010
- [c12]Allen Leung, Nicolas Vasilache, Benoît Meister, Muthu Manikandan Baskaran, David Wohlford, Cédric Bastoul, Richard Lethin:
A mapping path for multi-GPGPU accelerated computers from a portable high level programming abstraction. GPGPU 2010: 51-61 - [c11]Muthu Manikandan Baskaran, J. Ramanujam
, P. Sadayappan:
Automatic C-to-CUDA Code Generation for Affine Programs. CC 2010: 244-263 - [c10]Muthu Manikandan Baskaran, Albert Hartono, Sanket Tavarageri, Thomas Henretty, J. Ramanujam, P. Sadayappan:
Parameterized tiling revisited. CGO 2010: 200-209 - [c9]Albert Hartono, Muthu Manikandan Baskaran, J. Ramanujam, Ponnuswamy Sadayappan:
DynTile: Parametric tiled loop generation for parallel execution on multicore processors. IPDPS 2010: 1-12 - [c8]Giridhar Sreenivasa Murthy, Mahesh Ravishankar, Muthu Manikandan Baskaran, Ponnuswamy Sadayappan:
Optimal loop unrolling for GPGPU programs. IPDPS 2010: 1-11
2000 – 2009
- 2009
- [c7]Albert Hartono, Muthu Manikandan Baskaran, Cédric Bastoul, Albert Cohen, Sriram Krishnamoorthy, Boyana Norris, J. Ramanujam, P. Sadayappan:
Parametric multi-level tiling of imperfectly nested loops. ICS 2009: 147-157 - [c6]Muthu Manikandan Baskaran, Nagavijayalakshmi Vydyanathan, Uday Bondhugula, J. Ramanujam, Atanas Rountev, P. Sadayappan:
Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors. PPoPP 2009: 219-228 - 2008
- [c5]Uday Bondhugula, Muthu Manikandan Baskaran, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan:
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model. CC 2008: 132-146 - [c4]Muthu Manikandan Baskaran, Uday Bondhugula, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan:
A compiler framework for optimization of affine loop nests for gpgpus. ICS 2008: 225-234 - [c3]Uday Bondhugula, Muthu Manikandan Baskaran, Albert Hartono, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan:
Towards effective automatic parallelization for multicore systems. IPDPS 2008: 1-5 - [c2]Muthu Manikandan Baskaran, Uday Bondhugula, Sriram Krishnamoorthy, J. Ramanujam, Atanas Rountev, P. Sadayappan:
Automatic data movement and computation mapping for multi-level parallel architectures with explicitly managed memories. PPoPP 2008: 1-10 - 2007
- [c1]Sriram Krishnamoorthy, Muthu Manikandan Baskaran, Uday Bondhugula, J. Ramanujam, Atanas Rountev, P. Sadayappan:
Effective automatic parallelization of stencil computations. PLDI 2007: 235-244
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
