Skip to main content

Assessing the Usability of Parallel Programming Systems: The Cowichan Problems

  • Conference paper
Programming Environments for Massively Parallel Distributed Systems

Part of the book series: Monte Verità ((MV))

Abstract

The only control-parallel programming model to win wide acceptance to date has been procedural message passing. One reason that higher-level systems have not been widely accepted is that there is no consensus on what they should offer; one reason for this is that there has been no systematic comparison of the usability of alternatives models and systems. This paper describes a problem suite with which the usability, rather than performance, of parallel programming systems may be assessed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Henri Bal. Programming Distributed Systems. Prentice Hall, 1991.

    Google Scholar 

  2. Guy E. Blelloch. Scans as Primitive Parallel Operations. IEEE Transactions on Computers, 38(11), November 1989.

    Google Scholar 

  3. L. Bomans, D. Roose, and R. Hempel. The Argonne/GMD macros in FORTRAN for Portable Parallel Programming and Their Implementation on the Intel iPSC/2. Parallel Computing, 15:119–132, 1990.

    Article  MATH  Google Scholar 

  4. Phil Edmonds, Eleanor Chu, and Alan George. Dynamic Programming on a Shared-Memory Multiprocessor. Parallel Computing, pages 9–22, 1993.

    Google Scholar 

  5. Norman E. Fenton. Software Metrics: A Rigorous Approach. Chapman and Hall, 1991.

    Google Scholar 

  6. John T. Feo, editor. A Comparative Study of Parallel Programming Languages: The Salishan Problems. North-Holland, 1992.

    Google Scholar 

  7. E. W. Feiten and S. W. Otto. A Highly Parallel Chess Program. In Proc. International Conference on 5th Generation Computer Systems, pages 1001–1009, 1988.

    Google Scholar 

  8. G. A. Geist and V. S. Sunderam. Network-Based Concurrent Computing on the PVM System. Concurrency: Practice and Experience, 4(4), June 1992.

    Google Scholar 

  9. Maurice H. Halstead. Elements of Software Science. Elsevier North-Holland, 1975.

    Google Scholar 

  10. Donald Knuth and Ronald W. Moore. An Analysis of Alpha-Beta Pruning. Artificial Intelligence, 6, 1975.

    Google Scholar 

  11. David Levy, editor. Computer Chess Compendium. Batsford, 1988.

    Google Scholar 

  12. Thomas J. McCabe. A Complexity Measure. IEEE Transactions on Software Engineering, 2(4):308–320, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  13. David M. Nicol and Joel H. Saltz. An Analysis of Scatter Decomposition. IEEE Transactions on Computers, 39(11): 1337–1345, November 1990.

    Article  Google Scholar 

  14. Constantine D. Polychronopoulos and David J. Kuck. Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Transactions on Computers, 36(12), December 1987.

    Google Scholar 

  15. Jonathan Schaeffer. Distributed Game-Tree Searching. Journal of Parallel and Distributed Computing, 6:90–114, 1989.

    Article  Google Scholar 

  16. Smith, Mark. Dynamic load-balancing strategies for data parallel implementations of reaction-evolution-migration systems. International Journal of Modern Physics C, 4(1):107–119, (1993).

    Article  Google Scholar 

  17. Duane Szafron and Jonathan Schaeffer. Experimentally Assessing the Usability of Parallel Programming Systems. In Proceedings of the IFIP Working Conference on Programming Environments for Massively Parallel Distributed Systems. Birkhaeuser Verlag AG, April 1994.

    Google Scholar 

  18. Mark Smith and Greg Wilson. Dynamic Load Balancing on a One-Dimensional Mesh. Presented At Second European Distributed Memory Computing Conference, 1991.

    Google Scholar 

  19. Alan M. Turing. The Chemical Basis of Morphogenesis. Transactions of the Royal Society of London, 237, August 1952.

    Google Scholar 

  20. Gregory V. Wilson and Felicity A. W. George. Using Dynamic Programming to Benchmark Communications on Parallel Computers. In Proceedings of the Fifth North American Transputer Users’ Group. IOS Press, 1992.

    Google Scholar 

  21. Terry Winograd. Language as a Cognitive Process (Volume 1: Syntax). Addison-Wesley, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Basel AG

About this paper

Cite this paper

Wilson, G.V. (1994). Assessing the Usability of Parallel Programming Systems: The Cowichan Problems. In: Decker, K.M., Rehmann, R.M. (eds) Programming Environments for Massively Parallel Distributed Systems. Monte Verità. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8534-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8534-8_18

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9668-9

  • Online ISBN: 978-3-0348-8534-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics