On reducing interprocess communication overhead in concurrent programs

ACM SIGPLAN Erlang Workshop

Volumn , Issue , 2002, Pages 58-63

  Stenman, Erik ^a   Sagonas, Konstantinos ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Concurrent languages; Erlang; Process scheduling

Indexed keywords

BINARY CODES; COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING LANGUAGES; SCHEDULING;

INTERPROCESS COMMUNICATION;

CONCURRENT ENGINEERING;

EID: 0036986647     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/592849.592857     Document Type: Conference Paper

References (7)

1. M. Feeley. A case for the unified heap approach to Erlang memory management. In Proceedings of the PLI'01 Erlang Workshop, Sept. 2001.
2. M. Feeley and M. Laxose. Compiling Erlang to Scheme. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Principles of Declarative Programming, number 1490 in LNCS, pages 300-317. Springer-Verlag, Sept. 1998.
3. E. Johansson, M. Pettersson, and K. Sagonas. HiPE: A High Performance Erlang system. In Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pages 32-43. ACM Press, Sept. 2000.
4. E. Johansson, K. Sagonas, and J. Wilhelmsson. Heap architectures for concurrent languages using message passing. In Proceedings of ISMM'2002: ACM SIGPLAN International Symposium on Memory Management, pages 88-99. ACM Press, June 2002.
5. S. S. Muchnick. Advanced Compiler Design & Implementation. Morgan Kaufman Publishers, San Fransisco, CA, 1997.
6. S. Torstendahl. Open Telecom Platform. Ericsson Review, 75(1):14-17, 1997. See also: http://www.erlang.se.
7. J. Wilhelmsson. Exploring alternative memory architectures for Erlang: Implementation and performance evaluation. Uppsala master thesis in computer science 212, Uppsala University, Apr. 2002. Available at http://www.csd.uu.se/projects/hipe.