default search action
Priya Unnikrishnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [c15]Priya Unnikrishnan, Jeremy S. Bradbury, Kit Barton, Robert Ho:
9th workshop on challenges for parallel computing. CASCON 2014: 295-296 - [c14]Xiaohui Chen, Marc Moreno Maza, Sushek Shekar, Priya Unnikrishnan:
MetaFork: A Framework for Concurrency Platforms Targeting Multicores. IWOMP 2014: 30-44 - 2013
- [c13]Priya Unnikrishnan, Kit Barton, Jeremy S. Bradbury, Reza Azimi:
8th Workshop on Challenges for Parallel Computing. CASCON 2013: 363-364 - [c12]Jun Shirako, Priya Unnikrishnan, Sanjay Chatterjee, Kelvin Li, Vivek Sarkar:
Expressing DOACROSS Loop Dependences in OpenMP. IWOMP 2013: 30-44 - 2012
- [c11]Priya Unnikrishnan, Kit Barton, Tom Chen:
7th Workshop on Challenges for Parallel Computing. CASCON 2012: 251-252 - [c10]Priya Unnikrishnan, Jun Shirako, Kit Barton, Sanjay Chatterjee, Raúl Silvera, Vivek Sarkar:
A Practical Approach to DOACROSS Parallelization. Euro-Par 2012: 219-231 - 2011
- [c9]Kit Barton, Amy Wang, Steven Perron, Priya Unnikrishnan:
Challenges for parallel computing. CASCON 2011: 347-348
2000 – 2009
- 2009
- [j2]Priya Unnikrishnan, Guangyu Chen, Mahmut T. Kandemir, Mustafa Karaköy, Ibrahim Kolcu:
Reducing memory requirements of resource-constrained applications. ACM Trans. Embed. Comput. Syst. 8(3): 17:1-17:37 (2009) - [j1]Eduard Ayguadé, Nawal Copty, Alejandro Duran, Jay P. Hoeflinger, Yuan Lin, Federico Massaioli, Xavier Teruel, Priya Unnikrishnan, Guansong Zhang:
The Design of OpenMP Tasks. IEEE Trans. Parallel Distributed Syst. 20(3): 404-418 (2009) - [c8]Xavier Teruel, Christopher Barton, Alejandro Duran, Xavier Martorell, Eduard Ayguadé, Priya Unnikrishnan, Guansong Zhang, Raúl Silvera:
OpenMP tasking analysis for programmers. CASCON 2009: 32-42 - [c7]Kit Barton, Guansong Zhang, Priya Unnikrishnan:
Challenges for parallel computing. CASCON 2009: 317 - 2008
- [c6]Xavier Teruel, Priya Unnikrishnan, Xavier Martorell, Eduard Ayguadé, Raúl Silvera, Guansong Zhang, Ettore Tiotto:
OpenMP tasks in IBM XL compilers. CASCON 2008: 16 - 2007
- [c5]Eduard Ayguadé, Nawal Copty, Alejandro Duran, Jay P. Hoeflinger, Yuan Lin, Federico Massaioli, Ernesto Su, Priya Unnikrishnan, Guansong Zhang:
A Proposal for Task Parallelism in OpenMP. IWOMP 2007: 1-12 - 2006
- [c4]Priya Unnikrishnan, Mahmut T. Kandemir, Feihui Li:
Reducing dynamic compilation overhead by overlapping compilation and execution. ASP-DAC 2006: 929-934 - 2004
- [c3]Guansong Zhang, Priya Unnikrishnan, James Ren:
Experiments with Auto-Parallelizing SPEC2000FP Benchmarks. LCPC 2004: 348-362 - 2003
- [c2]Priya Unnikrishnan, Guangyu Chen, Mahmut T. Kandemir, Mustafa Karaköy, Ibrahim Kolcu:
Loop Transformations for Reducing Data Space Requirements of Resource-Constrained Applications. SAS 2003: 383-400 - 2002
- [c1]Priya Unnikrishnan, Guangyu Chen, Mahmut T. Kandemir, D. R. Mudgett:
Dynamic compilation for energy adaptation. ICCAD 2002: 158-163
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:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint