default search action
Chris C. Kirkham
Person information
- affiliation: University of Manchester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j5]Mohammad Ansari, Mikel Luján, Christos Kotselidis, Kim Jarvis, Chris C. Kirkham, Ian Watson:
Robust Adaptation to Available Parallelism in Transactional Memory Applications. Trans. High Perform. Embed. Archit. Compil. 3: 236-255 (2011) - [j4]Mohammad Ansari, Mikel Luján, Christos Kotselidis, Kim Jarvis, Chris C. Kirkham, Ian Watson:
Transaction Reordering to Reduce Aborts in Software Transactional Memory. Trans. High Perform. Embed. Archit. Compil. 4: 195-214 (2011) - 2010
- [c27]Mohammad Ansari, Behram Khan, Mikel Luján, Christos Kotselidis, Chris C. Kirkham, Ian Watson:
Improving Performance by Reducing Aborts in Hardware Transactional Memory. HiPEAC 2010: 35-49 - [c26]Christos Kotselidis, Mikel Luján, Mohammad Ansari, Konstantinos Malakasis, Behram Khan, Chris C. Kirkham, Ian Watson:
Clustering JVMs with software transactional memory support. IPDPS 2010: 1-12
2000 – 2009
- 2009
- [c25]Mohammad Ansari, Mikel Luján, Christos Kotselidis, Kim Jarvis, Chris C. Kirkham, Ian Watson:
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering. HiPEAC 2009: 4-18 - [c24]Mohammad Ansari, Christos Kotselidis, Mikel Luján, Chris C. Kirkham, Ian Watson:
On the Performance of Contention Managers for Complex Transactional Memory Benchmarks. ISPDC 2009: 83-90 - [c23]Mohammad Ansari, Kim Jarvis, Christos Kotselidis, Mikel Luján, Chris C. Kirkham, Ian Watson:
Profiling Transactional Memory Applications. PDP 2009: 11-20 - 2008
- [j3]Jeremy Singer, Chris C. Kirkham:
Dynamic analysis of Java program concepts for visualization and profiling. Sci. Comput. Program. 70(2-3): 111-126 (2008) - [c22]Mohammad Ansari, Christos Kotselidis, Kim Jarvis, Mikel Luján, Chris C. Kirkham, Ian Watson:
Advanced Concurrency Control for Transactional Memory Using Transaction Commit Rate. Euro-Par 2008: 719-728 - [c21]Mohammad Ansari, Christos Kotselidis, Ian Watson, Chris C. Kirkham, Mikel Luján, Kim Jarvis:
Lee-TM: A Non-trivial Benchmark Suite for Transactional Memory. ICA3PP 2008: 196-207 - [c20]Jisheng Zhao, Matthew Horsnell, Mikel Luján, Ian Rogers, Chris C. Kirkham, Ian Watson:
Adaptive Loop Tiling for a Multi-cluster CMP. ICA3PP 2008: 220-232 - [c19]Christos Kotselidis, Mohammad Ansari, Kim Jarvis, Mikel Luján, Chris C. Kirkham, Ian Watson:
DiSTM: A Software Transactional Memory Framework for Clusters. ICPP 2008: 51-58 - [c18]Christos Kotselidis, Mohammad Ansari, Kim Jarvis, Mikel Luján, Chris C. Kirkham, Ian Watson:
Investigating software Transactional Memory on clusters. IPDPS 2008: 1-6 - [c17]Mohammad Ansari, Christos Kotselidis, Kim Jarvis, Mikel Luján, Chris C. Kirkham, Ian Watson:
Experiences using adaptive concurrency in transactional memory with Lee's routing algorithm. PPoPP 2008: 261-262 - [c16]Ian Rogers, Jisheng Zhao, Chris C. Kirkham, Ian Watson:
Constraint based optimization of stationary fields. PPPJ 2008: 95-104 - [c15]Jeremy Singer, Chris C. Kirkham:
Exploiting the Correspondence between Micro Patterns and Class Names. SCAM 2008: 67-76 - 2007
- [j2]Chris C. Kirkham:
Ranked reservoir sampling: an extension to the reservoir sampling algorithm. Softw. Pract. Exp. 37(12): 1285-1288 (2007) - [c14]Ian Watson, Chris C. Kirkham, Mikel Luján:
A Study of a Transactional Parallel Routing Algorithm. PACT 2007: 388-398 - [c13]Jisheng Zhao, Matthew Horsnell, Ian Rogers, Andrew Dinn, Chris C. Kirkham, Ian Watson:
Optimizing Chip Multiprocessor Work Distribution Using Dynamic Compilation. Euro-Par 2007: 258-267 - 2006
- [c12]Jeremy Singer, Chris C. Kirkham:
Dynamic analysis of program concepts in Java. PPPJ 2006: 31-39 - [c11]Jeremy Singer, Chris C. Kirkham:
Visualized adaptive runtime subsystems. SOFTVIS 2006: 195-196 - 2005
- [c10]Jisheng Zhao, Ian Rogers, Chris C. Kirkham, Ian Watson:
Loop Parallelisation for the Jikes RVM. PDCAT 2005: 35-39 - 2000
- [c9]John Sargeant, Chris C. Kirkham, Ian Watson:
Exploiting Implicit Parallelism in Functional Programs with SLAM. IFL 2000: 19-36
1990 – 1999
- 1996
- [c8]Zhonghua Li, Chris C. Kirkham:
Efficient Storage Reuse of Aggregates in Single Assignment Languages. CC 1996: 238-252 - [c7]Zhonghua Li, Chris C. Kirkham:
Generalized Multiprocessor Scheduling. Euro-Par, Vol. II 1996: 563-572 - 1995
- [c6]Zhonghua Li, Chris C. Kirkham:
Efficient implementation of aggregates in united functions and objects. ACM Southeast Regional Conference 1995: 73-82 - 1994
- [c5]John Sargeant, Chris C. Kirkham, Steve Anderson:
Towards a Computational Model for UFO. IFIP PACT 1994: 299-308
1980 – 1989
- 1986
- [c4]John R. Gurd, P. M. C. C. Barahona, A. P. Wim Böhm, Chris C. Kirkham, A. J. Parker, John Sargeant:
Fine-Grain Parallel Computing: The Dataflow Approach. Future Parallel Computers 1986: 82-152 - [c3]John R. Gurd, Chris C. Kirkham:
Data Flow: Achievements and Prospects (Invited Paper). IFIP Congress 1986: 61-68 - [c2]John Sargeant, Chris C. Kirkham:
Stored Data Structures on the Manchester Dataflow Machine. ISCA 1986: 235-242 - 1985
- [j1]John R. Gurd, Chris C. Kirkham, Ian Watson:
The Manchester Prototype Dataflow Computer. Commun. ACM 28(1): 34-52 (1985) - 1981
- [c1]John R. Gurd, John R. W. Glauert, Chris C. Kirkham:
Generation of dataflow graphical object code for the Lapse programming language. CONPAR 1981: 155-168
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-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint