S. P. Rana

According to our database, S. P. Rana authored at least 10 papers between 1979 and 1987.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1987

Ring based termination detection algorithm for distributed computations.

R. K. Arora, S. P. Rana, M. N. Gupta

Microprocessing and Microprogramming, 1987

1986

Distributed Termination Detection Algorithm for Distributed Computations.

R. K. Arora, S. P. Rana, M. N. Gupta

Inf. Process. Lett., 1986

An optimal distributed solution to the dining philosophers problem.

S. P. Rana, Dilip K. Banerji

Int. J. Parallel Program., 1986

1983

A Distributed Solution of the Distributed Termination Problem.

S. P. Rana

Inf. Process. Lett., 1983

1982

Triple-Handed Dining Philosophers.

S. P. Rana

ACM SIGOPS Oper. Syst. Rev., 1982

Achieving mutual exclusion in a distributed computing environment.

R. K. Arora, S. P. Rana, N. K. Jain

Inf. Syst., 1982

1981

On the Design of Process Assigner for Distributed Computing Systems.

R. K. Arora, S. P. Rana, N. K. Sharma

Aust. Comput. J., 1981

1980

Heuristic Algorithms for Process Assignment in Distributed Computing Systems.

R. K. Arora, S. P. Rana

Inf. Process. Lett., 1980

Analysis of the Module Assignment Problem in Distributed Computing Systems with Limited Storage.

R. K. Arora, S. P. Rana

Inf. Process. Lett., 1980

1979

On Module Assignment in Two-Processor Distributed Systems.

R. K. Arora, S. P. Rana

Inf. Process. Lett., 1979