On the Number of Switching Modes Generated by Time-Optimal Algorithms for SS/TDMA Systems

Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 < p < n) processors are available, efficient algorithms on a p-processor BSR for some n-size problems can not be obtained from those on an n-processor BSR, and they have to be reconsidered. In this paper, we discuss and give two algorithms on a p-processor BSR for the two n-size problems of matching parentheses and decoding a binary tree from its bit-string, respectively, and show that they are time optimal.

Download Full-text

TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING

Parallel Algorithms and Applications ◽

10.1080/10637199608915557 ◽

1996 ◽

Vol 8 (3-4) ◽

pp. 271-283 ◽

Cited By ~ 1

Author(s):

ION STOICA

Keyword(s):

Optimal Algorithms ◽

Time Optimal

Download Full-text

Time-Optimal algorithms of searching for pulsed-point sources for systems with several detectors

Optoelectronics Instrumentation and Data Processing ◽

10.3103/s8756699017030013 ◽

2017 ◽

Vol 53 (3) ◽

pp. 203-209 ◽

Cited By ~ 1

Author(s):

A. L. Reznik ◽

A. V. Tuzikov ◽

A. A. Soloview ◽

A. V. Torgov

Keyword(s):

Point Sources ◽

Optimal Algorithms ◽

Time Optimal

Download Full-text

CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING

Parallel Processing Letters ◽

10.1142/s0129626492000386 ◽

1992 ◽

Vol 02 (02n03) ◽

pp. 249-256 ◽

Cited By ~ 13

Author(s):

D. BHAGAVATHI ◽

S. OLARIU ◽

J. L. SCHWING ◽

J. ZHANG

Keyword(s):

Convex Polygon ◽

Optimal Algorithms ◽

Time Optimal ◽

Edge Intersect

We propose time-optimal algorithms for a number of convex polygon problems on meshes with multiple broadcasting. Specifically, we show that on a mesh with multiple broadcasting of size n × n, the task of deciding whether an n-gon is convex, deciding whether two convex n-gons edge-intersect, deciding whether one convex n-gon lies in the interior of another, as well as variants of the tasks of computing the intersection and union of two convex n-gons can be accomplished in Θ( log n) time. We also show that detecting whether two convex n-gons are separable takes O(1) time.

Download Full-text