Zobrazeno 1 - 10
of 45
pro vyhledávání: '"V. Krishna Nandivada"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
V. Krishna Nandivada, Arun Thangamani
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 16:1-26
X10 is a partitioned global address space programming language that supports the notion of places ; a place consists of some data and some lightweight tasks called activities. Each activity runs at a place and may invoke a place-change operation (usi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb45c40a43692a24d39f54d691e02002
https://doi.org/10.1145/3345558
https://doi.org/10.1145/3345558
Autor:
Manas Thakur, V. Krishna Nandivada
Publikováno v:
ACM Transactions on Programming Languages and Systems. 41:1-37
Languages like Java and C# follow a two-step process of compilation: static compilation and just-in-time (JIT) compilation. As the time spent in JIT compilation gets added to the execution-time of the application, JIT compilers typically sacrifice th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bf1674e1175c53f7fea4f7f739a20c3
https://doi.org/10.1145/3337794
https://doi.org/10.1145/3337794
Autor:
V. Krishna Nandivada, Akshay Utture
Publikováno v:
Software: Practice and Experience. 49:1379-1401
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4281fc9d20cf4a81aec75aca37a6c991
https://doi.org/10.1002/spe.2726
https://doi.org/10.1002/spe.2726
Autor:
Indu K. Prabhu, V. Krishna Nandivada
Publikováno v:
ICS
Task-parallel languages such as X10 implement dynamic lightweight task-parallel execution model, where programmers are encouraged to express the ideal parallelism in the program. Prior work has used loop chunking to extract useful parallelism from id
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::695c5fa1804f6ee2afb5c1d8236c1c48
https://doi.org/10.1145/3392717.3392763
https://doi.org/10.1145/3392717.3392763
Autor:
Loc Hoang, Roshan Dathathri, Vishwesh Jatala, V. Krishna Nandivada, Keshav Pingali, Gurbinder Gill
Publikováno v:
IPDPS
There are relatively few studies of distributed GPU graph analytics systems in the literature and they are limited in scope since they deal with small data-sets, consider only a few applications, and do not consider the interplay between partitioning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12e79acab8c7f27e31bcb9f0b680296f
https://doi.org/10.1109/ipdps47924.2020.00019
https://doi.org/10.1109/ipdps47924.2020.00019
Autor:
Manas Thakur, V. Krishna Nandivada
Publikováno v:
CC
Existing precise context-sensitive heap analyses do not scale well for large OO programs. Further, identifying the right context abstraction becomes quite intriguing as two of the most popular categories of context abstractions (call-site- and object
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5e586c3372e9745b239edcbc96d5024
https://doi.org/10.1145/3377555.3377902
https://doi.org/10.1145/3377555.3377902
Autor:
Sonali Saha, V. Krishna Nandivada
Publikováno v:
PPoPP
May-Happen-in-Parallel (MHP) analysis forms the basis for many problems of program analysis and program understanding. MHP analysis can also be used by IDEs (integrated-development-environments) to help programmers to refactor parallel-programs, iden
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4dca997a01a03fb0251891c2dacd4d3b
https://doi.org/10.1145/3332466.3374541
https://doi.org/10.1145/3332466.3374541
Autor:
V. Krishna Nandivada, Jyothi Vedurada
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-28
Refactoring is a program transformation that restructures existing code without altering its behaviour and is a key practice in popular software design movements, such as Agile. Identification of potential refactoring opportunities is an important st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::821f165cba5a4ad167cdd867b98c84f1
https://doi.org/10.1145/3276508
https://doi.org/10.1145/3276508
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 14:1-29
Energy-efficient compilation is an important problem for multi-core systems. In this context, irregular programs with task-parallel loops present interesting challenges: the threads with lesser work-loads ( non-critical -threads) wait at the join-poi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1b61cc93afec09f9d554797e0a17020
https://doi.org/10.1145/3136063
https://doi.org/10.1145/3136063