2009 |
23 | EE | 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 |
2008 |
22 | EE | 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 |
21 | EE | Behram Khan,
Matthew Horsnell,
Ian Rogers,
Mikel Luján,
Andrew Dinn,
Ian Watson:
An Object-Aware Hardware Transactional Memory System.
HPCC 2008: 93-102 |
20 | EE | 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 |
19 | EE | 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 |
18 | EE | Chrysoulis Zambas,
Mikel Luján:
Introducing Aspects to the Implementation of a Java Fork/Join Framework.
ICA3PP 2008: 294-304 |
17 | EE | 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 |
16 | EE | Christos Kotselidis,
Mohammad Ansari,
Kim Jarvis,
Mikel Luján,
Chris C. Kirkham,
Ian Watson:
Investigating software Transactional Memory on clusters.
IPDPS 2008: 1-6 |
15 | EE | 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 |
14 | EE | Behram Khan,
Matthew Horsnell,
Ian Rogers,
Mikel Luján,
Andrew Dinn,
Ian Watson:
A first insight into object-aware hardware transactional memory.
SPAA 2008: 107-109 |
2007 |
13 | EE | Mikel Luján,
Phyllis Gustafson,
Michael Paleczny,
Christopher A. Vick:
Speculative Parallelization - Eliminating the Overhead of Failure.
HPCC 2007: 460-471 |
12 | EE | Mohamed Hussein,
Kenneth R. Mayes,
Mikel Luján,
John R. Gurd:
Adaptive performance control for distributed scientific coupled models.
ICS 2007: 274-283 |
11 | EE | Ian Watson,
Chris C. Kirkham,
Mikel Luján:
A Study of a Transactional Parallel Routing Algorithm.
PACT 2007: 388-398 |
10 | EE | Jeremy Singer,
Gavin Brown,
Mikel Luján,
Ian Watson:
Towards intelligent analysis techniques for object pretenuring.
PPPJ 2007: 203-208 |
2006 |
9 | EE | Anila Usman,
Mikel Luján,
Len Freeman,
John R. Gurd:
Performance Evaluation of Storage Formats for Sparse Matrices in Fortran.
HPCC 2006: 160-169 |
2005 |
8 | EE | Mikel Luján,
Anila Usman,
Patrick Hardie,
T. L. Freeman,
John R. Gurd:
Storage Formats for Sparse Matrices in Java.
International Conference on Computational Science (1) 2005: 364-371 |
7 | EE | Mikel Luján,
Gibson Mukarakate,
John R. Gurd,
T. L. Freeman:
DIFOJO: A Java Fork/Join Framework for Heterogeneous Networks.
PDP 2005: 297-304 |
6 | EE | Christopher W. Armstrong,
Rupert W. Ford,
John R. Gurd,
Mikel Luján,
Kenneth R. Mayes,
Graham D. Riley:
Performance control of scientific coupled models in Grid environments.
Concurrency - Practice and Experience 17(2-4): 259-295 (2005) |
5 | EE | Mikel Luján,
John R. Gurd,
T. L. Freeman,
José Miguel-Alonso:
Elimination of Java array bounds checks in the presence of indirection.
Concurrency - Practice and Experience 17(5-6): 489-514 (2005) |
4 | EE | Mikel Luján,
T. L. Freeman,
John R. Gurd:
On the conditions necessary for removing abstraction penalties in OOLALA.
Concurrency - Practice and Experience 17(7-8): 839-866 (2005) |
2002 |
3 | EE | Mikel Luján,
Mikel Luján,
John R. Gurd,
T. L. Freeman,
José Miguel-Alonso:
Elimination of Java array bounds checks in the presence of indirection.
Java Grande 2002: 76-85 |
2 | EE | Mikel Luján,
Mikel Luján,
John R. Gurd,
T. L. Freeman,
José Miguel-Alonso:
Elimination of Java array bounds checks in the presence of indirection.
Java Grande 2002: 76-85 |
2000 |
1 | EE | Mikel Luján,
T. L. Freeman,
John R. Gurd:
OoLALA: an object oriented analysis and design of numerical linear algebra.
OOPSLA 2000: 229-252 |