ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Optimal simulations between mesh-connected arrays of processors
Full text PdfPdf (604 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the eighteenth annual ACM symposium on Theory of computing table of contents
Berkeley, California, United States
Pages: 264 - 272  
Year of Publication: 1986
ISBN:0-89791-193-8
Authors
S R Kosaraju  Dept. of Elec. Eng. and Computer Science, Johns Hopkins University, Baltimore, MD
M J Atallah  Dept. of Computer Science, Purdue University, West Lafayette, IN
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/12130.12157
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
A
M. J. Atallah, "Simulations Between Mesh-Connected Processor Arrays," Proc. 23nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, October 1985. (Also Purdue Univ. Computer Science Tech. Rept. #528, July 1985.)
 
AR
R. Alehunas and A. L. Rosenberg, On embedding rectangular grids in square grids, IEEE Trans. on Computers, Vol. c-31, No. 9 (1982), pp. 907-913.
DEL
Richard A. DeMillo , Stanley C. Eisenstat , Richard J. Lipton, Preserving average proximity in arrays, Communications of the ACM, v.21 n.3, p.228-231, March 1978  [doi>10.1145/359361.359447]
 
R1
A.L. Rosenberg, Preserving proximity in arrays, SIAM J. Comput., 4 (1975), pp. 443-460.
 
R2
A.L. Rosenberg, Data encodings and their costs, Acta Inform., 9 (1978), pp. 273-292.
R3
Arnold L. Rosenberg, Encoding Data Structures in Trees, Journal of the ACM (JACM), v.26 n.4, p.668-689, Oct. 1979  [doi>10.1145/322154.322160]
 
R5
A.L. Rosenberg and L. Snyder, Bounds on the costs o f data encodings, Math. Syst. Theory, 12 (1978), pp. 9-39.

CITED BY  2
Anja Feldmann , Ming-Yang Kao , Jiří Sgall , Shang-Hua Teng, Optimal online scheduling of parallel jobs with dependencies, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.642-651, May 16-18, 1993, San Diego, California, United States
M. J. Atallah, On Multidimensional Arrays of Processors, IEEE Transactions on Computers, v.37 n.10, p.1306-1309, October 1988

INDEX TERMS

Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines)

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Network problems


General Terms:
Theory, Verification

Collaborative Colleagues:
S R Kosaraju: colleagues
M J Atallah: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player