Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lars Nyland

dblp:189/1178 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 75% Processor architecture and microarchitecture · 25%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › multithreading
context switching
0.212016
Enabling efficient preemption for SIMT architectures with lightweight context switching · SC 2016
GPUs and heterogeneous computing
GPU architecture
0.212016
Enabling efficient preemption for SIMT architectures with lightweight context switching · SC 2016
GPUs and heterogeneous computing
preemption
0.212016
Enabling efficient preemption for SIMT architectures with lightweight context switching · SC 2016
GPUs and heterogeneous computing › GPU architecture
SIMT processor
0.212016
Enabling efficient preemption for SIMT architectures with lightweight context switching · SC 2016
Compilers and program optimization
compiler-hardware co-design
0.112016
Enabling efficient preemption for SIMT architectures with lightweight context switching · SC 2016

Methods — techniques the papers use, named apart from their topics

state compression · 0.5context switching · 0.5
YearPublicationVenuePosition
2016 Enabling efficient preemption for SIMT architectures with lightweight context switching
abstract
Context switching is a key technique enabling preemption and time-multiplexing for CPUs. However, for single-instruction multiple-thread (SIMT) processors such as high-end graphics processing units (GPUs), it is challenging to support context switching due to the massive number of threads, which leads to a huge amount of architectural states to be swapped during context switching. The architectural state of SIMT processors includes registers, shared memory, SIMT stacks and barrier states. Recent works present thread-block-level preemption on SIMT processors to avoid context switching overhead. However, because the execution time of a thread block (TB) is highly dependent on the kernel program. The response time of preemption cannot be guaranteed and some TB-level preemption techniques cannot be applied to all kernel functions. In this paper, we propose three complementary ways to reduce and compress the architectural states to achieve lightweight context switching on SIMT processors. Experiments show that our approaches can reduce the register context size by 91.5% on average. Based on lightweight context switching, we enable instruction-level preemption on SIMT processors with compiler and hardware co-design. With our proposed schemes, the preemption latency is reduced by 59.7% on average compared to the naive approach.
Lars Nyland, Huiyang Zhou
SC2