Haskell on a Shared-memory multiprocessor

Haskell'05 - Proceedings of the ACM SIGPLAN 2005 Haskell Workshop

Volumn , Issue , 2005, Pages 49-61

  Harris, Tim ^a   Marlow, Simon ^a   Jones, Simon Peyton ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Languages; Performance

Indexed keywords

COMPUTER PROGRAMMING; DATA STORAGE EQUIPMENT;

MULTI-CORE PROCESSORS; SHARED-MEMORY MULTIPROCESSORS; TRANSACTIONAL MEMORY;

MICROPROCESSOR CHIPS;

EID: 32144462989     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088348.1088354     Document Type: Conference Paper

References (26)

1. Alpha Architecture Handbook. Compaq Computer Corporation, 4th edition, Oct. 1998.
2. J. Armstrong. The development of Erlang. In ACM SIGPLAN International Conference on Functional Programming (ICFP'97), pages 196-203, Amsterdam, Aug. 1997. ACM.
3. L. Augustsson and T. Johnsson. Parallel graph reduction with the 〈v, g〉-machine. In ACM Conference on Functional Programming and Computer Architecture (FPCA'89), pages 202-213, London, Sept. 1989. ACM.
4. R. Ennals. Adaptive Evaluation of Non-String Programs. PhD thesis, Cambridge University Computer Laboratory, 2004.
5. C. Flood, D. Detlefs, N. Shavit, and C. Zhang. Parallel garbage collection for shared memory multiprocessors. In USENIX Java Virtual Machine Research and Technology Symposium, Monterey, CA, Apr. 2001.
6. K. Fraser. Practical lock freedom. PhD thesis, Cambridge University Computer Laboratory, 2003.
7. K. Hammond and G. Michaelson, editors. Research Directions in Parallel Functional Programming. Springer-Verlag, 1999.
8. T. Harris and K. Fraser. Language support for lightweight transactions. In Object-Oriented Programming, Systems, Langauges & Applications (OOPSLA '03), pages 388-402, Oct. 2003.
9. T. Harris, S. Marlow, S. P. Jones, and M. Herlihy. Composable memory transactions. In ACM Symposium on Principles and Practice of Parallel Programming (PPoPP'05), June 2005.
10. R. Jones. Tail recursion without space leaks. Journal of Functional Programming, 2(1):73-80, Jan 1992.
11. R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, July 1996.
12. K. Kawachiya, A. Koseki, and T. Onodera. Lock reservation: Java locks can mostly do without atomic operations. In OOPSLA, pages 130-141, 2002.
13. H.-W. Loidl, F. Rubio, N. Scaife, K. Hammond, S. Horiguchi, U. Klusik, R. Loogen, G. J. Michaelson, R. Pena, A. J. R. Portillo, S. Priebe, and P. W. Trinder. Comparing parallel functional languages: Programming and performance. Higher-order and Symbolic Computation, 16(3):203-251, September 2003.
14. V. J. Marathe, W. N. S. III, and M. L. Scott. Design tradeoffs in modern software transactional memory systems. In Proceedings of the 7th Workshop on Languages, Compilers, and Run-time Support for Scalable Systems, Oct. 2004.
15. S. Marlow, S. P. Jones, and W. Thaller. Extending the haskell foreign function interface with concurrency. In Proceedings of the ACM SIGPLAN workshop on Haskell, pages 57-68, Snowbird, Utah, USA, September 2004.
16. S. Marlow, S. Peyton Jones, A. Moran, and J. Reppy. Asynchronous exceptions in Haskell. In ACM Conference on Programming Languages Design and Implementation (PLDI'0I), pages 274-285, Snowbird, Utah, June 2001. ACM.
17. W. Partain. The nofib benchmark suite of Haskell programs. In Proceedings of the 1992 Glasgow Workshop on Functional Programming, pages 195-202, London, UK, 1993. Springer-Verlag.
18. S. Peyton Jones. Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. In C. Hoare, M. Broy, and R. Steinbrueggen, editors, Engineering theories of software construction. Marktoberdorf Summer School 2000, NATO ASI Series, pages 47-96. IDS Press, 2001.
19. S. Peyton Jones, A. Gordon, and S. Finne. Concurrent Haskell. In 23rd ACM Symposium on Principles of Programming Languages (POPL'96), pages 295-308, St Petersburg Beach, Florida, Jan. 1996. ACM.
20. A. Reid. Putting the spine back in the Spineless Tagless G-Machine: An implementation of resumable black-holes. In Proc. IFL'98 (selected papers), volume 1595 of LNCS, pages 186-199. Springer-Verlag, 1999.
21. N. Shavit and D. Touitou. Software transactional memory. In Proceedings of the I4th Annual ACM Symposium on Principles of Distributed Computing, pages 204-213. ACM Press, Aug. 1995.
22. H. Sutter. A fundamental turn toward concurrency in software. Dr. Dobb's Journal, March 2005.
23. P. Trinder, K. Hammond, H.-W. Loidl, and S. Peyton Jones. Algorithm + strategy = parallelism. Journal of Functional Programming, 8:23-60, Jan. 1998.
24. P. Trinder, K. Hammond, J. Mattson, A. Partridge, and S. Peyton Jones. GUM: a portable parallel implementation of haskell. In ACM Conference on Programming Languages Design and Implementation (PLDI'96). ACM, Philadelphia, May 1996.
25. P. Trinder, H. Loidl, and R. Pointon. Parallel and distributed Haskells. Journal of Functional Programming, 12:469-510, July 2002.
26. D. L. Weaver and T. Germond, editors. The SPARC architecture manual. Prentice Hall, 1994. Version 9.