Zobrazeno 1 - 10
of 135
pro vyhledávání: '"Venkatesan T. Chakaravarthy"'
Autor:
Seshadri Padmanabha Venkatagiri, Pooja Aggarwal, Anamitra R. Choudhury, Amith Singhee, Ashok Kumar, Yogish Sabharwal, Venkatesan T. Chakaravarthy
Publikováno v:
CLOUD
In conventional public clouds, designing a suitable initial cluster for a given application workload is important in reducing the computational foot-print during run-time. In edge or on-premise clouds, cold-start rightsizing the cluster at the time o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ad83e46663a91d240950c54472d0110
https://doi.org/10.1109/cloud53861.2021.00080
https://doi.org/10.1109/cloud53861.2021.00080
Autor:
Shashanka Ubaru, Shivmaran S. Pandian, Saurabh Raje, Yogish Sabharwal, Toyotaro Suzumura, Venkatesan T. Chakaravarthy
Publikováno v:
SC
We present distributed algorithms for training dynamic Graph Neural Networks (GNN) on large scale graphs spanning multi-node, multi-GPU systems. To the best of our knowledge, this is the first scaling study on dynamic GNN. We devise mechanisms for re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd7c41e2b362488de70c281bc8023b46
Autor:
Yogish Sabharwal, Archita Agarwal, Sambudha Roy, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury
Publikováno v:
Theory of Computing Systems. 62:1763-1797
In this paper, we study a class of set cover problems that satisfy a special property which we call the small neighborhood cover property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval cover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfe2aa173f714721c3ddf56a8d8c31f7
https://doi.org/10.1007/s00224-017-9842-1
https://doi.org/10.1007/s00224-017-9842-1
Autor:
Venkatesan T. Chakaravarthy, Prakash Murali, Fabio Checconi, Yogish Sabharwal, Fabrizio Petrini
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 28:2031-2045
We consider the single-source shortest path (SSSP) problem: given an undirected graph with integer edge weights and a source vertex $v$ , find the shortest paths from $v$ to all other vertices. In this paper, we introduce a novel parallel algorithm,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f3ec964974405ab8d312589f3fe081d
https://doi.org/10.1109/tpds.2016.2634535
https://doi.org/10.1109/tpds.2016.2634535
Autor:
Sambuddha Roy, Yogish Sabharwal, Anamitra R. Choudhury, Venkatesan T. Chakaravarthy, Shalmoli Gupta
Publikováno v:
Journal of Scheduling. 21:313-325
We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible scheduling instances, where each instance is gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14ece026a87c116457f6414996c86e6c
https://doi.org/10.1007/s10951-017-0515-3
https://doi.org/10.1007/s10951-017-0515-3
Publikováno v:
ICS
The Tucker decomposition generalizes singular value decomposition (SVD) to high dimensional tensors. It factorizes a given N-dimensional tensor as the product of a small core tensor and a set of N factor matrices. Non-negative Tucker Decomposition (N
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5fa90e6c72c710f5b17a69eebbf79b4
https://doi.org/10.1145/3330345.3330367
https://doi.org/10.1145/3330345.3330367
Publikováno v:
Discrete Optimization. 38:100611
We study the problem of maximizing the throughput of jobs wherein each job consists of multiple tasks. Consider a system offering a capacity of one unit. We are given a set of jobs, each consisting of a sequence of r tasks. Each task is associated wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4adc400ed43ef24ef885853c25f07eee
https://doi.org/10.1016/j.disopt.2020.100611
https://doi.org/10.1016/j.disopt.2020.100611
Autor:
Yogish Sabharwal, Prakash Murali, Aashish Goyal, Venkatesan T. Chakaravarthy, Shivmaran S. Pandian
Publikováno v:
Euro-Par 2018: Parallel Processing ISBN: 9783319969824
Euro-Par
Euro-Par
The truss decomposition provides a popular model for discovering cohesive communities in a given network (graph). The problem has been well studied in sequential, shared memory and MapReduce settings. We study the problem on distributed memory system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13fd07dd81410b961178e2c1d2179720
https://doi.org/10.1007/978-3-319-96983-1_50
https://doi.org/10.1007/978-3-319-96983-1_50
Autor:
Venkatesan T. Chakaravarthy, Prakash Murali, Shivmaran S. Pandian, Jee Choi, Yogish Sabharwal, Dheeraj Sreedhar, Douglas J. Joseph
Publikováno v:
ICS
The Tucker decomposition generalizes the notion of Singular Value Decomposition (SVD) to tensors, the higher dimensional analogues of matrices. We study the problem of constructing the Tucker decomposition of sparse tensors on distributed memory syst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bc58a036f18efe96fcd18b8c0c8d9f1
Autor:
Sonika Thakral, Neelima Gupta, Venkatesan T. Chakaravarthy, Sachin Sharma, Yogish Sabharwal, Anshul Aggarwal
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319621265
WADS
WADS
We consider the replica placement problem: given a graph and a set of clients, place replicas on a minimum set of nodes of the graph to serve all the clients; each client is associated with a request and maximum distance that it can travel to get ser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a62f83f290d6e6c5cb74f0c38c6fa7dc
https://doi.org/10.1007/978-3-319-62127-2_2
https://doi.org/10.1007/978-3-319-62127-2_2