default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMike Rainey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset (Artifact). Dagstuhl Artifacts Ser. 10(2): 21:1-21:10 (2024)- [j5]Sam Westrick
, Matthew Fluet, Mike Rainey, Umut A. Acar:
Automatic Parallelism Management. Proc. ACM Program. Lang. 8(POPL): 1118-1149 (2024) - [c23]Yian Su, Mike Rainey, Nick Wanninger, Nadharm Dhiantravan, Jasper Liang, Umut A. Acar, Peter A. Dinda, Simone Campanoni:
Compiling Loop-Based Nested Parallelism for Irregular Workloads. ASPLOS (2) 2024: 232-250 - [c22]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms {+} Data Layouts {=} Efficient Programs. ECOOP 2024: 38:1-38:28 - [c21]Chaitanya S. Koparkar, Vidush Singhal, Aditya Gupta, Mike Rainey, Michael Vollmer, Artem Pelenitsyn, Sam Tobin-Hochstadt, Milind Kulkarni, Ryan R. Newton:
Garbage Collection for Mostly Serialized Heaps. ISMM 2024: 1-14 - [i4]Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset. CoRR abs/2405.17590 (2024) - 2023
- [i3]Mike Rainey:
The best multicore-parallelization refactoring you've never heard of. CoRR abs/2307.10556 (2023) - 2022
- [c20]Sam Westrick, Mike Rainey, Daniel Anderson, Guy E. Blelloch:
Parallel block-delayed sequences. PPoPP 2022: 61-75 - 2021
- [j4]Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton:
Efficient tree-traversals: reconciling parallelism and dense data representations. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [c19]Mike Rainey, Ryan R. Newton, Kyle C. Hale, Nikos Hardavellas, Simone Campanoni, Peter A. Dinda, Umut A. Acar:
Task parallel assembly language for uncompromising parallelism. PLDI 2021: 1064-1079 - [i2]Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton:
Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations. CoRR abs/2107.00522 (2021)
2010 – 2019
- 2019
- [c18]Michael Vollmer, Chaitanya Koparkar, Mike Rainey, Laith Sakka, Milind Kulkarni, Ryan R. Newton:
LoCal: a language for programs operating on serialized data. PLDI 2019: 48-62 - [c17]Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey:
Provably and practically efficient granularity control. PPoPP 2019: 214-228 - 2018
- [c16]Umut A. Acar, Arthur Charguéraud, Adrien Guatto, Mike Rainey, Filip Sieczkowski:
Heartbeat scheduling: provable efficiency for nested parallelism. PLDI 2018: 769-782 - [c15]Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey:
Performance challenges in modular parallel programs. PPoPP 2018: 381-382 - [e1]Kei Davis, Mike Rainey:
Proceedings of the 7th ACM SIGPLAN International Workshop on Functional High-Performance Computing, FHPC@ICFP 2018, St. Louis, MO, USA, September 29, 2018. ACM 2018 [contents] - 2017
- [c14]Umut A. Acar, Naama Ben-David, Mike Rainey:
Contention in Structured Concurrency: Provably Efficient Dynamic Non-Zero Indicators for Nested Parallelism. PPoPP 2017: 75-88 - [i1]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Parallel Work Inflation, Memory Effects, and their Empirical Analysis. CoRR abs/1709.03767 (2017) - 2016
- [j3]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Oracle-guided scheduling for controlling granularity in implicitly parallel languages. J. Funct. Program. 26: e23 (2016) - [c13]Umut A. Acar, Arthur Charguéraud, Mike Rainey, Filip Sieczkowski:
Dag-calculus: a calculus for parallel computation. ICFP 2016: 18-32 - 2015
- [c12]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
A work-efficient algorithm for parallel unordered depth-first search. SC 2015: 67:1-67:12 - 2014
- [c11]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Theory and Practice of Chunked Sequences. ESA 2014: 25-36 - 2013
- [c10]Lars Bergstrom, Matthew Fluet, Mike Rainey, John H. Reppy, Stephen Rosen, Adam Shaw:
Data-only flattening for nested data parallelism. PPoPP 2013: 81-92 - [c9]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Scheduling parallel programs by work stealing with private deques. PPoPP 2013: 219-228 - 2012
- [j2]Lars Bergstrom, Matthew Fluet, Mike Rainey, John H. Reppy, Adam Shaw:
Lazy tree splitting. J. Funct. Program. 22(4-5): 382-438 (2012) - 2011
- [c8]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Oracle scheduling: controlling granularity in implicitly parallel languages. OOPSLA 2011: 499-518 - 2010
- [j1]Matthew Fluet, Mike Rainey, John H. Reppy, Adam Shaw:
Implicitly threaded parallelism in Manticore. J. Funct. Program. 20(5-6): 537-576 (2010) - [c7]Lars Bergstrom, Mike Rainey, John H. Reppy, Adam Shaw, Matthew Fluet:
Lazy tree splitting. ICFP 2010: 93-104
2000 – 2009
- 2009
- [c6]Matthew Fluet, Lars Bergstrom, Nic Ford, Mike Rainey, John H. Reppy, Adam Shaw, Yingqi Xiao:
Programming in Manticore, a Heterogenous Parallel Functional Language. CEFP 2009: 94-145 - 2008
- [c5]Matthew Fluet, Mike Rainey, John H. Reppy, Adam Shaw:
Implicitly-threaded parallelism in Manticore. ICFP 2008: 119-130 - [c4]Matthew Fluet, Mike Rainey, John H. Reppy:
A scheduling framework for general-purpose parallel languages. ICFP 2008: 241-252 - [c3]Matthias Blume, Mike Rainey, John H. Reppy:
Calling variadic functions from a strongly-typed language. ML 2008: 47-58 - 2007
- [c2]Matthew Fluet, Nic Ford, Mike Rainey, John H. Reppy, Adam Shaw, Yingqi Xiao:
Status report: the manticore project. ML 2007: 15-24 - [c1]Matthew Fluet, Mike Rainey, John H. Reppy, Adam Shaw, Yingqi Xiao:
Manticore: a heterogeneous parallel language. DAMP 2007: 37-44
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 02:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
