Stephen A. Jarvis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Stephen A. Jarvis has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- David Beckingsale
Lawrence Livermore National Laboratory (LLNL), Livermore, USA
2 shared publications J. A. Herdman
Atomic Weapons Establishment (AWE), Aldermaston (United Kingdom)
2 shared publications- Ligang He
University of Warwick
2 shared publications W. P. Gaudin
Atomic Weapons Establishment (AWE), Aldermaston (United Kingdom)
2 shared publicationsB. T. Gunney
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
1 shared publication- Brown
Department of Computer Science, University of Warwick, Coventry, UK
1 shared publication
Latest Publications
- 15 August 2026
- Published by Springer Nature
- p. 3-16
Constraint Driven Global Data Layout Optimization for Tensor Expressions
- 15 August 2026
- Published by Springer Nature
- p. 3-16
Constraint Driven Global Data Layout Optimization for Tensor Expressions
- 1 June 2021
- Published by Elsevier in Journal of Computational Physics
- Vol. 435
Higher-order particle representation for particle-in-cell simulations
- 1 June 2021
- Published by Elsevier in Journal of Computational Physics
- Vol. 435
Higher-order particle representation for particle-in-cell simulations
- Open Access
- 30 October 2018
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 340, 67-84
Performance of a Second Order Electrostatic Particle-in-Cell Algorithm on Modern Many-Core Architectures
- 30 October 2018
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 340, 67-84
Open AccessPerformance of a Second Order Electrostatic Particle-in-Cell Algorithm on Modern Many-Core Architectures
- Open Access
- 17 November 2014
- Published by Office of Scientific and Technical Information (OSTI)
Parallel Block Structured Adaptive Mesh Refinement on Graphics Processing Units
Block-structured adaptive mesh refinement is a technique that can be used when solving partial differential equations to reduce the number of zones necessary to achieve the required accuracy in areas of interest. These areas (shock fronts, material interfaces, etc.) are recursively covered with finer mesh patches that are grouped into a hierarchy of refinement levels. Despite the potential for large savings in computational requirements and memory usage without a corresponding reduction in accuracy, AMR adds overhead in managing the mesh hierarchy, adding complex communication and data movement requirements to a simulation. In this paper, we describe the design and implementation of a native GPU-based AMR library, including: the classes used to manage data on a mesh patch, the routines used for transferring data between GPUs on different nodes, and the data-parallel operators developed to coarsen and refine mesh data. We validate the performance and accuracy of our implementation using three test problems and two architectures: an eight-node cluster, and over four thousand nodes of Oak Ridge National Laboratory’s Titan supercomputer. Our GPU-based AMR hydrodynamics code performs up to 4.87× faster than the CPU-based implementation, and has been scaled to over four thousand GPUs using a combination of MPI and CUDA.
- 17 November 2014
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessParallel Block Structured Adaptive Mesh Refinement on Graphics Processing Units
Block-structured adaptive mesh refinement is a technique that can be used when solving partial differential equations to reduce the number of zones necessary to achieve the required accuracy in areas of interest. These areas (shock fronts, material interfaces, etc.) are recursively covered with finer mesh patches that are grouped into a hierarchy of refinement levels. Despite the potential for large savings in computational requirements and memory usage without a corresponding reduction in accuracy, AMR adds overhead in managing the mesh hierarchy, adding complex communication and data movement requirements to a simulation. In this paper, we describe the design and implementation of a native GPU-based AMR library, including: the classes used to manage data on a mesh patch, the routines used for transferring data between GPUs on different nodes, and the data-parallel operators developed to coarsen and refine mesh data. We validate the performance and accuracy of our implementation using three test problems and two architectures: an eight-node cluster, and over four thousand nodes of Oak Ridge National Laboratory’s Titan supercomputer. Our GPU-based AMR hydrodynamics code performs up to 4.87× faster than the CPU-based implementation, and has been scaled to over four thousand GPUs using a combination of MPI and CUDA.
- 1 January 2013
- Published by Springer Nature
- p. 210-223
Optimisation of Patch Distribution Strategies for AMR Applications
- 1 January 2013
- Published by Springer Nature
- p. 210-223
Optimisation of Patch Distribution Strategies for AMR Applications
- 1 October 2012
- Published by Elsevier in Future Generation Computer Systems
- Vol. 28 (8) , 1177-1193
Modeling and analyzing the impact of authorization on workflow executions
- 1 October 2012
- Published by Elsevier in Future Generation Computer Systems
- Vol. 28 (8) , 1177-1193
Modeling and analyzing the impact of authorization on workflow executions
- 21 February 2011
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 54 (6) , 960-961
UK Performance Engineering Workshop 2010
This special issue contains four papers selected from the 26th UK Performance Engineering Workshop (UKPEW), which was held during 8–9 July 2010 in the Department of Computer Science at the University of Warwick. UKPEW is the leading UK forum for the presentation of work relating to all aspects of performance modelling and the analysis of computer and telecommunication systems. This year's selected papers demonstrate the variety of topics on offer at UKPEW: performance issues in cloud computing, energy-aware routing in packet networks, source location privacy and multi-hop ad hoc networks for wireless networks.
- 21 February 2011
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 54 (6) , 960-961
UK Performance Engineering Workshop 2010
This special issue contains four papers selected from the 26th UK Performance Engineering Workshop (UKPEW), which was held during 8–9 July 2010 in the Department of Computer Science at the University of Warwick. UKPEW is the leading UK forum for the presentation of work relating to all aspects of performance modelling and the analysis of computer and telecommunication systems. This year's selected papers demonstrate the variety of topics on offer at UKPEW: performance issues in cloud computing, energy-aware routing in packet networks, source location privacy and multi-hop ad hoc networks for wireless networks.
- 1 January 2004
- Published by Springer Nature
- p. 217-224
Hybrid Performance-Oriented Scheduling of Moldable Jobs with QoS Demands in Multiclusters and Grids
- 1 January 2004
- Published by Springer Nature
- p. 217-224
Hybrid Performance-Oriented Scheduling of Moldable Jobs with QoS Demands in Multiclusters and Grids
- 1 January 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15294188,p. 689-693
Self-adaptive and self-optimising resource monitoring for dynamic grid environments
As the number of resources on the grid tends to be very dynamic and potentially large, it becomes increasingly important to discover and monitor them efficiently. This paper concentrates on the scalability, reliability and performance of grid discover and monitoring services, using autonomous concepts. Application scenarios are developed where the notification rate of data is dynamically modified, based on the overhead costs at the MDS3 Index Service. Previously collected performance benchmarks are also utilised to implement two self-adaptive algorithms which are the basis of the scenarios. The objective of these feedback algorithms is to sustain an adequate level of service for clients while minimising costs at the MDS. Different types of workload models are also used to assess the efficiency of the algorithms. Experimental results are subsequently shown when varying notification update mechanisms and decision parameters are used, ensuring that the MDS is scalable with accruing concurrent clients. Therefore, a policy is proposed where the notification rate is computed dynamically, thereby creating an autonomous grid monitoring service.
- 1 January 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15294188,p. 689-693
Self-adaptive and self-optimising resource monitoring for dynamic grid environments
As the number of resources on the grid tends to be very dynamic and potentially large, it becomes increasingly important to discover and monitor them efficiently. This paper concentrates on the scalability, reliability and performance of grid discover and monitoring services, using autonomous concepts. Application scenarios are developed where the notification rate of data is dynamically modified, based on the overhead costs at the MDS3 Index Service. Previously collected performance benchmarks are also utilised to implement two self-adaptive algorithms which are the basis of the scenarios. The objective of these feedback algorithms is to sustain an adequate level of service for clients while minimising costs at the MDS. Different types of workload models are also used to assess the efficiency of the algorithms. Experimental results are subsequently shown when varying notification update mechanisms and decision parameters are used, ensuring that the MDS is scalable with accruing concurrent clients. Therefore, a policy is proposed where the notification rate is computed dynamically, thereby creating an autonomous grid monitoring service.
- 1 January 2002
- Published by Bloomsbury Academic
- p. 88-116
Processes and devices
The basic program unit apparent to a programmer working in a UNIX environment is the ‘process’. An understanding of how processes are handled is fundamental to the effective use of UNIX.
- 1 January 2002
- Published by Bloomsbury Academic
- p. 88-116
Processes and devices
The basic program unit apparent to a programmer working in a UNIX environment is the ‘process’. An understanding of how processes are handled is fundamental to the effective use of UNIX.