Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Ravi Mehrotra

dblp:05/312 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1988
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 72% Performance modeling and evaluation · 28%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › parallel search
parallel backtracking		 0.011988
A Randomized Parallel Backtracking Algorithm · IEEE Trans. Computers 1988
Performance modeling and evaluation › performance prediction
execution time prediction		 0.011984
Scheduling of Tasks for Distributed Processors · ISCA 1984
Parallel and multicore computing
task scheduling		 0.011984
Scheduling of Tasks for Distributed Processors · ISCA 1984
Parallel and multicore computing
parallel algorithms		 0.011988
A Randomized Parallel Backtracking Algorithm · IEEE Trans. Computers 1988

Methods — techniques the papers use, named apart from their topics

randomization · 0.0parallel backtracking · 0.0analytical performance modeling · 0.0
YearPublicationVenuePosition
1988 A Randomized Parallel Backtracking Algorithm
abstract
A technique for parallel backtracking using randomization is proposed. Its main advantage is that good speedups are possible with little or no interprocessor communication. The speedup obtainable is problem-dependent. In those cases where the problem size becomes very large, randomization is extremely successful achieving good speedups. The technique also ensures high reliability, flexibility, and fault tolerance.>
Virendra K. Janakiram, Dharma P. Agrawal, Ravi Mehrotra
 IEEE Trans. Computers3
1987 Randomized Parallel Algorithms for Prolog Programs and Backtracking Applications
Virendra K. Janakiram, Dharma P. Agrawal, Ravi Mehrotra
 ICPP3
1985 Superlinear Speedup Through Randomized Algorithms
Ravi Mehrotra, Edward F. Gehringer
 ICPP1
1984 Scheduling of Tasks for Distributed Processors
abstract
The paper describes a technique for estimating the minimum execution time of an algorithm or a mix of algorithms on a distributed processing system. Bottlenecks that would have to be removed to further reduce the execution time are identified. The main applications are for the high level design of special purpose distributed processing systems.
Ravi Mehrotra, Sarosh Talukdar
 ISCA1