#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1987

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- V. Nageshwara Rao, Vipin Kumar
- IEEE Trans. Computers
- 1988

The heap is an important data structure used as a priority queue in a wide variety of parallel algorithms (e.g., multiprocessor scheduling, branch-and-bound). In these algorithms, contention for the shared heap limits the obtainable speedup. This paper presents an approach to allow concurrent insertions and deletions on the heap in a shared-memory… (More)

- V. Nageshwara Rao, Vipin Kumar
- International Journal of Parallel Programming
- 1987

This paper presents a parallel formulation of depth-first search which retains the storage efficiency of sequential depth-first search and can be mapped on to anyMIMD architecture. To study its effectiveness it has been implemented to solve the 15-puzzle problem on three commercially available multiprocessors—Sequent Balance 21000, the Intel Hypercube and… (More)

- Vipin Kumar, V. Nageshwara Rao
- International Journal of Parallel Programming
- 1987

This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce… (More)

- Vipin Kumar, K. Ramesh, V. Nageshwara Rao
- AAAI
- 1988

This paper presents many different parallel formulations of the A*/Branch-and-Bound search algorithm. The parallel formulations primarily differ in the data structures used. Some formulations are suited only for shared-memory architectures, whereas others are suited for distributedmemory architectures as well. These parallel formulations have been… (More)

- V. Nageshwara Rao, Vipin Kumar
- IEEE Trans. Parallel Distrib. Syst.
- 1993

AbsfractIt 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: 1) simple backtracking (which does not use any heuristic information); 2)… (More)

- V. Nageshwara Rao, Vipin Kumar, K. Ramesh
- AAAI
- 1987

- V. Nageshwara Rao, Vipin Kumar
- FSTTCS
- 1988

When N processors perform depth-first search on-disjoint parts of a state space tree to find a solution, the speedup can be superlinear (i.e., > N) or sublinear (i.e., < N) depending upon when a solution is first encountered in the space by one of the processors. It may appear that on the average, the speedup would be either linear or sublinear. Using an… (More)

- Sunil Arvindam, Vipin Kumar, V. Nageshwara Rao, Vineet Singh
- KBCS
- 1989

Test generation of combinational circuits is an impor tant step in the VLSI design process. Unfortunately, the problem is highly computation-intensive and, for circuits encountered in practice, test generation t ime can often be enormous. In this paper , we present a parallel formulation of a backtrack search algorithm called PODEM, which has been the most… (More)

- Anura V Kurpad, Meredith M. Regan, Tony Raj, V. Nageshwara Rao, Justin V. Gnanou, Vernon R. Young
- The American journal of clinical nutrition
- 2006

BACKGROUND
The daily requirement for phenylalanine is not known with certainty. Earlier 24-h tracer studies have suggested that the requirement is between 30 and 40 mg . kg(-1) . d(-1).
OBJECTIVE
The objective was to assess the phenylalanine requirement in healthy well-nourished Indians with the use of 8 test phenylalanine intakes (19, 23, 27, 31, 35, 38,… (More)

- Sunil Arvindam, Vipin Kumar, V. Nageshwara Rao, Vineet Singh
- Parallel Computing
- 1991