Zvi Galil
- 1 AHO, A.V., HOPCROFT, J.E, AND ULLMAN, J D,Analysts and Design of Computer Algorahms. Addison-Wesley, Reading, Mass, 1974. Google Scholar
- 2 ANGLUIN, D, AND VALIANT, L.G Fast probabtlistic algorithms for Hamikoman circuits and matchings. In Proc 9th Ann. A CM Symp. on Theory of Computing (Boulder, Colo, May 1977), ACM, New York, 1977, pp 30-41. Google Scholar
- 3 BARZDIN, YA M., AND KALNIN'SH, YA.YA A universal automaton with vanable structure Automatic Control and Computer Science 8, 2 (1974), 9-17 {Engl traits available from Allerton Press, New York, pp. 6-121Google Scholar
- 4 BaTCHER, K.E Sorting networks and their applications. In Proc AFIPS Spring Joint Computer Conference Vol 32 (April 1968), AFIPS Press, Arlington, Va,, 1968, pp. 307-314.Google Scholar
- 5 BORODIN, A.On relating time and space to stze and depth. SIAM ~ Comput. 6, 4 (1977), 733-744.Google Scholar
- 6 CHANDRA, A K., KOZFN, D.C, AND STOCK_MEYER, L.T Alternation J. ACM 28. 1 (Jan. 1981), 114-133. Google Scholar
- 7 COLE, S.N. Real-time computation by Lterative array of finite state machines. Ph D. Dissertation, Harvard Umv, Cambridge, Mass., August 1964.Google Scholar
- 8 COOK, S.A. Towards a complexity theory of synchronous parallel computatton. Presented at Int. Syrup tiber Logtk und Algortthmik zu Ehren von Professor Ernst Specker, Zurich, Swttz., Feb. 1980.Google Scholar
- 9 DYMOND, P, AND COOK, S.A.,Hardware complexity and parallel computation In Conf. Rec. 21th Ann. IEEE Syrup on Foundations of Computer Science (Syracuse, N Y., Oct 1980), IEEE, New York, 1980, pp 360-372Google Scholar
- 10 GALIL, Z., AND PAUL, W.J. An effioent general-purpose parallel computer Unpubhshed manuscript, Tel-Aviv Univ., Aug 1980 (first version Apr 1980)Google Scholar
- 11 GOLDSCHLAGER, L A umfied approach to models of synchronous patalld machines. In Prec. lOIh Ann A CM Syrup on Theory of Computing (San Diego, Calff, May 1978), ACM, New York, 1978, pp. 89-94. Google Scholar
- 12 GUIBAS, L J, KtlNG, H T, ANt) TMOMPSON, C.D Direct VLSI implementation of oombinatoml algorithm Res Rep, Dep of Computer Soence, Carnegie-Mellon Univ., Pittsburgh, Pa., Mar. 1979.Google Scholar
- 13 HoovER, H J Some topics m ctrcuit complexity Tech. Pep. 139/80, Dep. of Computer Science, Univ of Toronto, Toronto, Ont., Canada, Dec. 1979.Google Scholar
- 14 JA'JA', J , AND SIMON, J Parallel algorithms in graph theory' Planarity testing. SlAM d. Comput. 11, (May 1982), 314-328Google Scholar
- 15 KNUIH, DE.The Art of Computer Programming, Vol. 3" Sorting and Searching. Addison-Wesley, Reading, Mass, 1973 Google Scholar
- 16 KRAPCHENKO, V.M Asymptotic esumattoa of addgion time of a parallel adder. Probl. KIbern. 19, 107-122 {Engl. transl in Syst Theory Res 19 (1970), 105-122}Google Scholar
- 17 KUNG, H T., AND LEISERSON, C E Systolic arrays (for VLSI) In 1978 Sparse Matrix Computations Syrup. (Knoxville, Tenn, Nov 1978), SIAM, Phdadelphia, Pa., 1979, pp. 256--282.Google Scholar
- 18 LADNER, R E., Ant) FISCHER, M J Parallel prefix computation Z A CM 27, 4 (Oct. 1980), 831-838 Google Scholar
- 19 LEv, G, PIPPENGER, N., AND VALIANT, L.G, A fast parallel algonthm for routing in permutation networks. IEEE Trans. Comput C-30, 2 (Feb. 1981), 93-100.Google Scholar
- 20 LEVITT, K N, Afro Kxtrrz, W H.Cellular arrays for the soluuon of graph problems. Commun. A CM 15, 9 (Sept. 1972), 78%801 Google Scholar
- 21 NASSIMI, D., AND SAHNI, S.B~tomc sort on a mesh-connected parallel computer. IEEE Trans. Comput C-28, 1 (Jan 1979), 2-7Google Scholar
- 22 NASSIMI, D, AND SAItNI, S An optimal routing algorithm for mesh-connected parallel computers. J. ACM 27, 1 (Jart. 1980), 6-29. Google Scholar
- 23 NASSIMI, D., AND SAHNI, S A self-routing Benes network and parallel permutation algorithms. IEEE Dans Comput C-30, 5 (May 1981), 332+340Google Scholar
- 24 OFMAN, Ju.P A universal automaton. Trans of the Moscow Math See. 14 (1965), 186-199 {Engl. tran8 ARN. Math Soc, Providence, R I (1967), 200-215}Google Scholar
- 25 PAUL, W J., AND REISCItUK, R On alternauon, II Acta lnf 14, 4 (1980), 391-403.Google Scholar
- 26 PIPPENGER, N On simultaneous resource bounds In Conf. Rec 20th Ann. IEEE 3ymp. on Founda. ttons of Computer Saence (Puerto Rico, Oct. 1979), IEEE, New York, 1979, pp. 307-311.Google Scholar
- 27 PREPARATA, F P.New parallel sorting schemes. IEEE Trans. Comput C-27 (1978), 669-673,Google Scholar
- 28 PREPARATA, F P., AND VUILLEMIN, J.The cube-connected-cycles A versatile network for parallel computation In Conf Rec 20th Ann IEEE Syrup on Foundatwns of Computer Science (Puerto Rico, Oct 1979), IEEE, New York, 1979, pp 140--147Google Scholar
- 29 SAVAOE, C., AND JA'JA', J Fast, efficient parallel algorithms for some graph problems. Unpublished manuscript, Dep. of Computer Science, Permsylvama State Univ., University Park, Pa., 1979.Google Scholar
- 30 SCHONHAGE, A.Storage modificauon machines Tech Rep., Tubingen Univ., West Germany, 1979.Google Scholar
- 31 SOtONHAGE, A., AND STRASSEN, V.SctmeUe Multtplakattoa grosser Zalden. Cemput 7 (1971), 281-292.Google Scholar
- 32 SCHWARTZ, J.T Ultracomputers. ACM Trans. Prog. Lang. Syst. 2, 4 (Oct. 1980), 484-521. Google Scholar
- 33 TUNG, C Arithmetic. In Computer Saence, A F Cardenas, L Presser, and M.A. Matin, Eds., Wdley-Intersclence, New York, 1972.Google Scholar
- 34 UPFAL, E Effioent schemes for parallel commumcatlon. In Prec. A CM Syrup. on Principles of D~stributed Computing (Ottawa, Cart., 1982), ACM, New York, 1982, pp. 55-59. Google Scholar
- 35 VALIANT, L.G Universal circmts In Proc 8th Ann A CM Syrup on Theory of Computing (Hershey, Pa, May 1976), ACM, New York, 1976, pp 196-203 Google Scholar
- 36 WAKSMAN, A A permutatmn network ~ ACM 15, 1 (Jan 1968), 159-163 Google Scholar
- 37 WALLACE, C.S. A suggesuon for a fast multtpher IEEE Trans Electron Circ. EC.13 (1964), 14-17Google Scholar
- 38 WYLUE, J C.The complexity of parallel computations Ph D Dissertation, Computer Science Dep., Cornell Univ., Ithaca, N Y., Aug. 1981.Google Scholar
Index Terms
- An Efficient General-Purpose Parallel Computer
Recommendations
Using Multiple Graphics Cards as a General Purpose Parallel Computer: Applications to Computer Vision
ICPR '04: Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01Pattern recognition and computer vision tasks are computationally intensive, repetitive, and often exceed the capabilities of the CPU, leaving little time for higher level tasks. We present a novel computer architecture which uses multiple, commodity ...
An Efficient General In-Place Parallel Sorting Scheme
We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We ...
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer
We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine composed of thousands of autonomous processing elements. This machine uses an enhanced message switching network with the geometry of an Omega-network to approximate ...
Comments