Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Lakhotia, Kartik"'
Star-product graphs are a natural extension of the Cartesian product, but have not been well-studied. We show that many important established and emerging network topologies, including HyperX, SlimFly, BundleFly, PolarStar, mesh, and torus, are in fa
Externí odkaz:
http://arxiv.org/abs/2403.12231
Autor:
Blach, Nils, Besta, Maciej, De Sensi, Daniele, Domke, Jens, Harake, Hussein, Li, Shigang, Iff, Patrick, Konieczny, Marek, Lakhotia, Kartik, Kubicek, Ales, Ferrari, Marcel, Petrini, Fabrizio, Hoefler, Torsten
Publikováno v:
Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) Santa Clara, CA, USA April 16-18, 2024
Novel low-diameter network topologies such as Slim Fly (SF) offer significant cost and power advantages over the established Fat Tree, Clos, or Dragonfly. To spearhead the adoption of low-diameter networks, we design, implement, deploy, and evaluate
Externí odkaz:
http://arxiv.org/abs/2310.03742
Autor:
Lakhotia, Kartik, Monroe, Laura, Isham, Kelly, Besta, Maciej, Blach, Nils, Hoefler, Torsten, Petrini, Fabrizio
Publikováno v:
In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures 2024 (SPAA '24). ACM, New York, NY, USA, pages 345 - 357
We present PolarStar, a novel family of diameter-3 network topologies derived from the star product of low-diameter factor graphs. PolarStar gives the largest known diameter-3 network topologies for almost all radixes, thus providing the best known s
Externí odkaz:
http://arxiv.org/abs/2302.07217
Autor:
Lakhotia, Kartik, Besta, Maciej, Monroe, Laura, Isham, Kelly, Iff, Patrick, Hoefler, Torsten, Petrini, Fabrizio
In this paper we present PolarFly, a diameter-2 network topology based on the Erdos-Renyi family of polarity graphs from finite geometry. This is a highly scalable low-diameter topology that asymptotically reaches the Moore bound on the number of nod
Externí odkaz:
http://arxiv.org/abs/2208.01695
Wing and Tip decomposition construct a hierarchy of butterfly-dense edge and vertex induced bipartite subgraphs, respectively. They have applications in several domains including e-commerce, recommendation systems and document analysis. Existing deco
Externí odkaz:
http://arxiv.org/abs/2110.12511
Tip decomposition is a crucial kernel for mining dense subgraphs in bipartite networks, with applications in spam detection, analysis of affiliation networks etc. It creates a hierarchy of vertex-induced subgraphs with varying densities determined by
Externí odkaz:
http://arxiv.org/abs/2010.08695
Autor:
Niu, Yue, Zeng, Hanqing, Srivastava, Ajitesh, Lakhotia, Kartik, Kannan, Rajgopal, Wang, Yanzhi, Prasanna, Viktor
To accelerate inference of Convolutional Neural Networks (CNNs), various techniques have been proposed to reduce computation redundancy. Converting convolutional layers into frequency domain significantly reduces the computation complexity of the sli
Externí odkaz:
http://arxiv.org/abs/1910.11103
Autor:
Lakhotia, Kartik, Kempe, David
We study a natural model of coordinated social ad campaigns over a social network, based on models of Datta et al. and Aslay et al. Multiple advertisers are willing to pay the host - up to a known budget - per user exposure, whether the exposure is s
Externí odkaz:
http://arxiv.org/abs/1908.09185
Publikováno v:
Proceedings of the VLDB Endowment, 2020
Point-to-Point Shortest Distance (PPSD) query is a crucial primitive in graph database applications. Hub labeling algorithms compute a labeling that converts a PPSD query into a list intersection problem (over a pre-computed indexing) enabling swift
Externí odkaz:
http://arxiv.org/abs/1907.00140
Past decade has seen the development of many shared-memory graph processing frameworks, intended to reduce the effort of developing high performance parallel applications. However many of these frameworks, based on Vertex-centric or Edge-centric para
Externí odkaz:
http://arxiv.org/abs/1806.08092