default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam N. Scherer III
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c16]Guohua Jin, John M. Mellor-Crummey
, Laksono Adhianto, William N. Scherer III, Chaoran Yang:
Implementation and Performance Evaluation of the HPC Challenge Benchmarks in Coarray Fortran 2.0. IPDPS 2011: 1089-1100- 2010
- [c15]William N. Scherer III, Laksono Adhianto, Guohua Jin, John M. Mellor-Crummey, Chaoran Yang:
Hiding latency in Coarray Fortran 2.0. PGAS 2010: 14
2000 – 2009
- 2009
- [j2]William N. Scherer III, Doug Lea, Michael L. Scott:
Scalable synchronous queues. Commun. ACM 52(5): 100-111 (2009) - [c14]Jun Shirako, David M. Peixotto, Vivek Sarkar, William N. Scherer III:
Phaser accumulators: A new reduction construct for dynamic parallelism. IPDPS 2009: 1-12 - 2008
- [c13]Jun Shirako, David M. Peixotto, Vivek Sarkar, William N. Scherer III:
Phasers: a unified deadlock-free construct for collective and point-to-point synchronization. ICS 2008: 277-288 - [c12]Rui Zhang, Zoran Budimlic, William N. Scherer III:
Commit phase in timestamp-based stm. SPAA 2008: 326-335 - 2007
- [j1]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. Parallel Process. Lett. 17(4): 411-424 (2007) - [c11]Tongxin Bai, Xipeng Shen, Chengliang Zhang, William N. Scherer III, Chen Ding, Michael L. Scott:
A Key-based Adaptive Transactional Memory Executor. IPDPS 2007: 1-8 - 2006
- [c10]William N. Scherer III, Doug Lea, Michael L. Scott:
Scalable synchronous queues. PPoPP 2006: 147-156 - [c9]Michael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott:
Conflict Detection and Validation Strategies for Software Transactional Memory. DISC 2006: 179-193 - 2005
- [c8]Bijun He, William N. Scherer III, Michael L. Scott:
Preemption Adaptivity in Time-Published Queue-Based Spin Locks. HiPC 2005: 7-18 - [c7]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. OPODIS 2005: 3-16 - [c6]William N. Scherer III, Michael L. Scott:
Advanced contention management for dynamic software transactional memory. PODC 2005: 240-248 - [c5]Virendra J. Marathe, William N. Scherer III, Michael L. Scott:
Adaptive Software Transactional Memory. DISC 2005: 354-368 - 2004
- [c4]Virendra J. Marathe, William N. Scherer III, Michael L. Scott:
Design tradeoffs in modern software transactional memory systems. LCR 2004: 15:1-15:7 - [c3]William N. Scherer III, Michael L. Scott:
Nonblocking Concurrent Data Structures with Condition Synchronization. DISC 2004: 174-187 - 2003
- [c2]Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III:
Software transactional memory for dynamic-sized data structures. PODC 2003: 92-101 - 2001
- [c1]Michael L. Scott, William N. Scherer III:
Scalable queue-based spin locks with timeout. PPoPP 2001: 44-52
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-10-07 21:22 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:
