V. Nageshwara Rao, Vipin Kumar  Home/Search
Context Related
| umn.edu/dept/users/kumar/suplin.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umn.edu/dept/users/kumar...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is known that isolated executions of parallel backtrack search exhibit speedup anomalies. In this paper we present analytical models and experimental results on the average case behavior of parallel backtracking. We consider two types of backtrack search algorithms: (i) simple backtracking (which does not use any heuristic information) ; (ii) heuristic backtracking (which uses heuristics to order and prune search). We present analytical models to compare the average number of nodes... (Update)
Context of citations to this paper: More
.... papers in which one can find analytical and or experimental observances of speedup that exceeds P are [2] 3] 17] 27] 30] [36], 39] and [44] 2.5 Cost Normalized Speedup Often, in addition to knowing how much faster the parallel system runs, we want to get a...
...of search required in each subspace. The parallel algorithm is evaluated by simulation on a single processor system. Rao and Kumar [19] have evaluated the efficiency of parallel backtracking algorithms. They have presented analytical models and experimental results on the...
Cited by: More
A Parallel FPT - Appli Ko For (Correct)
A Parallel FPT Application for Clusters - Cheetham, Dehne, al. (Correct)
Design and Implementation of a Parallel Constraint - Satisfaction Algorithm Marco (Correct)
Active bibliography (related documents): More All
2.0: A Survey of Parallel Search Algorithms for Discrete.. - Grama, Kumar (1993) (Correct)
1.3: Parallel Depth First Search, Part I: Implementation - Rao, Kumar (Correct)
1.0: Parallel Processing of Discrete Optimization Problems - Ananth, Kumar, Pardalos (1992) (Correct)
Similar documents based on text: More All
0.3: Deadline Fair Scheduling: Bridging the Theory and Practice of.. - Chandra, al. (2001) (Correct)
0.1: Superlinear CG Convergence for Special Right-Hand Sides - Beckermann, Kuijlaars (Correct)
0.1: Formal Models of Heavy-Tailed Behavior in Combinatorial Search - Chen, Gomes, Selman (2001) (Correct)
Related documents from co-citation: More All
9: Fixed-parameter tractability and Completeness I: Basic Results - Downey, Fellows - 1995
4: Portfolio Theory and Capital Markets (context) - Sharpe - 1970
4: A New Method for Solving Hard Satisfiability Problems - Selman, Levesque et al. - 1992
BibTeX entry: (Update)
Rao, V., and Kumar, V. 1992. On the efficiency of parallel backtracking. IEEE Trans. on Parallel and Dist. Systems. http://citeseer.ist.psu.edu/rao92efficiency.html More
@article{ rao93efficiency,
author = "V. Nageshwara Rao and Vipin Kumar",
title = "On the Efficiency of Parallel Backtracking",
journal = "IEEE Transactions on Parallel and Distributed Systems",
volume = "4",
number = "4",
pages = "427--437",
year = "1993",
url = "citeseer.ist.psu.edu/rao92efficiency.html" }
Citations (may not include all citations):266 Heuristics - Intelligent Search Strategies for Computer Prob.. (context) - Pearl - 1984
157 Ivy: A shared virtual memory system for parallel computing (context) - Li - 1988
151 Fundamentals of Computer Algorithms (context) - Horowitz, Sahni - 1978
114 An implicit enumeration algorithm to generate tests for comb.. (context) - Goel - 1981
75 Scalable load balancing techniques for parallel computers - Kumar, Grama et al. - 1991
58 Principles of Artificial Intelligence (context) - Nilsson - 1980
51 Parallel depth-first search (context) - Rao, Kumar - 1987
48 Probabilistic algorithms (context) - Rabin - 1988
47 Parallel depth-first search (context) - Kumar, Rao - 1987
46 Anomalies in parallel branch and bound algorithms - Lai, Sahni - 1984
46 Personal Communication (context) - Korf - 1988
35 Scalable parallel formulations of depth-first search (context) - Kumar, Rao - 1990
35 DIB - a distributed implementation of backtracking (context) - Finkel, Manber - 1987
32 Search in Artificial Intelligence (context) - Kanal, Kumar - 1988
32 A parallel implementation of iterative-deepening (context) - Rao, Kumar et al. - 1987
23 Parallel branch-and-bound formulations for and/or tree searc.. (context) - Kumar, Kanal - 1984
16 Superlinear speedup for parallel backtracking (context) - Monien, Vornberger et al. - 1986
16 A parallel branch-and-bound algorithm for test generation - Patil, Banerjee - 1990
15 Consistent linear speedup to a first solution in parallel st.. (context) - Saletore, Kale - 1990
13 Manip - a multicomputer architecture for solving combinatori.. (context) - Wah, Ma - 1984
12 The use of parallelism to implement a heuristic search - Kornfeld - 1981
11 Experimental evaluation of load balancing techniques for the.. (context) - Grama, Kumar et al. - 1991
9 Modeling speedup (context) - Helmbold, McDowell - 1988
9 Superlinear speedup through randomized algorithms (context) - Mehrotra, Gehringer - 1985
8 The average complexity of depth-first search with backtracki.. (context) - Stone, Sipala - 1986
7 Automatic test pattern generation on multiprocessors (context) - Arvindam, Kumar et al. - 1991
7 Randomized parallel algorithms for prolog programs and backt.. (context) - Janakiram, Agrawal et al. - 1987
7 Superlinear speedup in state-space search (context) - Rao, Kumar - 1988
3 A parallel searching scheme for multiprocessor systems and i.. (context) - Imai, Yoshida et al. - 1979
2 Performance and pragmatics of an OR-parallel logic programmi.. (context) - Tinker - 1988
2 Computational efficiency of parallel approximate branch-and-.. (context) - Li, Wah - 1984
2 Information Processing Letters (context) - Kale, heuristic et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (ftp://ftp.cs.umn.edu/dept/users/kumar/WEB/papers.html): More
A Performance Study of Diffusive vs. Remapped.. - Karypis, Kumar.. (Correct)
A Universal Formulation of Sequential Patterns - Mahesh Joshi (1999) (Correct)
A New Algorithm for Multi-objective Graph Partitioning - Schloegel, Karypis, Kumar (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC