T
Tim Harris
Researcher at Oracle Corporation
Publications - 178
Citations - 15620
Tim Harris is an academic researcher from Oracle Corporation. The author has contributed to research in topics: Transactional memory & Software transactional memory. The author has an hindex of 44, co-authored 173 publications receiving 15244 citations. Previous affiliations of Tim Harris include Amazon.com & Microsoft.
Papers
More filters
Journal ArticleDOI
Xen and the art of virtualization
Paul Barham,Boris Dragovic,Keir Fraser,Steven Hand,Tim Harris,Alex Ho,Rolf Neugebauer,Ian Pratt,Andrew Warfield +8 more
TL;DR: Xen, an x86 virtual machine monitor which allows multiple commodity operating systems to share conventional hardware in a safe and resource managed fashion, but without sacrificing either performance or functionality, considerably outperform competing commercial and freely available solutions.
Proceedings ArticleDOI
The multikernel: a new OS architecture for scalable multicore systems
Andrew Baumann,Paul Barham,Pierre-Évariste Dagand,Tim Harris,Rebecca Isaacs,Simon Peter,Timothy Roscoe,Adrian Schüpbach,Akhilesh Singhania +8 more
TL;DR: This work investigates a new OS structure, the multikernel, that treats the machine as a network of independent cores, assumes no inter-core sharing at the lowest level, and moves traditional OS functionality to a distributed system of processes that communicate via message-passing.
Proceedings ArticleDOI
Composable memory transactions
TL;DR: This paper presents a new concurrency model, based on transactional memory, that offers far richer composition, and describes new modular forms of blocking and choice that have been inaccessible in earlier work.
Journal ArticleDOI
Language support for lightweight transactions
Tim Harris,Keir Fraser +1 more
TL;DR: It is argued that these problems can be addressed by moving to a declarative style of concurrency control in which programmers directly indicate the safety properties that they require, which is easier for mainstream programmers to use, prevents lock-based priority-inversion and deadlock problems and can offer performance advantages.
Book ChapterDOI
A Pragmatic Implementation of Non-blocking Linked-Lists
TL;DR: This work presents a new non-blocking implementation of concurrent linked-lists supporting linearizable insertion and deletion operations, conceptually simpler and substantially faster than previous schemes.