research-article

Scalable i/o event handling for GHC

Authors:

Bryan O'Sullivan,

Johan TibellAuthors Info & Claims

Haskell '10: Proceedings of the third ACM Haskell symposium on Haskell

Pages 103 - 108

https://doi.org/10.1145/1863523.1863536

Published: 30 September 2010 Publication History

Get Access

Abstract

We have developed a new, portable I/O event manager for the Glasgow Haskell Compiler (GHC) that scales to the needs of modern server applications. Our new code is transparently available to existing Haskell applications. Performance at lower concurrency levels is comparable with the existing implementation. We support millions of concurrent network connections, with millions of active timeouts, from a single multithreaded program, levels far beyond those achievable with the current I/O manager. In addition, we provide a public API to developers who need to create event-driven network applications.

Supplementary Material

JPG File (haskell-1445-osullivan.jpg)

Download
8.66 KB

MOV File (haskell-1445-osullivan.mov)

Download
93.85 MB

References

[1]

}}P. Haller and M. Odersky. Actors that unify threads and events. In Proceedings of the International Conference on Coordination Models and Languages, 2007.

Digital Library

Google Scholar

[2]

}}T. Harris, S. Marlow, and S. Peyton Jones. Haskell on a shared-memory multiprocessor. In Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, pages 49--61.

Digital Library

Google Scholar

[3]

}}T. Harris, S. Marlow, S. Peyton Jones, and M. Herlihy. Composable memory transactions. In PPoPP '05: Proceedings of the tenth ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, pages 48--60.

Digital Library

Google Scholar

[4]

}}R. Hinze. A simple implementation technique for priority search queues. In Proceedings of the 2001 International Conference on Functional Programming, pages 110--121.

Digital Library

Google Scholar

[5]

}}D. Jones Jr., S. Marlow, and S. Singh. Parallel performance tuning for Haskell. In Proceedings of the 2009 Haskell Symposium.

Digital Library

Google Scholar

[6]

}}S. Marlow, S. Peyton Jones, and W. Thaller. Extending the Haskell foreign function interface with concurrency. In Haskell '04: Proceedings of the ACM SIGPLAN workshop on Haskell, pages 57--68. URL http://www.haskell.org/~simonmar/papers/conc-ffi.pdf.

Digital Library

Google Scholar

[7]

}}C. Okasaki and A. Gill. Fast mergeable integer maps. In Workshop on ML, pages 77--86, 1998.

Google Scholar

[8]

}}B. O'Sullivan. Criterion, a new benchmarking library for Haskell. http://bit.ly/rUuAa, 2009.

Google Scholar

[9]

}}L. Peng and S. Zdancewic. Combining events and threads for scalable network services. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 189--199.

Digital Library

Google Scholar

[10]

}}S. Peyton Jones, A. Gordon, and S. Finne. Concurrent Haskell. In POPL '96: Proceedings of the 1996 Annual Symposium on Principles of Programming Languages, pages 295--308.

Digital Library

Google Scholar

[11]

}}R. von Behren, J. Condit, and E. Brewer. Why events are a bad idea (for high-concurrency servers). In HotOS IX: 9th Workshop on Hot Topics in Operating Systems, 2003.

Digital Library

Google Scholar

Cited By

View all

Voellmy AWang JHudak PYamamoto K(2013)MioACM SIGPLAN Notices10.1145/2578854.250379048:12(129-140)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1145/2578854.2503790
Voellmy AWang JHudak PYamamoto KShan C(2013)MioProceedings of the 2013 ACM SIGPLAN symposium on Haskell10.1145/2503778.2503790(129-140)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1145/2503778.2503790
Strebelow RPrehofer C(2012)Analysis of event processing design patterns and their performance dependency on i/o notification mechanismsProceedings of the 2012 international conference on Multicore Software Engineering, Performance, and Tools10.1007/978-3-642-31202-1_6(54-65)Online publication date: 31-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-31202-1_6
Show More Cited By

Index Terms

Scalable i/o event handling for GHC
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Runtime environments
    2. General programming languages
      1. Language features
        Concurrent programming structures
      2. Language types
        Concurrent programming languages
        Distributed programming languages
        Functional languages
        Parallel programming languages

Recommendations

Scalable i/o event handling for GHC
HASKELL '10

We have developed a new, portable I/O event manager for the Glasgow Haskell Compiler (GHC) that scales to the needs of modern server applications. Our new code is transparently available to existing Haskell applications. Performance at lower concurrency ...
Java Event Handling with Cdrom
Lightweight concurrency primitives for GHC
Haskell '07: Proceedings of the ACM SIGPLAN workshop on Haskell workshop

The Glasgow Haskell Compiler (GHC) has quite sophisticated support for concurrency in its runtime system, which is written in low-level C code. As GHC evolves, the runtime system becomes increasingly complex, error-prone, difficult to maintain and ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Haskell '10: Proceedings of the third ACM Haskell symposium on Haskell

September 2010

166 pages

ISBN:9781450302524

DOI:10.1145/1863523

General Chair:
Jeremy Gibbons
University of Oxford, UK

ACM SIGPLAN Notices Volume 45, Issue 11
HASKELL '10
November 2010
156 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2088456
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 September 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICFP '10

Sponsor:

SIGPLAN

ICFP '10: ACM SIGPLAN International Conference on Functional Programming

September 30, 2010

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 57 of 143 submissions, 40%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
201
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Voellmy AWang JHudak PYamamoto K(2013)MioACM SIGPLAN Notices10.1145/2578854.250379048:12(129-140)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1145/2578854.2503790
Voellmy AWang JHudak PYamamoto KShan C(2013)MioProceedings of the 2013 ACM SIGPLAN symposium on Haskell10.1145/2503778.2503790(129-140)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1145/2503778.2503790
Strebelow RPrehofer C(2012)Analysis of event processing design patterns and their performance dependency on i/o notification mechanismsProceedings of the 2012 international conference on Multicore Software Engineering, Performance, and Tools10.1007/978-3-642-31202-1_6(54-65)Online publication date: 31-May-2012
https://dl.acm.org/doi/10.1007/978-3-642-31202-1_6
Marlow S(2011)Parallel and concurrent programming in HaskellProceedings of the 4th Summer School conference on Central European Functional Programming School10.1007/978-3-642-32096-5_7(339-401)Online publication date: 14-Jun-2011
https://dl.acm.org/doi/10.1007/978-3-642-32096-5_7
Lesniak M(2011)Thread-Safe priority queues in haskell based on skiplistsProceedings of the 12th international conference on Trends in Functional Programming10.1007/978-3-642-32037-8_8(114-129)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.1007/978-3-642-32037-8_8
Fonseca ARafael JCabral B(2014)Eve: A Parallel Event-Driven Programming LanguageEuro-Par 2014: Parallel Processing Workshops10.1007/978-3-319-14313-2_15(170-181)Online publication date: 2014
https://doi.org/10.1007/978-3-319-14313-2_15
Foltzer AKulkarni ASwords RSasidharan SJiang ENewton R(2012)A meta-scheduler for the par-monadACM SIGPLAN Notices10.1145/2398856.236456247:9(235-246)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2398856.2364562
Foltzer AKulkarni ASwords RSasidharan SJiang ENewton RThiemann PFindler R(2012)A meta-scheduler for the par-monadProceedings of the 17th ACM SIGPLAN international conference on Functional programming10.1145/2364527.2364562(235-246)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2364527.2364562
Strebelow RTribastone MPrehofer C(2012)Performance Modeling of Design Patterns for Distributed ComputationProceedings of the 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems10.1109/MASCOTS.2012.37(251-258)Online publication date: 7-Aug-2012
https://dl.acm.org/doi/10.1109/MASCOTS.2012.37

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Scalable i/o event handling for GHC

Java Event Handling with Cdrom

Lightweight concurrency primitives for GHC