Skip to main content

“CHESS” Multiprocessor A Processor-Memory Grid for Parallel Programming

  • Chapter
Cache and Interconnect Architectures in Multiprocessors

Abstract

In this paper we describe the architecture of a parallel computer named “CHESS” designed for the parallel execution of imperative languages. It features a grid of processors and memories which connect with each other to form a processing surface onto which a program is mapped. The grid can be implemented using standard bus technology and 4N caches. A diffusion algorithm distributes the work load and minimizes long haul communications between processors. The resulting computer architecture provides a uniform picture to the user and a familiar programming model with increased performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal A. and A. Gupta, “Memory-Reference Characteristics of Multiprocessor Applications under MACH,” Proceedings of ACM Sigmetrics 1988.

    Google Scholar 

  2. Archibald J. and J. Baer, “An Evaluation of Cache Coherence Solutions in Shared-Bus Multiprocessors,” ACM Trans, on Computer Systems, 4, 4, November 1986.

    Article  Google Scholar 

  3. Bell C.G, “Multis: A New Class of Multiprocessor Computers,” Science, 228, April 1985.

    Google Scholar 

  4. Bisiani R., Nowatzyk A., & Ravishankar M., “Coherent Shared Memory on a Message Passing Machine”, Carnegie Mellon University, Computer Science Report # CMU-CS-88-204, December 1988.

    Google Scholar 

  5. Das C.R, and L.N. Bhuyan, “Computation Availability of Multiple-Bus Multiprocessors”, U of Southwestern Louisiana, 1985.

    Google Scholar 

  6. Dubois M., Scheurich C, and Briggs F., “Memory Access Buffering in Multiprocessors”, 13th ISCA, pages 434–442, IEEE, June 1986.

    Google Scholar 

  7. Eggers S. and R. Katz, “Characterization of Sharing in Parallel Programs and its Applicability to Coherency Protocol Evaluation,” Proc. of 15th Intl. Symp. on Computer Architecture, Hawaii, June 1988.

    Google Scholar 

  8. Patterson D.A., Gibson G. & Katz R.H. “A Case for Redundant Arrays of Inexpensive Disks (RAID)” ACM SIGMOD, Chicago, June 1–3, 1988.

    Google Scholar 

  9. Goodman J. “Using Cache Memories to Reduce Processor-Memory Traffic,” Proc. of the 10th Intl Symp. on Computer Architecture, Stockholm June 1983.

    Google Scholar 

  10. Hill M.D. et. al. “SPUR: A VLSI Multiprocessor Workstation,” IEEE Computer, 19, 11 November 1986.

    Google Scholar 

  11. Keller R.M. & Lin F.C.H., “Simulated Performance of a Reduction-Based Multiprocessor”, Computer 17(7), July 1984.

    Google Scholar 

  12. Rose C.D, “Encore Eyes Multiprocessor Market,” Electronics July 8, 1985.

    Google Scholar 

  13. Satyanarayanan M. “Commercial Multiprocessing Sys terns,” IEEE Computer, 13, 5, May 1980.

    Google Scholar 

  14. Sequent Computer Systems, Inc. “Balance 8000” Technical Summary, Nov 1984.

    Google Scholar 

  15. Thacker C. and L. Stewart, “Firefly: A Multiprocessor Workstation”, 2nd Intl. Conference on Architectural Support for Programming Languages and Operating Systems, pp 164–172, ACM, October 1987.

    Google Scholar 

  16. Wilson A. W. Jr, “Hierarchical Cache/Bus Architecture for Shared Memory Multiprocessors,” Proc of 14th Intl. Symp. on Computer Architecture, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Kluwer Academic Publishers

About this chapter

Cite this chapter

Lioupis, D., Kanellopoulos, N. (1990). “CHESS” Multiprocessor A Processor-Memory Grid for Parallel Programming. In: Dubois, M., Thakkar, S.S. (eds) Cache and Interconnect Architectures in Multiprocessors. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1537-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1537-7_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8824-4

  • Online ISBN: 978-1-4613-1537-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics