#### Filter Results:

#### Publication Year

1992

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Jyothish Soman, Kishore Kothapalli, P. J. Narayanan
- 2010 IEEE International Symposium on Parallel…
- 2010

Graphics processing units provide a large computational power at a very low price which position them as an ubiquitous accelerator. General purpose programming on the graphics processing units (GPGPU) is best suited for regular data parallel algorithms. They are not directly amenable for algorithms which have irregular data access patterns such as list… (More)

An important problem for wireless ad hoc networks has been todesign overlay networks that allow time- and energy-efficientrouting. Many local-control strategies for maintaining such overlaynetworks have already been suggested, but most of them are based onan oversimplified wireless communication model.
In this paper, we suggest a model that is much more… (More)

- Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer
- Proceedings 20th IEEE International Parallel…
- 2006

We consider the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color. It is trivial to see that every graph of maximum degree Delta can be colored with Delta + 1 colors, and distributed algorithms that find a (Delta + 1)-coloring in a logarithmic number of communication… (More)

This paper initiates formal analysis of a simple, distributed algorithm for community detection on networks. We analyze an algorithm that we call Max-LPA, both in terms of its convergence time and in terms of the " quality " of the communities detected. Max-LPA is an instance of a class of community detection algorithms called label propagation algorithms.… (More)

Multicore processors are a shift of paradigm in computer architecture that promises dramatic increase in performance. But they also bring complexity in algorithmic design. In this paper we describe the challenges and design issues involved in parallelizing two dimensional convex hull on both CUDA and Cell Brodband Engine (Cell BE). We have parallelized the… (More)

- Kiran Kumar Matam, Kishore Kothapalli
- 2011 IEEE Workshops of International Conference…
- 2011

Graphics Processing Units provide a large computational power at a very low price which position them as an ubiquitous accelerator. GPGPU is accelerating general purpose computations using GPU's. GPU's have been used to accelerate many Linear Algebra routines and Numerical Methods. Lanczos is an iterative method well suited for finding the extreme… (More)

- Kishore Kothapalli, Rishabh Mukherjee, M. Suhail Rehman, Suryakant Patidar, P. J. Narayanan, K. Srinathan
- 2009 International Conference on High Performance…
- 2009

The significant growth in computational power of modern Graphics Processing Units (GPUs) coupled with the advent of general purpose programming environments like NVIDIA's CUDA, has seen GPUs emerging as a very popular parallel computing platform. Till recently, there has not been a performance model for GPGPUs. The absence of such a model makes it difficult… (More)

We consider the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color. It is trivial to see that every graph of maximum degree ∆ can be colored with ∆+1 colors, and distributed algorithms that find a (∆+1)-coloring in a logarithmic number of communication rounds, with high… (More)