Abstract
Historically, shared memory and virtual memory have been the main line programming model from an applications and computer science perspective for two reasons: shared memory is a flexible and high performance means of communicating between processors, tasks or threads and; shared memory provides high programming efficiency through use of conventional memory management methods. The KSR1™ bridges the gap between the historical shared memory model and MPPs by delivering the shared memory programming model and all of its benefits, in a scalable, highly parallel architecture. The KSR1 runs a broad range of mainstream applications, ranging from numerically intensive computation, to on-line transaction processing (OLTP) and database management and inquiry. The use of shared memory enables a standards based open environment. The KSR1’s shared memory programming model is made possible by a new architectural technique called ALLCACHE™ memory. The shared memory programming model delivered by ALLCACHE facilitates porting and high performance for customer and third party applications. Within this context, the KSR1 architecture and applications environment consisting of a conventioanl UNIX based OS (symmetrically executing across all processors) and programming environment (including conventional languages) will be described. The performance and porting experiences of two applications on the KSR1 will be discussed as well as the Kendall Square feature called Query Decomposer which automatically parallelizes complex queries tunning under Oracle7.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kilbum, T., Edwards, D.B.G., Lanigan, M.J., and Sumner, F.H. “One-level Storage System,” IRE Transactions, EC–11, Vol.2, pps. 223–235, April, 1962.
Denning, Peter J. “On Modeling Program Behavior,” Aiiinglon, VA: AFIPS Press: Proceedings, Spring Joint Computer Conference, Vol. 40, pps. 937–944, 1972.
Smith, Alan J. Cache Memories ACM Computing Surveys, 14 (3): 473–530, September 1982.
Organic, E.I., “The Multics System: An Examination of Its Structure,” Cambridge, MA: MIT Press, 1972.
Bell, C. Gordon. “Multis: A New Class of Multiprocessor Computers,” Science, Vol. 228, pps. 462–467, 26 April 1985.
Wulf, William A. and Bell, C. Gordon. “C. mmp-A multi-miniprocessor,” Proceedings, AFIPS 1972 Fall Joint Computer Conference, 41, pp. 765–777, 1972.
Frank, Steven J. “Tightly Coupled Multiprocessor System Speeds Memory Access Times,” Electronics, pps. 164–169, 1984.
Seitz, Chaiies L. “The Cosmic Cube,” Communications of the ACM, 28–1, pps. 22–33, January, 1985.
Dally, William L. “The J-Machine: A Fine-Grain Concurrent Computer,” MIT VLSI Memo 89–532, May, 1989.
Li, Kai and Hudak, Paul. “Memory Coherence in Shared Virtual Memory Systems,” Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pps. 229–239, August, 1986.
Minnich, Ronald G. and Farber, David J. “The Mether System: Distributed Shared Memory for SunOS 4.0,” (private communication).
Swan, R., Fuller, S., and Siewiorek, D. “Cm*- A modular, multi-microprocessor,” Proceedings AFIPS 1977 Fall Joint Computer Conference, 46, pps. 637–644, 1977.
Picano, S., Brooks, E., and Hoag, J. “Programming Costs of Explicit Memory Localization on a Large Scale Shared Memory Multiprocessor,” Albuquerque, NM: Proceedings of Supercomputing ’91, pps. 36–45, November 1991.
Chaiken, David, Kubiatowicz, John and Agarwal, Anant “LimitLESS Directories: A Scalable Cache Coherence Scheme, ” Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems, pps. 224–234, April 1991.
Lenoski, Daniel, Laudon, James, Gharachorloo, Kourosh, Wolf-Dietrich Weber, Gupta, Anoop, and Hennessy, John. “Overview and Status of the Stanford DASH Multiprocessor,” Proceedings of International Symposium on Shared Memory Multiprocessing, pps. 102–108, April, 1991.
Kendall Square Research Corporation, “Technical Summary,” 1992.
Lamport, Leslie: “How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs,” IEEE Transactions on Computers, C–28, No. 9 (September 1979), pps. 690–691.
Leiserson, Charles E. “Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing,” IEEE Transactions on Computers, Vol. C–34, No. 10, pps. 892–901, October, 1985.
Leiserson, Charles E. “VLSI Theory and Parallel Supercomputing,” Pasadena, CA: Proceedings of the 1989 Decennial Caltech Conference, March, 1989.
Burke, E. “An Overview of System Software for the KSR1,” Compcon ’93 Proceedings.
Breit, S., Pangali, C. and Ziri, D. “Technical Applications on the KSR1: High Performance and Ease of Use,” Compcon ’93 Proceedings.
Reiner, D., Miller J. and Wheat, D. “The Kendall Square Query Decomposer,” Compcon ’93 Proceedings.
Grand Challenges: High Performance Computing and Communications: The FY 1992 U.S. Research and Development Program, Committee on Physical, Mathematical, and Engineering Sciences, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frank, S., Burkhardt, H., Rothnie, J. (1993). The KSR1: High Performance and Ease of Programming, No Longer an Oxymoron. In: Meuer, HW. (eds) Supercomputer ’93. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78348-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-78348-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56948-0
Online ISBN: 978-3-642-78348-7
eBook Packages: Springer Book Archive