## Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems (2000)

### Cached

### Download Links

- [www.cps.udayton.edu]
- [www.cs.gsu.edu]
- [www.cs.gsu.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Supercomputing |

Citations: | 16 - 11 self |

### BibTeX

@ARTICLE{Li00efficientdeterministic,

author = {Keqin Li and Yi Pan and Si Qing Zheng},

title = {Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems},

journal = {Journal of Supercomputing},

year = {2000},

volume = {15},

pages = {163--181}

}

### OpenURL

### Abstract

. In this paper, we present deterministic and probabilistic methods for simulating PRAM computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The following results are established in this paper. (1) Each step of a p-processor PRAM with m = O#p# shared memory cells can be simulated by a p-processors LARPBS in O#log p# time, where the constant in the big-O notation is small. (2) Each step of a p-processor PRAM with m = ##p# shared memory cells can be simulated by a p-processors LARPBS in O#log m# time. (3) Each step of a p-processor PRAM can be simulated by a p-processor LARPBS in O#log p# time with probability larger than 1 - 1/p c for all c>0. (4) As an interesting byproduct, we show that a p-processor LARPBS can sort p items in O#log p# time, with a small constant hidden in the big-O notation. Our results indicate that an LARPBS can simulate a PRAM very efficiently. Keywords: Concurrent read, concurrent write, deterministic simulation, linear array...

### Citations

1374 |
Introduction to Parallel Algorithms and Architectures: Arrays
- LEIGHTON
- 1992
(Show Context)
Citation Context ...lls can be simulated on a p-processor LARPBS in O�log p� time with probability at least 1 − 1/p c for any c>0. The main idea in probabilistic simulations is to randomize the locations of memory =-=cells [24, 46, 47]. A random hash function h� ��-=-�1��m� →�1��p� is employed, which maps each shared memory cell M k to a processor Q h�k�. For convenience, we let each processor Q j possess m memory locations M j�1�M j�2�... |

671 |
An Introduction to Parallel Algorithms
- JAJA
- 1992
(Show Context)
Citation Context ...l known that the weakest PRAM model can simulate the strongest PRAMsefficient deterministic and probabilistic simulations of prams 167 model with only O�log p� slowdown (see, e.g., [8] and §10.1.=-=1 of [21]-=-). For ease of reference, we formally state this fact as a lemma. Lemma 2.1 Each step of a p-processor priority CRCW PRAM computation with m shared memory cells can be simulated by a p-processor EREW ... |

294 |
Parallelism in random access machines
- Fortune, Wyllie
- 1978
(Show Context)
Citation Context ...ity 1. Introduction The parallel random access machine (PRAM) model is perhaps the most convenient, standard, and popular abstract device for developing, specifying, and analyzing parallel algorithms =-=[13]-=-. It idealizes parallel computers. The shared memory accessible to all the processors in a PRAM makes interprocessor communications relatively easier to handle than in other models and systems. Thus, ... |

290 | Parallel merge sort
- Cole
- 1988
(Show Context)
Citation Context ...on algorithm of the read phase. Step (R1) needs to sort the p memory requests. It is well known that the fastest parallel sorting algorithm on PRAM is Cole’s parallel mergesort algorithm on EREW PRA=-=M [10]. Lemma -=-4.2 Sorting p items can be performed by a p-processor EREW PRAM in O�log p� time, using O�p� shared memory cells. Using Theorem 3.1, we obtain the following claim immediately, which implies th... |

208 |
General purpose parallel architectures
- Valiant
- 1990
(Show Context)
Citation Context ...ch step of a p-processor PRAM can be simulated by a p-node butterfly network in O�log p� time with high probability [46]. Other deterministic and probabilistic simulation results are also reported=-= in [1, 5, 18, 20, 22, 33, 34, 47, 48, 49]-=-. A comprehensive survey can be found in [17]. Recently, there have been significant advances in optical interconnections. Fiber optic communication technologies offer a combination of gigabit transmi... |

200 |
How to emulate shared memory
- Ranade
- 1987
(Show Context)
Citation Context ...For probabilistic simulation, it is well known that by allowing packet combining, each step of a p-processor PRAM can be simulated by a p-node butterfly network in O�log p� time with high probabil=-=ity [46]-=-. Other deterministic and probabilistic simulation results are also reported in [1, 5, 18, 20, 22, 33, 34, 47, 48, 49]. A comprehensive survey can be found in [17]. Recently, there have been significa... |

115 |
Sorting in c log n parallel steps
- Ajtai, Komlós, et al.
- 1983
(Show Context)
Citation Context ...capacity are quite complicated. The bounded-degree networks constructed in the deterministic simulation algorithms of [4, 19] are highly irregular. In particular, they all use the AKS sorting network =-=[3]-=-, which is very sophisticated, practically not feasible to build, and has a huge hidden constant as large as 6,000 within the big-O notation [2]. On commonly used networks, it was reported that when m... |

111 |
Randomized and deterministic simulation of PRAMs by parallel machines with restricted granularity of parallel memories
- Mehlhorn, Vishkin
- 1984
(Show Context)
Citation Context ...ch step of a p-processor PRAM can be simulated by a p-node butterfly network in O�log p� time with high probability [46]. Other deterministic and probabilistic simulation results are also reported=-= in [1, 5, 18, 20, 22, 33, 34, 47, 48, 49]-=-. A comprehensive survey can be found in [17]. Recently, there have been significant advances in optical interconnections. Fiber optic communication technologies offer a combination of gigabit transmi... |

106 | Routing, merging and sorting on parallel models of computation
- Borodin, Hopcroft
- 1985
(Show Context)
Citation Context ...nificant. It is well known that the weakest PRAM model can simulate the strongest PRAMsefficient deterministic and probabilistic simulations of prams 167 model with only O�log p� slowdown (see, e.=-=g., [8] -=-and §10.1.1 of [21]). For ease of reference, we formally state this fact as a lemma. Lemma 2.1 Each step of a p-processor priority CRCW PRAM computation with m shared memory cells can be simulated by... |

86 |
How to share memory in a distributed system
- Upfal, Wigderson
- 1987
(Show Context)
Citation Context ...ch step of a p-processor PRAM can be simulated by a p-node butterfly network in O�log p� time with high probability [46]. Other deterministic and probabilistic simulation results are also reported=-= in [1, 5, 18, 20, 22, 33, 34, 47, 48, 49]-=-. A comprehensive survey can be found in [17]. Recently, there have been significant advances in optical interconnections. Fiber optic communication technologies offer a combination of gigabit transmi... |

52 |
Bulk-Synchronous Parallel Computers
- Valiant
- 1989
(Show Context)
Citation Context |

46 | Optimal bounds for decision problems on the CRCW PRAM
- Beame, Hastad
- 1989
(Show Context)
Citation Context ...g on a PRAM. Other examples are global aggregations such as finding the sum and prefix-sums of p values. While these operations take ��log p/ log log p� time on a priority CRCW PRAM with p proce=-=ssors [6], th-=-ey can be performed in O�1� time on a p-processor LARPBS. To get the best performance out of an LARPBS, one can design algorithms by directly taking advantages of the unique characteristics of opt... |

46 | Wavelength Division Multiple Access Channel Hypercube Processor Interconnection
- Dowd
- 1992
(Show Context)
Citation Context ...ror probability. Based on the characteristics of fiber optical communications, a number of researchers have proposed using optical interconnections to connect processors in a parallel computer system =-=[7, 9, 12, 15, 25, 30, 39, 43, 44, 50]-=-. In such a system, messages can be transmitted concurrently on a pipelined optical bus, by taking advantages of unidirectional message transmission and predictable propagation delay. It is now feasib... |

36 |
Linear array with a reconfigurable pipelined bus system - concepts and applications
- Pan, Li
- 1998
(Show Context)
Citation Context ...ror probability. Based on the characteristics of fiber optical communications, a number of researchers have proposed using optical interconnections to connect processors in a parallel computer system =-=[7, 9, 12, 15, 25, 30, 39, 43, 44, 50]-=-. In such a system, messages can be transmitted concurrently on a pipelined optical bus, by taking advantages of unidirectional message transmission and predictable propagation delay. It is now feasib... |

36 | Time-division optical communications in multiprocessor arrays
- Qiao, Melhem
- 1993
(Show Context)
Citation Context ...ror probability. Based on the characteristics of fiber optical communications, a number of researchers have proposed using optical interconnections to connect processors in a parallel computer system =-=[7, 9, 12, 15, 25, 30, 39, 43, 44, 50]-=-. In such a system, messages can be transmitted concurrently on a pipelined optical bus, by taking advantages of unidirectional message transmission and predictable propagation delay. It is now feasib... |

35 | Routing on the Array with Reconfigurable Optical Buses - Rajasekaran, Sahni, et al. - 1997 |

34 |
Preparata “ Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- Alt, Hagerup, et al.
- 1987
(Show Context)
Citation Context ... It was shown that each step of a p-processor PRAM can be simulated by a bounded-degree network with p-processors in O�log m log p� time, where m is the amount of shared memory cells used by the P=-=RAM [4]. Th-=-e time complexity was later improved to O�log m log p/ log log p� [19]. However, such simulations on bounded-degree networks that have limited communication connectivity and capacity are quite com... |

32 |
A survey of PRAM simulation techniques
- Harris
- 1994
(Show Context)
Citation Context ... O�log p� time with high probability [46]. Other deterministic and probabilistic simulation results are also reported in [1, 5, 18, 20, 22, 33, 34, 47, 48, 49]. A comprehensive survey can be found=-= in [17]-=-. Recently, there have been significant advances in optical interconnections. Fiber optic communication technologies offer a combination of gigabit transmission capacity, predictable message delay, lo... |

27 |
Coincident Pulse Technique for Multiprocessor Interconnection Structures
- Levitan, Chiarulli, et al.
- 1990
(Show Context)
Citation Context |

26 |
Pipelined communication in optically interconnected arrays
- Guo, Melhem, et al.
- 1991
(Show Context)
Citation Context |

26 | Matrix Operations using Arrays with Reconfigurable Optical Buses, manuscript - Pavel, Akl - 1995 |

24 | Using coincident optical pulses for parallel memory addressing
- Chiarulli, Melhem, et al.
- 1987
(Show Context)
Citation Context |

24 | Order Statistics on Optically Interconnected Multiprocessor Systems - Pan - 1994 |

19 | Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
- Li, Pan, et al.
- 1998
(Show Context)
Citation Context ...n. A number of basic communication, data movement, and aggregation operations on the LARPBS model implemented using the coincident pulse processor addressing technique [9, 25, 44] have been developed =-=[27, 39]-=-. Each of these primitive operations can be performed in a constant number of bus cycles. They provide an algorithmic view on parallel computing using optical interconnections, and also allow us to de... |

18 |
Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system
- Pan, Li, et al.
- 1998
(Show Context)
Citation Context ...nto M w. Both the summation and the extreme values can be found within group G i in O�log p i�=O�log p� time, using the standard binary tree method, though wes176 li, pan and zheng can do much=-= better [27, 40]-=-. Such combining operations do not increase the overall time complexity of the write phase. The discussion so far can be summarized as follows. Lemma 4.4 If there are at most n memory accesses by grou... |

16 | On physical Realizations of the Theoretical PRAM Model
- Abolhassan, J
- 1990
(Show Context)
Citation Context |

15 | Constant time boolean matrix multiplication on a linear array witha recon gurable pipelined bus system - Li - 1997 |

15 | Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system”, Future Generation Computer Systems - Pan, Hamdi, et al. |

14 | On the Power of Arrays with Reconfigurable Optical Bus
- Pavel, Akl
- 1996
(Show Context)
Citation Context |

13 | Sorting on array processors with pipelined buses - Guo - 1992 |

13 |
Pipelined asynchronous time-division multiplexing optical bus”, Opt
- Zheng, Li
- 1997
(Show Context)
Citation Context |

11 |
Deterministic simulations of PRAMs on bounded degree networks
- Herley, Bilardi
- 1988
(Show Context)
Citation Context ...bounded-degree network with p-processors in O�log m log p� time, where m is the amount of shared memory cells used by the PRAM [4]. The time complexity was later improved to O�log m log p/ log l=-=og p� [19]-=-. However, such simulations on bounded-degree networks that have limited communication connectivity and capacity are quite complicated. The bounded-degree networks constructed in the deterministic sim... |

11 |
A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmic
- Luccio, Pietracaprina, et al.
- 1990
(Show Context)
Citation Context ...ported that when m is a polynomial of p, one step of a p-processor PRAM can be simulated on a p × p mesh of trees in O�log 2 p/ log log p� time, where there are p root processors and O�p 2 � =-=switches [32]. Fo-=-r probabilistic simulation, it is well known that by allowing packet combining, each step of a p-processor PRAM can be simulated by a p-node butterfly network in O�log p� time with high probabilit... |

10 |
Parallel Hashing-An Efficient Implementation of Shared Memory
- Karlin, Upfal
- 1986
(Show Context)
Citation Context |

10 |
A Probabilistic Simulation of PRAMS on a Bounded Degree Network
- Luccio, Pietracaprina, et al.
(Show Context)
Citation Context |

9 | E cient computation of singular value decomposition on arrays with pipelined optical buses - Pan, Hamdi - 1996 |

8 | cient parallel algorithms on optically interconnected arrays of processors - Hamdi, Pan, et al. - 1995 |

8 |
Pipelined TDM optical bus with conditional delays
- Li, Pan, et al.
- 1997
(Show Context)
Citation Context |

6 |
F.P.: Deterministic P-RAM: simulation with constant redundancy
- Hornick, Preparata
- 1989
(Show Context)
Citation Context |

5 |
Deterministic pram simulation with constant memory blow-up and no time-stamps
- Aumann, Schuster
- 1990
(Show Context)
Citation Context |

5 |
Efficient simulations of small shared memories on bounded degree networks
- Herley
- 1989
(Show Context)
Citation Context |

5 | Fast and efficient parallel matrix computations on a linear array with a reconfigurable pipelined optical bus system - Li, Pan, et al. - 1998 |

5 |
Computation and Communication Aspects of Arrays with Optical Pipelined Buses
- Pavel
- 1996
(Show Context)
Citation Context ...s an important building block in many parallel algorithms. Simulation of PRAM computations on parallel systems with optical interconnections has been investigated by other researchers. It is shown in =-=[41, 43] tha-=-t each step of a p-processor priority CRCW PRAM using O�n� amount of memory locations can be simulated by an array processors with optical pipelined buses (APPB) and p-processors in constant numbe... |

4 |
Digital optical computing with optically switched directional couplers
- Benner, Jordan, et al.
- 1991
(Show Context)
Citation Context |

3 | Mapping of ANNs on linear array with a reconfigurable pipelined bus system - Cong - 1997 |

3 | Parallel selection on a pipelined TDM optical buses - Li, Zheng - 1996 |

2 | ªInversion Number Algorithm on a Linear Array with Reconfigurable Pipelined Bus System,º - Kimm - 1996 |

1 | transform on arrays with an optical bus - Hough - 1992 |