ACM Home Page
Please provide us with feedback. Feedback
FLATS, a machine for numerical, symbolic and associative computing
Full text PdfPdf (516 KB)
Source International Symposium on Computer Architecture archive
Proceedings of the 6th annual symposium on Computer architecture table of contents
Pages: 102 - 110  
Year of Publication: 1979
Authors
Sponsors
IEEE : Institute of Electrical and Electronics Engineers
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 15,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Functional aspects of a machine called FLATS are described. FLATS aims to efficiently run both numerical and algebraic programs. Overflow free and variable precision arithmetic, table look-up computation, and associative computation based on single-hit content addressed tables are introduced for advanced numerical, algebraic and symbolic computing. Hashing hardware, tag mechanism and hardware list processing are used to realize these features.


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.

 
1
Hearn, A.C. REDUCE2 user's manual, Utah Computational Physics UCP-19 (March 1973)
 
2
The MATHLAB Group, MACSYMA reference manual, Laboratory for computer science, MIT (1974)
 
3
Watson, W.J. The TI ASC - A Highly Modular and Flexible Super Computer Architecture, AFIPS 1972 FJCC, AFIPS Press
4
 
5
Barnes, G.H., Brown, R.M., Kato, M., Kuck, D.J., Slotnick, D.L. and Stokes, R.A. The ILLIAC IV Computer, IEEE Trans. Computers, Vol. C-47, No. 8 (1968)
6
 
7
Takahasi, H. and Mori, M. "Double Exponential Formulas for Numerical Integration", Pub. Research Institute for Math. Science, Kyoto University, 9 (1974), 721-741
 
8
Grau, A.A. "Algorithm 256, Modified Graeffe Method", Collected Algorithms from ACM, 256-P1-0.
9
 
10
Ida. T., and Goto, E. Overflow Free and Variable Precision Computing in FLATS, Journal of Information Processing Vol. 1, No. 3 (1978)
 
11
Goto, E. and Terashima, M. MTAC - Mathematical Tabulative Automatic Computing, Technical Report of Information Science, 77-03, Faculty of Science, University of Tokyo, (1977)
12
 
13
Goto, E., Sassa, M. and Kanada, Y. Algorithms and Programming with CAM's (Content Addressable Associative Memories) Technical Report of Information Science Department, 78-04, Faculty of Science, University of Tokyo, (1978) submitted for publication
 
14
Marti, J.B., Hearn, A.C., Griss, M.L., and Griss, C. Standard Lisp Report, UUCS-78-101, University of Utah, 1978
 
15
 
16
Sassa, M. and Goto, E. A Hashing Method for Fast Set Operations, Information Processing Letters, Vol. 5, No. 2, (1976)
 
17
Feustel, E.A. On the advantage of tagged architecture, IEEE Trans. Computers, Vol.C-21, No. 9 (1972)
 
18
Ida, T, and Goto, E., Performance of a Parallel Hash Hardware with Key Deletion, Proc. IFIP Congress 77, North-Holland (1977)
 
19
Ida, T, and Goto, E. Analysis of Parallel Hashing Algorithms with Key Deletion, Journal of Information Processing, Vol. 1, No.1 (1978)
 
20
Wegbreit, B. A Generalized Compactifying Garbage Collector. The Computer Journal, Vol. 15, No. 3, (1972)
 
21
Terashima, M. and Goto, E., Genetic Order and Compactifying Garbage Collectors, Information Processing Letters, Vol. 7, No. 1
 
22
Sassa, M. and Goto, E. "V-tape", a Virtual Memory Oriented Data Type, and its Resource Requirements, Information Processing Letters, Vol. 6, No. 2, (1977)


Collaborative Colleagues:
Eiichi Goto: colleagues
Tetsuo Ida: colleagues
Kei Hiraki: colleagues
Masayuki Suzuki: colleagues
Nobuyuki Inada: colleagues