Guy Blelloch
John Greiner
- 1.Samson Abramsky and R. Sykes. Secd-m: A virtual machine for applicative programming. In Jean-Pierre Jouannaud, editor, Proceedzngs 2nd International Conference on Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, pages 81-98, 1985. Google Scholar
Digital Library
- 2.Amir M. Ben-Amram and Zvi Galil. On pointers versus addresses. Journal of the A CM, 39(3):617-648, July 1992. Google ScholarDigital Library
- 3.Bror Bjerner and S6ren HolmstrSm. A compositional approach to time analysis of first order lazy functional programs. In Proceedings jth Internatzonal Conference on Functional Programmzng Languages and Computer Architecture. Springer-Verlag, September 1989. Google ScholarDigital Library
- 4.Guy Blelloch. An L1 User's Manual (Verszon 1.2: Draft), November 1989.Google Scholar
- 5.Guy E. Blelloch. Vector Models for Data-Parallel Computing. MIT Press, 1990. Google ScholarDigital Library
- 6.Guy E. Blelloch. NESL: A nested data-parallel language (version 2.6). Technical Report CMU-CS-93-129, School of Computer Science, Carnegie Mellon University, April 1993. Google ScholarDigital Library
- 7.Guy E. Blelloch and John Greiner. A parallel complexity model for functional languages. Technical Report CMU-CS-94-196, Carnegie Mellon University, October 1994. Google ScholarDigital Library
- 8.A. P. Willem Bohm and R. E. Hiromoto. The datafiow time and space complexity of FFTs. Journal of Parallel and Dzstributed Computing, 18(3):301-313, July 1993. Google ScholarDigital Library
- 9.Richard P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the A CM, 21(2):201- 206, 1974. Google ScholarDigital Library
- 10.I. Checkland and C. Runciman. Perfect hash functions made parallel--lazy functional programming on a distributed multiprocessor. In T. N. Mudge, V. Milutinovic, and L. Hunter, editors, Proceedings 26th Hawaii International Conference on System Sciences, volume 2, pages 397-406, January 1993.Google Scholar
- 11.C. D. Clack and Simon Peyton Jones. Generating parallelism from strictness analysis. Technical Report Internal Note 1679, Dept. Comp. Sci., University College London, February 1985.Google Scholar
- 12.D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. yon Eicken. LogP: Towards a realistic model of parallel computation. In Proceedings Jth A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming, May 1993. Google ScholarDigital Library
- 13.Vincent Dornic, Pierre Jouvelot, and David K. Gifford. Polymorphic time systems for estimating program complexity. A CM Letters on Programming Languages and Systems, 1(1):33-45, March 1992. Google ScholarDigital Library
- 14.John T. Feo, David C. Cann, and Rodney R. Oldehoeft. A Report on the Sisal Language Project. Journal of Parallel and Distributed Computing, 10(4):349-366, December 1990. Google ScholarDigital Library
- 15.Steven Fortune and James Wyllie. Parallelism in random access machines. In Proceedings l Oth A CM Symposium on Theory of Computing, pages 114-118, 1978. Google ScholarDigital Library
- 16.J. Gil, Yossi Matias, and Uzi Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proceed- ~ngs Symposium on Foundations of Computer Science, pages 698-710, October 1991. Google Scholar
- 17.T. Goldberg and U. gwick. Optimal deterministic processor allocation. In Proceedings Jth A CM-SIAM Syrup. on Discrete Algorithms, January 1995.Google Scholar
- 18.Michael T. Goodrich and S. Rao Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. In 30th Annual Symposium on Foundations of Computer Science, pages 190-195, November 1989.Google ScholarDigital Library
- 19.Paul Hudak and Steve Anderson. Pomset interpretations of parallel functional programs. In Proceedings 3rd International Conference on Functional Programmzng Languages and Computer Architecture, number 274 in Lecture Notes in Computer Science, pages 234- 256. Springer-Verlag, September 1987. Google ScholarDigital Library
- 20.Paul Hudak and Eric Mohr. Graphinators and the Duality of SIMD and MIMD. In A CM Conference on L~sp and Functional Programming, pages 224-234, July 1988. Google ScholarDigital Library
- 21.Nell D. Jones. Constant time factors do matter (extended abstract). In Proceedings 25th A CM Symposium on Theory of Computing, pages 602-611, 1993. Google ScholarDigital Library
- 22.R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science- Volume A: Algorithms and Complexity. MIT Press, Cambridge, Mass., 1990. Google ScholarDigital Library
- 23.Richard Kennaway. A conflict between call-by-need computation and parallelism (extended abstract). In Proceedings Conditional Term Rewriting Systems-gd, February 1994. Google ScholarDigital Library
- 24.Donald E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley Publishing Company, Reading, MA, 1968.Google Scholar
- 25.P. J. Landin. The mechanical evaluation of expressions. Computer Journal, 6:308-320, 1964.Google ScholarCross Ref
- 26.Yossi Matias and Uzi Vishkin. Converting high probability into nearly-constant time--with applications to parallel hashing. In Proceedings A CM Symposium on Theory of Computing, pages 307-316, May 1991. Google ScholarDigital Library
- 27.Kurt Mehlhorn and Uzi Vishkin. Randomized and determirdstic simulations of PRAMs by parallel machines with restricted granularity of parallel memory. Acta informatica, 21:339-374, 1984. Google ScholarDigital Library
- 28.Rishiyur S. Nikhil. ID Version 90.0 Reference Manual. Computation Structures Group Memo 284~1, Laboratory for Computer Science, Massachusetts Institute of Technology, July 1990.Google Scholar
- 29.Robert Paige. Real-time simulation of a set machine on a RAM. In W. Koczkodaj, editor, Proceedings In~ ternational Conference on Computing and Information, volume 2, pages 68-73, 1989.Google Scholar
- 30.S. L. Peyton Jones. Parallel Implementations of Functional Programming Languages. The Computer Journal, 32(2):175-186, 1989. Google ScholarDigital Library
- 31.Gordon D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125- 159, 1975.Google ScholarCross Ref
- 32.Abhiram G. Ranade. Fluent Parallel Computation. PhD thesis, Yale University, Department of Computer Science, New Haven, CT, 1989. Google ScholarDigital Library
- 33.Abhiram G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42(3):307- 326, June 1991. Google ScholarDigital Library
- 34.R. Reischuk. Probabillstic parallel ~lgorithms for sorting and selection. SIAM Journal of Computing, 14(2):396-409, 1985.Google ScholarCross Ref
- 35.Brian Reistad and David K. Gifford. Static dependent costs for estimating execution time. In Proceedings A CM Conference on LISP and Functional Programming, pages 65-78, July 1994. Google ScholarDigital Library
- 36.Paul Roe. Calculating lenient programs' performance. In Simon L Peyton Jones, Graham Hutton, and Carsten Kehler Holst, editors, Proceedings Functional Programming, Glasgow 1990, Workshops in computing. Springer-Verlag, August 1990.Google Scholar
- 37.Paul Roe. Parallel Programming using Functional Languages. PhD thesis, Department of Computing Science, University of Glasgow, February 1991.Google Scholar
- 38.Mads Rosendahl. Automatic complexity analysis. In Proceedings dth International Uonference on Functional Programming Languages and Computer Architecture. Springer~Verlag, September 1989. Google ScholarDigital Library
- 39.David Sands. Calculi for Tzme Analysis of Functional Programs. PhD thesis, University of London, Imperial College, September 1990.Google Scholar
- 40.Helmut Seidl and Reinhard Wilhelm. Probabilistic load balancing for parallel graph reduction. In Proceedings TENCON '89, Jth {EEE Region 10 International Uonference, pages 879-884, November 1989.Google ScholarCross Ref
- 41.Yossi Shiloach and Uzi Vishkin. Finding the maximum, merging and sorting in a parallel computation model. Journal of Algorithms, 2(1):88-102, 1981.Google ScholarCross Ref
- 42.Yossi Shiloach and Uzi Vishkin. An O(n2 log n) parallel Max~Flow algorithm. J. Algorithms, 3:128-146, 1982. Google ScholarDigital Library
- 43.David B. Skillicorn and W. Ceil. A cost calculus for parallel functional programming. To appear in the Journal of Parallel and Distributed Computing. Google ScholarDigital Library
- 44.Robert E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. System $ci., 18:110-127, 1979.Google Scholar
- 45.Philip Wadler. Strictness analysis aids time analysis. In Proceedings 15th A CM Symposium on Principles of Programming Languages, January 1988. Google ScholarDigital Library
- 46.Wolf Zimmermann. Automatic worst case complexity analysis of parallel programs. Technical Report TR-90- 066, International Computer Science institute, December 1990.Google Scholar
- 47.Wolf Zimmermann. Complexity issues in the design of functional languages with explicit parallelism. In Proceedings International Conference on Computer Languages, pages 34-43, 1992.Google ScholarCross Ref
Index Terms
- Parallelism in sequential functional languages
Recommendations
Comparing Parallel Functional Languages: Programming and Performance
This paper presents a practical evaluation and comparison of three state-of-the-art parallel functional languages. The evaluation is based on implementations of three typical symbolic computation programs, with performance measured on a Beowulf-class ...
Comments