×

zbMATH — the first resource for mathematics

Fast, efficient mutual and self simulations for shared memory and reconfigurable mesh. (English) Zbl 1049.68734

MSC:
68U20 Simulation (MSC2010)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aho A. V., Data Structures and Algorithms (1983) · Zbl 0487.68005
[2] Beame P., Journal of the ACM 36 (3) pp 643– (1989) · Zbl 0825.68378
[3] Ben-Asher Y., In Proc. 1st European Symposium on Algorithms (1993)
[4] Ben-Asher Y., Journal of Parallel and Distributed Computing 13 (2) (1991)
[5] Berkman O., In Proc. 3rd Workshop on Algorithms and Data Structures, Springer LNCS 709 pp 175– (1993)
[6] Berkman O., SIAM Journal on Computing 22 (2) pp 221– (1993) · Zbl 0770.68044
[7] Chaudhuri S., In Proc. 2nd Israel Symp. on Theory of Comp. and Sys. pp 25– (1993)
[8] Condon, R. E. Ladner , J. Lampe and R. Sinha Complexity of sub-bus mesh computations . Technical Report 93-10-02, Dept. of CSEE , University of Washington , 1993 . To appear in SIAM Journal on Computing . · Zbl 0856.68079
[9] Cook S. A., SIAM Journal on Computing 15 pp 87– (1986) · Zbl 0591.68049
[10] Cormen T H., Introduction to Algorithms (1990) · Zbl 1158.68538
[11] Czumaj A., In Workshop on Reconfigurable Architectures (1995)
[12] Ditzfelbinger M., Journal of Computer and System Sciences 48 (2) pp 231– (1994) · Zbl 0822.68049
[13] Gazit H., SLAM Journal on Computing 20 (6) pp 1046– (1991) · Zbl 0738.68062
[14] JáJá J., Introduction to Parallel Algorithms (1992) · Zbl 0781.68009
[15] Karlin A. R., Journal of the ACM 35 (4) pp 876– (1988) · Zbl 0662.68023
[16] Karp R. M., In Handbook of Theoretical Computer Science (1990)
[17] Kruskal C P., Theoretical Computer Science 71 pp 95– (1990) · Zbl 0699.68069
[18] Li H., Reconfigurable Massively Parallel Computers (1991)
[19] Lin R., Parallel Processing Letters 3 (1) pp 59– (1993)
[20] Matias Y., Highly Parallel Randomized Algorithmics (1992)
[21] Y Matias and A. Schuster On the power of the 2 {\(\times\)} n reconfigurable mesh. Technical report, AT&T Bell Laboratories , Murray Hill , NJ , 1993 .
[22] Mchlhorn K., Acta Informatica 21 pp 339– (1984)
[23] Miller R., IEEE Trans. Comput 42 (6) pp 678– (1993)
[24] Ragde P. L., Journal of Algorithms 14 pp 371– (1993) · Zbl 0793.68072
[25] Reif J. H., A Synthesis of Parallel Algorithms (1993)
[26] Schicber B., SIAM Journal on Computing 17 (6) pp 1253– (1988) · Zbl 0669.68049
[27] Schuster A., Dynamic Reconfiguring Networks for Parallel Computers Algorithms and Complexity Bounds (1991)
[28] G. Shemesh Upper and lower bounds for dynamically reconfiguring networks , Master’s thesis , July 1993 .
[29] Upfal E., Journal of the ACM 31 (3) pp 507– (1984) · Zbl 0628.68021
[30] Vaidyanathan R., Information Processing Letters 42 pp 203– (1992) · Zbl 0772.68024
[31] Vaidyanathan R., Information Processing Letters 47 pp 267– (1993) · Zbl 0783.68050
[32] Valiant L. G., SI AM Journal on Computing 4 pp 348– (1975) · Zbl 0311.68033
[33] Valiant L. G., Handbook of Theoretical Computer Science pp 944– (1990)
[34] Wang B., IEEE Transactions on Parallel and Distributed Systems 1 (4) pp 500– (1990) · Zbl 05106972
[35] Chen G.-H., Information Processing Letters 36 pp p1– (1990) · Zbl 0703.68022
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.