#### Filter Results:

- Full text PDF available (70)

#### Publication Year

1991

2017

- This year (3)
- Last 5 years (37)
- Last 10 years (58)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Ananth Grama, Anshul Gupta, Vipin Kumar
- IEEE Parallel & Distributed Technology: Systems…
- 1993

Isoefficiency analysis helps us determine the best algorithm/architecture combination for a particular problem without explicitly analyzing all possible combinations under all possible conditions.<<ETX>>

i Preface This instructors guide to accompany the text " Introduction to Parallel Computing " contains solutions to selected problems. For some problems the solution has been sketched, and the details have been left out. When solutions to problems are available directly in publications, references have been provided. Where necessary, the solutions are… (More)

- Anshul Gupta
- IBM Journal of Research and Development
- 1997

- Anshul Gupta, Vipin Kumar
- IEEE Trans. Parallel Distrib. Syst.
- 1993

In this paper, we present the scalability analysis of parallel Fast Fourier Transform algorithm on mesh and hypercube connected multicomputers using the isoefficiency metric. The isoefficiency function of an algorithm architecture combination is defined as the rate at which the problem size should grow with the number of processors to maintain a fixed… (More)

- Anshul Gupta, George Karypis, Vipin Kumar
- IEEE Trans. Parallel Distrib. Syst.
- 1997

In this paper, we describe scalable parallel algorithms for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a Cray T3D parallel computer. Through our analysis and experimental results, we demonstrate that our algorithms substantially improve the state of the art in… (More)

- Anshul Gupta, Vipin Kumar
- 1993 International Conference on Parallel…
- 1993

A number of parallel formulations of dense matrix multiplication algorithm have been developed. For arbitrarily large number of processors, any of these algorithms or their variants can provide near linear speedup for sufficiently large matrix sizes and none of the algorithms can be clearly claimed to be superior than the others. In this paper we analyze… (More)

- Anshul Gupta
- SIAM J. Matrix Analysis Applications
- 2002

We present algorithms for the symbolic and numerical factorization phases in the direct solution of sparse unsymmetric systems of linear equations. We have modified a classical symbolic factorization algorithm for unsymmetric matrices to inexpensively compute minimal elimination structures. We give an efficient algorithm to compute a near-minimal… (More)

- Anshul Gupta, Vipin Kumar
- J. Parallel Distrib. Comput.
- 1993

There are several metrics that characterize the performance of a parallel system, such as, parallel execution time, speedup and eeciency. A number of properties of these metrics have been studied. For example, it is a well known fact that given a parallel architecture and a problem of a xed size, the speedup of a parallel algorithm does not continue to… (More)

- Sushil K. Prasad, Almadena Yu. Chtchelkanova, +18 authors Jie Wu
- SIGCSE
- 2011

Parallelism pervades all aspects of modern computing, from in-home devices such as cell phones to large-scale supercomputers. Recognizing this - and motivated by the premise that every undergraduate student in a computer-related field should be prepared to cope with parallel computing - a working group sponsored by NSF and IEEE/TCPP, and interacting with… (More)