default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Hasenplaugh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]William Hasenplaugh:
Parallel algorithms for scheduling data-graph computations. Massachusetts Institute of Technology, Cambridge, MA, USA, 2016
Journal Articles
- 2017
- [j5]Syed Kamran Haider, William Hasenplaugh, Dan Alistarh:
Lease/Release: Architectural Support for Scaling Contended Data Structures. ACM Trans. Parallel Comput. 4(2): 8:1-8:25 (2017) - 2016
- [j4]Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. ACM Trans. Parallel Comput. 3(1): 2:1-2:31 (2016) - 2013
- [j3]Samantika Subramaniam, Simon C. Steely Jr., William Hasenplaugh, Aamer Jaleel, Carl J. Beckmann, Tryggve Fossum, Joel S. Emer:
Using in-flight chains to build a scalable cache coherence protocol. ACM Trans. Archit. Code Optim. 10(4): 28:1-28:24 (2013) - 2012
- [j2]William Hasenplaugh, Pritpal S. Ahuja, Aamer Jaleel, Simon C. Steely Jr., Joel S. Emer:
The gradient-based cache partitioning algorithm. ACM Trans. Archit. Code Optim. 8(4): 44:1-44:21 (2012) - 2011
- [j1]Chi-Keung Luk, Ryan Newton, William Hasenplaugh, Mark Hampton, Geoff Lowney:
A Synergetic Approach to Throughput Computing on x86-Based Multicore Desktops. IEEE Softw. 28(1): 39-50 (2011)
Conference and Workshop Papers
- 2021
- [c9]David E. Shaw, Peter J. Adams, Asaph Azaria, Joseph A. Bank, Brannon Batson, Alistair Bell, Michael Bergdorf, Jhanvi Bhatt, J. Adam Butts, Timothy Correia, Robert M. Dirks, Ron O. Dror, Michael P. Eastwood, Bruce Edwards, Amos Even, Peter Feldmann, Michael Fenn, Christopher H. Fenton, Anthony Forte, Joseph Gagliardo, Gennette Gill, Maria Gorlatova, Brian Greskamp, J. P. Grossman, Justin Gullingsrud, Anissa Harper, William Hasenplaugh, Mark Heily, Benjamin Colin Heshmat, Jeremy Hunt, Douglas J. Ierardi, Lev Iserovich, Bryan L. Jackson, Nick P. Johnson, Mollie M. Kirk, John L. Klepeis, Jeffrey S. Kuskin, Kenneth M. Mackenzie, Roy J. Mader, Richard McGowen, Adam McLaughlin, Mark A. Moraes
, Mohamed H. Nasr, Lawrence J. Nociolo, Lief O'Donnell, Andrew Parker, Jon L. Peticolas, Goran Pocina, Cristian Predescu, Terry Quan, John K. Salmon, Carl Schwink, Keun Sup Shim, Naseer Siddique, Jochen Spengler, Tamas Szalay, Raymond Tabladillo, Reinhard Tartler, Andrew G. Taube, Michael Theobald, Brian Towles, William Vick, Stanley C. Wang, Michael Wazlowski, Madeleine J. Weingarten, John M. Williams, Kevin A. Yuh:
Anton 3: twenty microseconds of molecular dynamics simulation before lunch. SC 2021: 1 - 2018
- [c8]Predrag Gruevski, William Hasenplaugh, David Lugato, James Thomas:
Laika: Efficient In-Place Scheduling for 3D Mesh Graph Computations. SPAA 2018: 415-426 - 2016
- [c7]Syed Kamran Haider, William Hasenplaugh, Dan Alistarh:
Lease/release: architectural support for scaling contended data structures. PPoPP 2016: 17:1-17:12 - 2015
- [c6]Erik D. Demaine, Vineet Gopal, William Hasenplaugh:
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing. WADS 2015: 249-262 - 2014
- [c5]Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing dynamic data-graph computations deterministically using chromatic scheduling. SPAA 2014: 154-165 - [c4]William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering heuristics for parallel graph coloring. SPAA 2014: 166-177 - 2011
- [c3]Carole-Jean Wu, Aamer Jaleel, William Hasenplaugh, Margaret Martonosi, Simon C. Steely Jr., Joel S. Emer:
SHiP: signature-based hit predictor for high performance caching. MICRO 2011: 430-441 - 2008
- [c2]Aamer Jaleel, William Hasenplaugh, Moinuddin K. Qureshi, Julien Sebot, Simon C. Steely Jr., Joel S. Emer:
Adaptive insertion policies for managing shared caches. PACT 2008: 208-219 - 2007
- [c1]William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal:
Fast Modular Reduction. IEEE Symposium on Computer Arithmetic 2007: 225-229
Parts in Books or Collections
- 2022
- [p2]William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering Heuristics for Parallel Graph Coloring. Massive Graph Analytics 2022: 193-221 - [p1]Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling. Massive Graph Analytics 2022: 397-429
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-04-24 23:11 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:
