Abstract
SM-1 is a distributed memory SIMD parallel processor, developed by Toyohashi University of Technology and Sumitomo Metal Industries, Ltd. The project of SM-l started in 1990, and the first machine began to run early in 1992. Currently, two SM-1’s are running and are being used for research on SIMD parallel computation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
MasPar Computer Corp., “MasPar MP-1 Hardware Manuals,” 1990.
D. Hillis, The Connection Machine, Cambridge, MA, MIT Press, 1985.
M. Quinn, Designing Efficient Algorithms for Parallel Computers, New York, McGraw-Hill, 1987.
T. Kijima and T. Yuasa, The Parallel C Language Nami-C Language Specification, Toyohashi University of Technology, 1993.
M. Noda and T. Yuasa, The Parallel C Language Nami-C User’s Guide, Toyohashi University of Technology, 1993.
B. Kernighan and D. Ritchie, The C programming language, second edition, Englewood Cliffs, NJ, Prentice Hall Software Series, 1988.
MasPar Computer Corp., “MasPar Parallel Application Language (MPL) User Guide,” 1991.
Thinking Machines Corp., “C Programming Guide,” 1990.
M. Noda and T. Yuasa, The Parallel C Language Nami-C Library Specification, Toyohashi University of Technology, 1993.
R. Stallman, Using and Porting GNU CC, Free Software Foundation, Inc., 1990.
A. Aho, R. Sethi and J. Ullman, Compilers-Principles, Techniques, and Tools, Reading, MA, Addison-Wesley, 1986.
T. Kijima and T. Yuasa, “Design and Implementation of an Extended C Language Nami-C for SIMD Massively Parallel Programming,” Preprints Working Group for Programming Languages, IPSJ, 92-PRG-9-9, 1992 (in Japanese).
K. Noda, “Parallel debugger “Spade ” for the SM-1,” The 47th Annual Convention IPS J, 5-109, 1993 (in Japanese).
P. Hatcher and M. Quinn, Data-Parallel Programming on MIMD Computers, Cambridge, MA, MIT Press, 1991.
T. Yuasa, “A SIMD Environment TUPLE for Parallel List Processing,” in Robert H. Halstead, Jr., and Takayasu Ito (eds.), Parallel Symbolic Computing: Languages, Systems, and Applications (US/Japan Workshop Proceedings), Springer-Verlag. Lecture Notes in Computer Science, 748, 1993.
T. Yuasa, “Design and Implementation of Kyoto Common Lisp,” Journal of Information Processing,13(3), 1990.
T. Yuasa, “Memory Management and Garbage Collection of an Extended Common Lisp System for Massively Parallel SIMD Architecture,” Proc. International Workshop IWMM 92, St. Maro, Springer-Verlag. Lecture Notes in Computer Science, 637, 1992.
Thinking Machines Corp., “Introduction to Programming in C/Paris,” 1989.
G. Steele and D. Hillis, “Connection Machine Lisp: Fine-Grained Parallel Symbolic Processing,” Proc. 1986 ACM Conference on Lisp and Functional Programming, 1986.
S. Wholey and G. Steele, “Connection Machine Lisp: A Dialect of Common Lisp for Data Parallel Programming,” Proc. Second International Conference on Supercomputing, 1987.
G. Sabot, “Introduction to Paralation Lisp,” Technical Report PL87-1, Thinking Machines Corp., 1987.
G. Sabot, The Paralation Model: Architecture Independent Parallel Programming, Cambridge, MA, MIT Press, 1988.
J. Padget, “Collections and Garbage Collection,” Proc. International Workshop IWMM 92, St. Maro, Springer-Verlag. Lecture Notes in Computer Science, 637, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Yuasa, T., Matsuda, M., Kijima, T. (1995). SM-1 and Its Language Systems. In: Bic, L.F., Nicolau, A., Sato, M. (eds) Parallel Language and Compiler Research in Japan. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2269-0_15
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2269-0_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5957-9
Online ISBN: 978-1-4615-2269-0
eBook Packages: Springer Book Archive